Paper 2016/945 Original: eprint.iacr.org/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
Preprint.
History
2016-10-01: last updated
2016-10-01: published
Short URL
https://ia.cr/2016/945
License
https://creativecommons.org/licenses/by/4.0/

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},
      url = {https://eprint.iacr.org/2016/945}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.