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 161 articles , 1 standard article )

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

1 2 3 ... 7 8 9 next

  1. Calderini, Marco; Civino, Roberto; Sala, Massimiliano: On properties of translation groups in the affine general linear group with applications to cryptography (2021)
  2. Chen, Xi; Qu, Longjiang; Fu, Shaojing; Li, Chao: The number of affine equivalent classes and extended affine equivalent classes of vectorial Boolean functions (2021)
  3. Huang, Zhenyu; Sun (c), Yao; Lin, Dongdai: On the efficiency of solving Boolean polynomial systems with the characteristic set method (2021)
  4. Aragona, Riccardo; Calderini, Marco; Civino, Roberto: Some group-theoretical results on Feistel networks in a long-key scenario (2020)
  5. Chakraborti, Avik; Iwata, Tetsu; Minematsu, Kazuhiko; Nandi, Mridul: Blockcipher-based authenticated encryption: how small can we go? (2020)
  6. Kölbl, Stefan; Tischhauser, Elmar; Derbez, Patrick; Bogdanov, Andrey: Troika: a ternary cryptographic hash function (2020)
  7. Lambin, Baptiste; Derbez, Patrick; Fouque, Pierre-Alain: Linearly equivalent s-boxes and the division property (2020)
  8. Roh, Dongyoung; Koo, Bonwook; Jung, Younghoon; Jeong, Il Woong; Lee, Dong-Geon; Kwon, Daesung; Kim, Woo-Hwan: Revised version of block cipher CHAM (2020)
  9. 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)
  10. Aragona, Riccardo; Calderini, Marco; Civino, Roberto; Sala, Massimiliano; Zappatore, Ilaria: Wave-shaped round functions and primitive groups (2019)
  11. Aragona, Riccardo; Civino, Roberto; Gavioli, Norberto; Scoppola, Carlo Maria: Regular subgroups with large intersection (2019)
  12. Aragona, Riccardo; Meneghetti, Alessio: Type-preserving matrices and security of block ciphers (2019)
  13. Belov, S. A.: An algorithm for finding the minimum degree of a polynomial over a finite field for a function over a vector space depending on the choice of an irreducible polynomial (2019)
  14. Bruneau, Nicolas; Christen, Charles; Danger, Jean-Luc; Facon, Adrien; Guilley, Sylvain: Security evaluation against side-channel analysis at compilation time (2019)
  15. Brunetta, Carlo; Calderini, Marco; Sala, Massimiliano: On hidden sums compatible with a given block cipher diffusion layer (2019)
  16. Carlet, Claude; Chen, Xi; Qu, Longjiang: Constructing infinite families of low differential uniformity ((n,m))-functions with (m>n/2) (2019)
  17. Civino, Roberto; Blondeau, Céline; Sala, Massimiliano: Differential attacks: using alternative operations (2019)
  18. Dey, Sabyasachi; Roy, Tapabrata; Sarkar, Santanu: Some results on Fruit (2019)
  19. Gao, Si; Roy, Arnab; Oswald, Elisabeth: Constructing TI-friendly substitution boxes using shift-invariant permutations (2019)
  20. Guo, Chun; Shen, Yaobin; Wang, Lei; Gu, Dawu: Beyond-birthday secure domain-preserving PRFs from a single permutation (2019)

1 2 3 ... 7 8 9 next