From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
DesignersOrange Labs, Ruhr University Bochum and the Technical University of Denmark
First published2007-08-23
Cipher detail
Key sizes80 or 128 bits
Block sizes64 bits

PRESENT is a lightweight block cipher, developed by the Orange Labs (France), Ruhr University Bochum (Germany) and the Technical University of Denmark in 2007. PRESENT is designed by Andrey Bogdanov, Lars R. Knudsen, Gregor Leander, Christof Paar, Axel Poschmann, Matthew J. B. Robshaw, Yannick Seurin, and C. Vikkelsoe.[1] The algorithm is notable for its compact size (about 2.5 times smaller than AES).[2]


The block size is 64 bits and the key size can be 80 bit or 128 bit. The non-linear layer is based on a single 4-bit S-box which was designed with hardware optimizations in mind. PRESENT 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.[2][3]


A truncated differential attack on 26 out of 31 rounds of PRESENT was suggested in 2014.[4]

Several full-round attacks using biclique cryptanalysis have been introduced on PRESENT.[5][6]

By design all block ciphers with a block size of 64 bit can have problems with block collisions if they are used with large amounts of data.[7] Therefore, implementations need to make sure that the amount of data encrypted with the same key is limited and rekeying is properly implemented.


  1. ^ Bogdanov, Andrey; Knudsen, Lars R.; Leander, Gregor; Paar, Christof; Poschmann, Axel; Robshaw, Matthew J. B.; Seurin, Yannick; Vikkelsoe, Charlotte (2007). "PRESENT: An Ultra-Lightweight Block Cipher". Lecture Notes in Computer Science. 4727 (Cryptographic Hardware and Embedded Systems - CHES 2007): 450–466. doi:10.1007/978-3-540-74735-2_31.
  2. ^ a b Katholieke Universiteit Leuven. "Ultra-lightweight encryption method becomes international standard". Archived from the original on 2013-04-06. Retrieved 2012-02-28.
  3. ^ ISO. "ISO/IEC 29192-2:2012". Retrieved 2012-02-28.
  4. ^ Blondeau, Cline; Nyberg, Kaisa (2014). "Links between truncated differential and multidimensional linear properties of block ciphers and underlying attack complexities". Lecture Notes in Computer Science. 8441 (Advances in Cryptology EUROCRYPT 2014): 165–182. doi:10.1007/978-3-642-55220-5_10.
  5. ^ Lee, Changhoon (2014-01-28). "Biclique cryptanalysis of PRESENT-80 and PRESENT-128". The Journal of Supercomputing. 70 (1): 95–103. doi:10.1007/s11227-014-1103-3. ISSN 0920-8542.
  6. ^ Faghihi Sereshgi, Mohammad Hossein; Dakhilalian, Mohammad; Shakiba, Mohsen (2015-10-06). "Biclique cryptanalysis of MIBS-80 and PRESENT-80 block ciphers". Security and Communication Networks. 9: 27–33. doi:10.1002/sec.1375. ISSN 1939-0122.
  7. ^ Karthikeyan Bhargavan, Gaëtan Leurent (2016-08-24). "Sweet32: Birthday attacks on 64-bit block ciphers in TLS and OpenVPN". Retrieved 2016-09-30.

External links[edit]