Paper 2016/945
High throughput in slices: the case of PRESENT, PRINCE and KATAN64 ciphers
Kostas Papapagiannopoulos
Abstract
This paper presents high-throughput assembly implementations of PRESENT, PRINCE and KATAN64 ciphers for the ATtiny family of AVR microcontrollers. We report throughput records, achieving the speed of 2967 clock cycles per block encryption for PRESENT, 1803 cycles for PRINCE and 23671 cycles for KATAN64. In addition, we offer insight into the `slicing' techniques used for high throughput and their application to lightweight cryptographic implementations. We also demonstrate the speed-memory tradeoff by constructing high-throughput implementations with large memory requirements.
Metadata
- Available format(s)
-
PDF
- Category
- Implementation
- Publication info
- Published elsewhere. Radio Frequency Identification: Security and Privacy Issues Volume 8651 of the series Lecture Notes in Computer Science pp 137-155
- DOI
- 10.1007/978-3-319-13066-8_9
- Keywords
- PRESENTPRINCEKATANAVRbitslicing
- Contact author(s)
- kostaspap88 @ gmail com
- History
- 2016-10-01: received
- Short URL
- https://ia.cr/2016/945
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2016/945,
author = {Kostas Papapagiannopoulos},
title = {High throughput in slices: the case of PRESENT, PRINCE and KATAN64 ciphers},
howpublished = {Cryptology ePrint Archive, Paper 2016/945},
year = {2016},
doi = {10.1007/978-3-319-13066-8_9},
note = {\url{https://eprint.iacr.org/2016/945}},
url = {https://eprint.iacr.org/2016/945}
}
