PRESENT is a lightweightblock cipher, developed by theOrange Labs (France),Ruhr University Bochum (Germany) and theTechnical University of Denmark in 2007. PRESENT was 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 thanAES).[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. TheInternational Organization for Standardization and theInternational Electrotechnical Commission included PRESENT in the new international standard for lightweight cryptographic methods.[2][3]
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.
PRESENT uses bit-oriented permutations and is not software-friendly. It is clearly targeted at hardware, where bit-permutations are possible with simple wiring.[8] Performance of PRESENT when evaluated in microcontroller software environment using FELICS (Fair Evaluation of Lightweight Cryptographic Systems),[9] a benchmarking framework for evaluation of software implementations of lightweight cryptographic primitives.
ISO/IEC 29167-11:2014,Information technology - Automatic identification and data capture techniques - Part 11: Crypto suite PRESENT-80 security services for air interface communications[10]
^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".Cryptographic Hardware and Embedded Systems - CHES 2007. Lecture Notes in Computer Science. Vol. 4727. pp. 450–466.doi:10.1007/978-3-540-74735-2_31.ISBN978-3-540-74734-5.
^Blondeau, Cline; Nyberg, Kaisa (2014). "Links between Truncated Differential and Multidimensional Linear Properties of Block Ciphers and Underlying Attack Complexities".Advances in Cryptology – EUROCRYPT 2014. Lecture Notes in Computer Science. Vol. 8441. pp. 165–182.doi:10.1007/978-3-642-55220-5_10.ISBN978-3-642-55219-9.
^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.ISSN1939-0122.
