Computational and energy costs of cryptographic algorithms on handheld devices

Future Internet

Volumn 3, Issue 1, 2011, Pages 31-48

  Rifà Pous, Helena ^a   Herrera Joancomartí, Jordi ^b  

^a UNIVERSITAT OBERTA DE CATALUNYA   (Spain)

^b UNIVERSITAT AUTÒNOMA DE BARCELONA   (Spain)

Author keywords

ARM architecture; Cryptography; Energy; Performance; Time delay; Ubiquitous networks

Indexed keywords

PUBLIC KEY CRYPTOGRAPHY;

CRYPTOGRAPHIC ALGORITHMS; ELLIPTIC CURVES CRYPTOGRAPHY; ENERGY LIMITATIONS; HETEROGENEOUS DEVICES; NETWORK ACTIVITIES; OPERATING SYSTEM FUNCTIONS; PAIRING-BASED CRYPTOGRAPHY; SECURITY SOLUTIONS;

COST BENEFIT ANALYSIS;

EID: 84855203308     PISSN: None     EISSN: 19995903     Source Type: Journal    
DOI: 10.3390/fi3010031     Document Type: Article

References (23)

1. Großschädl, J.; Tillich, S.; Rechberger, C.; Hofmann, M.; Medwed, M. Energy evaluation of software implementations of block ciphers under memory constraints. In Proceedings of Design, Automation and Test in Europe (DATE) Conference, Nice, France, 16–20 April 2007; pp. 1110–1115.
2. Ramachandran, A.; Zhou, Z.; Huang, D. Computing Cryptographic Algorithms in Portable and Embedded Devices. In Proceedings of IEEE International Conference on Portable Information Devices (PORTABLE), Orlando, FL, USA, 25–29 May 2007; pp. 1–7.
3. Hager, C.; Midkiff, S.; Park, J.; Martin, T. Performance and energy efficiency of block ciphers in personal digital assistants. In Proceedings of IEEE International Conference on Pervasive Computing and Communications (PerCom), Kauai Island, HI, USA, 8–12 March 2005; pp. 127–136.
4. Westhoff, D.; Lamparter, B.; Paar, C.; Weimerskirch, A. On digital signatures in ad hoc networks. J. Eur. Trans. Telecom. 2005, 16, 411–425.
5. Potlapally, N.; Ravi, S.; Raghunathan, A.; Jha, N. A study of the energy consumption characteristics of cryptographic algorithms and security protocols. Trans. Mobile Comput. 2006, 5, 128–143.
6. Branovic, I.; Giorgi, R.; Martinelli, E. Memory Performance of Public-Key cryptography Methods in Mobile Environments. In Proceedings of ACM SIGARCH Workshop on MEmory Performance: DEaling with Applications, Systems and Architecture (MEDEA), New Orleans, LA, USA, 27 September–1 October 2003; pp. 24–31.
7. Razvi Doomun, M.; Sunjiv Soyjaudah, K.; Bundhoo, D. Energy consumption and computational analysis of rijndael-AES. In Proceedings of International Conference in Central Asia on Internet, Tashkent, Uzbekistan, 26–28 September 2007; pp. 1–6.
8. Wang, X.; Yin, Y.L.; Yu, H. Finding Collisions in the Full SHA-1. In Proceedings of CRYPTO: 25th Annual International Cryptology Conference, Santa Barbara, CA, USA, 14–18 August 2005; pp. 17–36.
9. Wang, X.; Yu, H. How to Break MD5 and Other Hash Functions. In Proceedings of EUROCRYPT: 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Aarhus, Denmark, 22–26 May 2005; pp. 19–35.
10. Boneh, D.; Lynn, B.; Shacham, H. Short Signatures from the Weil Pairing. J. Cryptol. 2004, 17, 297–319.
11. Boneh, D.; Boyen, X. Short Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups. J. Cryptol. 2008, 21, 149–177.
12. Lynn, B. On the Implementation of Pairing-Based Cryptosystems. Ph.D. Thesis, Standford University, Palo Alto, CA, USA, June 2007.
13. Babbage, S.; Catalano, D.; Cid, C.; Weger, B.; Dunkelman, O.; Gehrmann, C.; Granboulan, L.; Guneysu, T.; Lange, T.; Lenstra, A.; Mitchell, C.; Naslund, M.; Nguyen, P.; Paar, C.; Paterson, K.; Pelzl, J.; Pornin, T.; Preneel, B.; Rechberger, C.; Rijmen, V.; Robshaw, M.; Rupp, A.; Schlaffer, M.; Vaudenay, S.; Vercauteren, D.; Ward, M. Yearly Report on Algorithms and Keysizes (2009-2010); D.SPA.13; ICT-2007-216676; ECRYPT II Network of Excellence, Leuven, Belgium, March 2010.
14. Barker, E.; Barker, W.; Burr, W.; Polk, W.; Smid, M. NIST, Recommendation for Key Management, Part 1: General (Revised); Technical Report; Special Publication 800-57; US National Institute for Standards and Technology, Gaithersburg, MD, USA, March 2007.
15. Wiener, M.J.; Handschuh, H.; Paillier, P.; Rivest, R.L.; Biham, E.; Knudsen, L.R. Performance Comparison of Public-Key Cryptosystems, SmartCard Crypto-Coprocessors for Public-Key Cryptography, Chaffing and Winnowing: Confidentiality without Encryption, DES, Triple-DES and AES. CryptoBytes 1998, 4, 1–3.
16. Endrodi, C. Efficiency Analysis and Comparison of Public Key Algorithms; Technical Report; SEARCH Laboratory, Budapest, Hungary, 2002.
17. Jansma, N.; Arrendondo, B. Performance Comparison of Elliptic Curve and RSA Digital Signatures; Technical Report; University of Michigan, Ann Arbor, MI, USA, 2004.
18. Cronin, E.; Jamin, S.; Malkin, T.; McDaniel, P. On the performance, feasibility, and use of forward-secure signatures. In Proceedings of ACM Conference on Computer and Communication Security, Washington, DC, USA, 27–30 October 2003; pp. 131–144.
19. Miller, V.S. The Weil Pairing, and its Efficient Calculation. J. Cryptol. 2004, 17, 235–261.
20. Zhao, M.; Smith, S.W.; Nicol, D.M. Aggregated path authentication for efficient BGP security. In Proceedings of ACM Conference on Computer and Communication Security, Alexandria, VA, USA, 7–11 November 2005; pp. 128–138.
21. Barreto, P.S. A note on efficient computation of cube roots in characteristic 3; Report 2004/305; Cryptology ePrint Archive, 2004. Available online: http://eprint.iacr.org/2004/305/(accessed on 31 January 2011).
22. Gupta, V.; Gupta, S.; Chang, S.; Stebila, D. Performance analysis of elliptic curve cryptography for SSL. In Proceedings of ACM Workshop on Wireless Security (WiSe), Atlanta, GA, USA, 28 September 2002; pp. 87–94.
23. Lee, J.; Bahk, S. Energy efficient scheduling for downlink elastic traffic in wireless networks. Wirel. Comm. Mobile Comput. 2010, 10, 932–941.