1 Department of Mathematics, Technical University of Denmark2 Discrete mathematics, Department of Mathematics, Technical University of Denmark3 Department of Applied Mathematics and Computer Science, Technical University of Denmark4 Ruhr-University Bochum5 NXP Semiconductors
his paper presents a block cipher that is optimized with respect to latency when implemented in hardware. Such ciphers are desirable for many future pervasive applications with real-time security needs. Our cipher, named PRINCE, allows encryption of data within one clock cycle with a very competitive chip area compared to known solutions. The fully unrolled fashion in which such algorithms need to be implemented calls for innovative design choices. The number of rounds must be moderate and rounds must have short delays in hardware. At the same time, the traditional need that a cipher has to be iterative with very similar round functions disappears, an observation that increases the design space for the algorithm. An important further requirement is that realizing decryption and encryption results in minimum additional costs. PRINCE is designed in such a way that the overhead for decryption on top of encryption is negligible. More precisely for our cipher it holds that decryption for one key corresponds to encryption with a related key. This property we refer to as α-reflection is of independent interest and we prove its soundness against generic attacks.
Lecture Notes in Computer Science: 18th International Conference on the Theory and Application of Cryptology and Information Security, Beijing, China, December 2-6, 2012. Proceedings, 2012, p. 208-225
Main Research Area:
Lecture Notes in Computer Science
18th International Conference on the Theory and Application of Cryptology and Information Security, 2012