Low-latency encryption - Is "lightweight = light + wait"?

62Citations
Citations of this article
69Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The processing time required by a cryptographic primitive implemented in hardware is an important metric for its performance but it has not received much attention in recent publications on lightweight cryptography. Nevertheless, there are important applications for cost effective low-latency encryption. As the first step in the field, this paper explores the low-latency behavior of hardware implementations of a set of block ciphers. The latency of the implementations is investigated as well as the trade-offs with other metrics such as circuit area, time-area product, power, and energy consumption. The obtained results are related back to the properties of the underlying cipher algorithm and, as it turns out, the number of rounds, their complexity, and the similarity of encryption and decryption procedures have a strong impact on the results. We provide a qualitative description and conclude with a set of recommendations for aspiring low-latency block cipher designers. © 2012 International Association for Cryptologic Research.

Cite

CITATION STYLE

APA

Knežević, M., Nikov, V., & Rombouts, P. (2012). Low-latency encryption - Is “lightweight = light + wait”? In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7428 LNCS, pp. 426–446). Springer Verlag. https://doi.org/10.1007/978-3-642-33027-8_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free