PRINCE

PRINCE -- a low-latency block cipher for pervasive computing applications. Extended abstract. This 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 $alpha $-reflection is of independent interest and we prove its soundness against generic attacks.


References in zbMATH (referenced in 47 articles , 1 standard article )

Showing results 1 to 20 of 47.
Sorted by year (citations)

1 2 3 next

  1. Civino, Roberto; Blondeau, Céline; Sala, Massimiliano: Differential attacks: using alternative operations (2019)
  2. Fu, Shihui; Feng, Xiutao: Involutory differentially 4-uniform permutations from known constructions (2019)
  3. Canteaut, Anne; Carpov, Sergiu; Fontaine, Caroline; Lepoint, Tancrède; Naya-Plasencia, María; Paillier, Pascal; Sirdey, Renaud: Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression (2018)
  4. Koo, Bonwook; Roh, Dongyoung; Kim, Hyeonjin; Jung, Younghoon; Lee, Dong-Geon; Kwon, Daesung: CHAM: a family of lightweight block ciphers for resource-constrained devices (2018)
  5. Lee, Jooyoung: Key alternating ciphers based on involutions (2018)
  6. Liu, Yunwen; Rijmen, Vincent: New observations on invariant subspace attack (2018)
  7. Liu, Yunwen; Rijmen, Vincent; Leander, Gregor: Nonlinear diffusion layers (2018)
  8. Boura, Christina; Canteaut, Anne; Knudsen, Lars R.; Leander, Gregor: Reflection ciphers (2017)
  9. Chakraborty, Kaushik; Sarkar, Sumanta; Maitra, Subhamoy; Mazumdar, Bodhisatwa; Mukhopadhyay, Debdeep; Prouff, Emmanuel: Redefining the transparency order (2017)
  10. Dubrova, Elena; Hell, Martin: Espresso: a stream cipher for 5G wireless communication systems (2017)
  11. Hao, Yonglin; Meier, Willi: Truncated differential based known-key attacks on round-reduced SIMON (2017)
  12. Banik, Subhadeep; Bogdanov, Andrey; Regazzoni, Francesco: Exploring energy efficiency of lightweight block ciphers (2016)
  13. Banik, Subhadeep; Bogdanov, Andrey; Regazzoni, Francesco: Atomic-AES: a compact implementation of the AES encryption/decryption core (2016)
  14. Beierle, Christof; Jean, Jérémy; Kölbl, Stefan; Leander, Gregor; Moradi, Amir; Peyrin, Thomas; Sasaki, Yu; Sasdrich, Pascal; Sim, Siang Meng: The (\mathttSKINNY) family of block ciphers and its low-latency variant (\mathttMANTIS) (2016)
  15. Biryukov, Alex; Dinu, Daniel; Großschädl, Johann: Correlation power analysis of lightweight block ciphers: from theory to practice (2016)
  16. Biryukov, Alex; Leurent, Gaëtan; Perrin, Léo: Cryptanalysis of Feistel networks with secret round functions (2016)
  17. Boura, Christina; Canteaut, Anne: Another view of the division property (2016)
  18. Canteaut, Anne; Duval, Sébastien; Leurent, Gaëtan: Construction of lightweight S-boxes using Feistel and MISTY structures (2016)
  19. Derbez, Patrick; Fouque, Pierre-Alain: Automatic search of meet-in-the-middle and impossible differential attacks (2016)
  20. Esgin, Muhammed F.; Kara, Orhun: Practical cryptanalysis of full Sprout with TMD tradeoff attacks (2016)

1 2 3 next