PRESENT

PRESENT is a new ultra lightweight block cipher algorithm, developed by the Orange Labs (France), Ruhr University Bochum (Germany) and the Technical University of Denmark. PRESENT is designed by Andrey Bogdanov, Lars R. Knudsen, Gregor Leander, Christof Paar, Axel Poschmann, Matthew J. B. Robshaw, Yannick Seurin, and C. Vikkelsoe. It is one of the most compact encryption methods ever designed and is 2.5 times smaller than AES (Advanced Encryption Standard).[1] The block size is 64 bits and the key size can be 80 bit or 128 bit. It is intended to be used in situations where low-power consumption and high chip efficiency is desired. The International Organization for Standardization and the International Electrotechnical Commission included PRESENT in the new international standard for lightweight cryptographic methods


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

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

1 2 3 ... 6 7 8 next

  1. Chakraborti, Avik; Iwata, Tetsu; Minematsu, Kazuhiko; Nandi, Mridul: Blockcipher-based authenticated encryption: how small can we go? (2020)
  2. Kölbl, Stefan; Tischhauser, Elmar; Derbez, Patrick; Bogdanov, Andrey: Troika: a ternary cryptographic hash function (2020)
  3. Zhao, Boxin; Dong, Xiaoyang; Meier, Willi; Jia, Keting; Wang, Gaoli: Generalized related-key rectangle attacks on block ciphers with linear key schedule: applications to SKINNY and GIFT (2020)
  4. Aragona, Riccardo; Calderini, Marco; Civino, Roberto; Sala, Massimiliano; Zappatore, Ilaria: Wave-shaped round functions and primitive groups (2019)
  5. Aragona, Riccardo; Civino, Roberto; Gavioli, Norberto; Scoppola, Carlo Maria: Regular subgroups with large intersection (2019)
  6. Aragona, Riccardo; Meneghetti, Alessio: Type-preserving matrices and security of block ciphers (2019)
  7. Brunetta, Carlo; Calderini, Marco; Sala, Massimiliano: On hidden sums compatible with a given block cipher diffusion layer (2019)
  8. Carlet, Claude; Chen, Xi; Qu, Longjiang: Constructing infinite families of low differential uniformity ((n), (m))-functions with (m>n/2) (2019)
  9. Civino, Roberto; Blondeau, Céline; Sala, Massimiliano: Differential attacks: using alternative operations (2019)
  10. Dey, Sabyasachi; Roy, Tapabrata; Sarkar, Santanu: Some results on Fruit (2019)
  11. Gao, Si; Roy, Arnab; Oswald, Elisabeth: Constructing TI-friendly substitution boxes using shift-invariant permutations (2019)
  12. Guo, Chun; Shen, Yaobin; Wang, Lei; Gu, Dawu: Beyond-birthday secure domain-preserving PRFs from a single permutation (2019)
  13. Li, Ting; Sun, Yao; Huang, Zhenyu; Wang, Dingkang; Lin, Dongdai: Speeding up the GVW algorithm via a substituting method (2019)
  14. Mariot, Luca; Picek, Stjepan; Leporati, Alberto; Jakobovic, Domagoj: Cellular automata based S-boxes (2019)
  15. Aragona, Riccardo; Calderini, Marco; Tortora, Antonio; Tota, Maria: Primitivity of PRESENT and other lightweight ciphers (2018)
  16. Boura, Christina; Lallemand, Virginie; Naya-Plasencia, María; Suder, Valentin: Making the impossible possible (2018)
  17. Calderini, Marco: A note on some algebraic trapdoors for block ciphers (2018)
  18. Chen, Shan; Lampe, Rodolphe; Lee, Jooyoung; Seurin, Yannick; Steinberger, John: Minimizing the two-round Even-Mansour cipher (2018)
  19. Forler, Christian; List, Eik; Lucks, Stefan; Wenzel, Jakob: \textscPOEx: a beyond-birthday-bound-secure on-line cipher (2018)
  20. Hamann, Matthias; Krause, Matthias; Meier, Willi; Zhang, Bin: Design and analysis of small-state grain-like stream ciphers (2018)

1 2 3 ... 6 7 8 next