Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

On Energy Optimization in Cryptographic Hash Functions and Symmetric Key Protocols

Version 1 : Received: 20 February 2017 / Approved: 21 February 2017 / Online: 21 February 2017 (10:28:30 CET)

How to cite: Roy, S.; Harish, P.; Talluri, R. On Energy Optimization in Cryptographic Hash Functions and Symmetric Key Protocols. Preprints 2017, 2017020079. https://doi.org/10.20944/preprints201702.0079.v1 Roy, S.; Harish, P.; Talluri, R. On Energy Optimization in Cryptographic Hash Functions and Symmetric Key Protocols. Preprints 2017, 2017020079. https://doi.org/10.20944/preprints201702.0079.v1

Abstract

In this work we study the energy consumption by various modern secured hash functions (MD2, MD5, SHA-1, and SHA-2) and modern symmetric key encryption protocols (Blowfish, DES, 3DES, and AES) from the algorithmic perspective. We identify various parameters that moderate energy consumption of these hashes and protocols. Our work is directed towards redesigning or modifying these algorithms to make them consume lesser energy. As a first step, we try to determine the applicability of the asymptotic energy complexity model by Roy et. al. on these hashes and protocols. Specifically, we try to observe whether parallelizing the access of blocks of data in these algorithms reduces their energy consumption based on the energy model. Our results confirm the applicability of the energy model on these hashes and protocols. Our work is motivated by the relevance and importance of cryptographic hashes and symmetric key protocols for modern ICT (Information and Communication Technology), and ICT enabled industry to keep them protected from dynamically changing threat scenarios. Hence the design of more energy efficient hashes and protocols will definitely contribute in reducing the ICT energy consumption that is continuously increasing.

Keywords

secured hashes; symmetric key encryption; energy optimization

Subject

Computer Science and Mathematics, Analysis

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.