Energy Efficient Lightweight Cryptography Algorithms for IoT Devices
Abstract
Over few decades, people have been working on providing security solutions, whereas attackers too have been working simultaneously. We present an evaluation of security algorithms, comparing performances and robustness. These comparisons are performed after hardware implementation and use crypt analysis. The targeted devices are wrist watches, RFID tags, IoT devices and others, which don't have a lot of areas (millions of gate equivalent). While performing this, the primary concern has been exploration of an algorithm that can work in these constrained limits. This led to a search for an algorithm that has low hardware footprints, low power consumption and better speed but at the same time implements adequate security. PRESENT has been found to be one such suitable algorithm. It has been also included in the new international standard for light-weight cryptographic methods under ISO/IEC 29192-2:2012 for its straight forward and light design. Our paper reports hardware implementation results of PRESENT, AES, ECDH, DH and RSA cryptography algorithms. We have implemented these algorithms with standard gate library of UMC-90 nm. Each algorithm has its own architecture and hence requires different crypt-analysis techniques like brute force, Pollard's Rho and biclique for “difficulty to break” measurement. It is a measure in term of time and data complexity of efforts required of a cryptographic attack. We have obtained 1.7× improvement in area and 63× improvement in power for modi…
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Energy-efficient cryptographic protocols such as the Energy-Efficient Lightweight Block Cipher demonstrate reduced energy consumption without compromising security.
“Protocols such as the Energy-Efficient Lightweight Block Cipher demonstrate reduced energy consumption without compromising security [76,78].”
From Privacy-preserving security of IoT networks: A comparative analysis of methods and applications (2025) · cites this paper as [78]
Cites
Biclique Cryptanalysis of the Full AES
Bogdanov, A., Khovratovich, D., & Rechberger, C. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25385-0_19 · Cited by 546 · cited 1× · see citing works
“2 19 2 127.81 PRESENT-128 [29] Full (31) 2 44 2 127.37 PRESENT-128 [32] Full (31) 2 23 2 127.32 AES-128 [30] Full (10) 2 88 2 126.18 AES-128 [31] Full (10) 2 56 2 126.13 Here, d = 3, C biclique is the cost for constructing a biclique ( = 2 3 + 1 ∗ 431 = 2 1.05 ), C precomp is the precom-putation of…”
InfluentialImproving the Biclique Cryptanalysis of AES
Tao, B., & Wu, H. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-19962-7_3 · Cited by 43 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
Privacy-preserving security of IoT networks: A comparative analysis of methods and applications
Wakili, A., & Bakkali, S. (2025) · Cyber Security and Applications · doi:10.1016/j.csa.2025.100084 · Cited by 30 · see citing works
- Authors
- Goyal, T. K., Sahula, V., & Kumawat, D.
- Affiliations
- Malaviya National Institute of Technology Jaipur (IN)
- Venue
- IETE Journal of Research
- Publisher
- Informa UK Limited
- Published
- 2019-11-07
- Volume
- 68
- Issue
- 3
- Pages
- 1722-1735
- ISSN
- 0377-2063 (ISSN-L)
- 0974-780X
- OpenAlex
- W2985143708
- Cited by
- 47
- References
- 2
- Citations by year
- 2026: 6 · 2025: 15 · 2024: 12 · 2023: 4 · 2022: 3 · 2021: 4 · 2020: 3
- FWCI
- 1.15
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- IETE Journal of Research (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
- Physical Sciences › Computer Science › Information Systems › Cryptography and Residue Arithmetic
- Physical Sciences › Computer Science › Artificial Intelligence › Coding theory and cryptography
- Keywords
- lightweight cryptography, PRESENT block cipher, Internet of Things security, hardware implementation, power consumption, area efficiency, cryptanalysis, brute force attacks, AES, elliptic curve Diffie-Hellman, Diffie-Hellman, RFID tags, wristwatches, 90 nm CMOS
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review