Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Algorithm

PRESENT

Cryptographic Algorithm

PRESENT is a lightweight block cipher designed for hardware that has very little room and very little power to spend. It was developed in 2007 by a team drawn from Orange Labs in France, Ruhr University Bochum in Germany and the Technical University of Denmark, with Andrey Bogdanov, Lars R. Knudsen, Gregor Leander, Christof Paar, Axel Poschmann, Matthew J. B. Robshaw, Yannick Seurin and C. Vikkelsoe named as its designers. Its main selling point is compactness: the source describes it as about three times smaller than AES. It works on 64-bit blocks with a key of either 80 or 128 bits, and its non-linear layer rests on a single 4-bit S-box chosen with hardware efficiency in mind. It is aimed at settings where low power consumption and high chip efficiency matter, and the International Organization for Standardization and the International Electrotechnical Commission have included it in their standards for lightweight cryptographic methods, ISO/IEC 29192-2 for block ciphers and ISO/IEC 29167-11 for air interface security. Because it relies on bit-oriented permutations, which are cheap wiring in hardware, it performs poorly in software. Published cryptanalysis includes a truncated differential attack on 26 of its 31 rounds and several full-round biclique attacks, and as with any 64-bit block cipher, users must limit the data encrypted under one key and rekey properly to avoid block collisions.

Connections

In Field

Cryptography, Fields
Source PRESENT (Wikipedia)
In the Other Atlases

Developed By

Also in Business Atlas: the developer of this subject.

Source PRESENT (Wikipedia)Lead
Quote, Lead
developed by Orange Labs (France), Ruhr University Bochum (Germany) and the Technical University of Denmark in 2007
Sources
PRESENT (Wikipedia)
Lead
Quote, Lead
developed by Orange Labs (France), Ruhr University Bochum (Germany) and the Technical University of Denmark in 2007
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.