Performance analysis of IPSec protocol: encryption and authentication

Elkeelany, Omar; Matalgah, Mustafa M.; Sheikh, K.; Thaker, M.; Chaudhry, G.; Medhi, Deep; Qaddour, Jihad

doi:10.1109/icc.2002.997033

Cited by 72 publications

(26 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Recently there have been some efforts devoted to the development of real-time applications on Grids [9]. Realtime applications depend not only on results of computation, but also on time instants at which these results become available [13].…”

Section: Introductionmentioning

confidence: 99%

Enhancing Security of Real-Time Applications on Grids Through Dynamic Scheduling

Xie

Qin

2005

Job Scheduling Strategies for Parallel Processing

View full text Add to dashboard Cite

show abstract

Section: Introductionmentioning

confidence: 99%

Enhancing Security of Real-Time Applications on Grids Through Dynamic Scheduling

Xie

Qin

2005

Job Scheduling Strategies for Parallel Processing

View full text Add to dashboard Cite

show abstract

“…Change in various processing times with changes in MIPS capability of a processor has been modeled [14]. Some symmetric and asymmetric key algorithms have been evaluated on higher end microprocessors on the basis of power consumption [7].…”

Section: Related Workmentioning

confidence: 99%

“…RC4 [2] is used in IEEE 802.11 WEP [13], IDEA [2] and MD5 [2], [3] are part of PGP [11], SHA-1 [4] and MD5 [2][3] are included in the security architecture for Internet Protocol (IPSEC) [14], [10], and RC5 [1] has been suggested as a good algorithm for sensor networks [12]. These algorithms offer variety in the mode in which they operate and encompass different mathematical and data manipulation operations.…”

Section: Algorithmsmentioning

confidence: 99%

Analyzing and modeling encryption overhead for sensor network nodes

Ganesan

Venugopalan

Peddabachagari

et al. 2003

Proceedings of the 2nd ACM International Conference on Wireless Sensor Networks and Applications

184

View full text Add to dashboard Cite

Recent research in sensor networks has raised security issues for small embedded devices. Security concerns are motivated by the deployment of a large number of sensory devices in the field. Limitations in processing power, battery life, communication bandwidth and memory constrain the applicability of existing cryptography standards for small embedded devices. A mismatch between wide arithmetic for security (32 bit word operations) and embedded data bus widths (often only 8 or 16 bits) combined with lack of certain operations (e.g., multiply) in the ISA present other challenges. This paper offers two contributions. First, a survey investigating the computational requirements for a number of popular cryptographic algorithms and embedded architectures is presented. The objective of this work is to cover a wide class of commonly used encryption algorithms and to determine the impact of embedded architectures on their performance. This will help designers predict a system's performance for cryptographic tasks. Second, methods to derive the computational overhead of embedded architectures in general for encryption algorithms are developed. This allows one to project computational limitations and determine the threshold of feasible encryption schemes under a set of the constraints for an embedded architecture.Experimental measurements indicate uniform cryptographic cost for each encryption class and each architecture class and negligible impact of caches. RC4 is shown to outperform RC5 for the Motes Atmega platform contrary to the choice of RC5 for the Motes project, a choice driven in large by memory constraints. The analytical model allows to assess the impact of arbitrary embedded architectures as a multi-variant function for each encryption scheme. Overall, our results are not only valuable to assess the feasibility of encryption schemes for existing embedded architectures, they also extend to assess the feasibility of encryption methods for new algorithms and architectures for sensor systems.

show abstract

“…Suppose the 3DES encryption algorithm is applied to a real-time cluster consisting of 100 MIPS machines. The time complexity of 3DES indicates an 800 bps (bit per second) encryption rate on a 100 MIPS machine [11]. Further, computation overhead caused by encryption is a linear function of the amount of data (input file size) to be protected [11].…”

Section: Encryption Overheadmentioning

confidence: 99%

“…The time complexity of 3DES indicates an 800 bps (bit per second) encryption rate on a 100 MIPS machine [11]. Further, computation overhead caused by encryption is a linear function of the amount of data (input file size) to be protected [11]. As mentioned in Section 3.2, l i (measured in KB) denotes the amount of data in task T i needed to be protected.…”

Section: Encryption Overheadmentioning

confidence: 99%