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

Showing results 21 to 40 of 179.
Sorted by year (citations)

previous 1 2 3 4 ... 7 8 9 next

  1. Roh, Dongyoung; Koo, Bonwook; Jung, Younghoon; Jeong, Il Woong; Lee, Dong-Geon; Kwon, Daesung; Kim, Woo-Hwan: Revised version of block cipher CHAM (2020)
  2. Saha, Sayandeep; Bag, Arnab; Basu Roy, Debapriya; Patranabis, Sikhar; Mukhopadhyay, Debdeep: Fault template attacks on block ciphers exploiting fault propagation (2020)
  3. Zajac, Pavol; Jókay, Matúš: Cryptographic properties of small bijective S-boxes with respect to modular addition (2020)
  4. 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)
  5. Aragona, Riccardo; Calderini, Marco; Civino, Roberto; Sala, Massimiliano; Zappatore, Ilaria: Wave-shaped round functions and primitive groups (2019)
  6. Aragona, Riccardo; Civino, Roberto; Gavioli, Norberto; Scoppola, Carlo Maria: Regular subgroups with large intersection (2019)
  7. Aragona, Riccardo; Meneghetti, Alessio: Type-preserving matrices and security of block ciphers (2019)
  8. 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)
  9. Bruneau, Nicolas; Christen, Charles; Danger, Jean-Luc; Facon, Adrien; Guilley, Sylvain: Security evaluation against side-channel analysis at compilation time (2019)
  10. Brunetta, Carlo; Calderini, Marco; Sala, Massimiliano: On hidden sums compatible with a given block cipher diffusion layer (2019)
  11. Carlet, Claude; Chen, Xi; Qu, Longjiang: Constructing infinite families of low differential uniformity ((n,m))-functions with (m>n/2) (2019)
  12. Civino, Roberto; Blondeau, Céline; Sala, Massimiliano: Differential attacks: using alternative operations (2019)
  13. Dey, Sabyasachi; Roy, Tapabrata; Sarkar, Santanu: Some results on Fruit (2019)
  14. Gao, Si; Roy, Arnab; Oswald, Elisabeth: Constructing TI-friendly substitution boxes using shift-invariant permutations (2019)
  15. Guo, Chun; Shen, Yaobin; Wang, Lei; Gu, Dawu: Beyond-birthday secure domain-preserving PRFs from a single permutation (2019)
  16. Jangra, Monika; Singh, Buddha: Performance analysis of CLEFIA and PRESENT lightweight block ciphers (2019)
  17. Li, Ting; Sun, Yao; Huang, Zhenyu; Wang, Dingkang; Lin, Dongdai: Speeding up the GVW algorithm via a substituting method (2019)
  18. Mariot, Luca; Picek, Stjepan; Leporati, Alberto; Jakobovic, Domagoj: Cellular automata based S-boxes (2019)
  19. Aragona, Riccardo; Calderini, Marco; Tortora, Antonio; Tota, Maria: Primitivity of PRESENT and other lightweight ciphers (2018)
  20. Boura, Christina; Lallemand, Virginie; Naya-Plasencia, María; Suder, Valentin: Making the impossible possible (2018)

previous 1 2 3 4 ... 7 8 9 next