Prince is a block cipher targeting low latency, unrolled hardware implementations. It is based on the so-called FX construction.^[2] Its most notable feature is thealpha reflection: the decryption is the encryption with a related key which is very cheap to compute. Unlike most other "lightweight" ciphers, it has a small number of rounds and the layers constituting a round have low logic depth. As a result, fully unrolled implementation are able to reach much higher frequencies thanAES orPRESENT. According to the authors, for the same time constraints and technologies, PRINCE uses 6–7 times less area than PRESENT-80 and 14–15 times less area than AES-128.^[3]

This sectionneeds additional citations forverification. Please helpimprove this article byadding citations to reliable sources in this section. Unsourced material may be challenged and removed.(May 2024) (Learn how and when to remove this message)

The block size is 64 bits and the key size is 128 bits. The key is split into two 64 bit keys${\displaystyle K_0}$ and${\displaystyle K_1}$. The input is XORed with${\displaystyle K_0}$, then is processed by a core function using${\displaystyle K_1}$. The output of the core function is xored by${\displaystyle K_0^{\prime }}$ to produce the final output (${\displaystyle K_0^{\prime }}$ is a value derived from${\displaystyle K_0}$). The decryption is done by exchanging${\displaystyle K_0}$ and${\displaystyle K_0^{\prime }}$ and by feeding the core function with${\displaystyle K_1}$ xored with a constant denoted alpha.^[4]

The core function contain 5 "forward" rounds, a middle round, and 5 "backward" rounds, for 11 rounds in total. The original paper mentions 12 rounds without explicitly depicting them; if the middle round is counted as two rounds (as it contains two nonlinear layers), then the total number of rounds is 12.

A forward round starts with a round constant XORed with${\displaystyle K_1}$, then a nonlinear layer${\displaystyle S}$, and finally a linear layer${\displaystyle M}$. The "backward" rounds are exactly the inverse of the "forward" rounds except for the round constants.

The nonlinear layer is based on a single 4-bitS-box which can be chosen among the affine-equivalent of 8 specified S-boxes.

The linear layer consists of multiplication by a 64x64 matrix${\displaystyle M^{\prime }}$ and a shift row similar to the one inAES but operating on 4-bit nibbles rather than bytes.

${\displaystyle M^{\prime }}$ is constructed from 16x16 matrices${\displaystyle M_0}$ and${\displaystyle M_1}$ in such a way that the multiplication by${\displaystyle M^{\prime }}$ can be computed by four smaller multiplications, two using${\displaystyle M_0}$ and two using${\displaystyle M_1}$.

The middle round consists of the${\displaystyle S}$ layer followed by${\displaystyle M^{\prime }}$ followed by the${\displaystyle S^{-1}}$ layer.

To encouragecryptanalysis of the Prince cipher, the organizations behind it created the"Prince challenge". Archived fromthe original on 2016-10-23. Retrieved2016-10-09.

The paper "Security analysis of PRINCE"^[1] presents several attacks on full and round reduced variants, in particular, an attack of complexity 2^125.1 and a related key attack requiring 2³³ data.

A generic time–memory–data tradeoff for FX constructions has been published, with an application to Prince.^[5] The paper argues that the FX construction is a fine solution to improve the security of a widely deployed cipher (likeDES-X did forDES) but that it is a questionable choice for new designs. It presents a tweak to the Prince cipher to strengthen it against this particular kind of attack.

Abiclique cryptanalysis attack has been published on the full cipher. It is somewhat inline with the estimation of the designers since it reduces the key search space by 2^1.28 (the original paper mentions a factor 2).^[6]

The paper "Reflection Cryptanalysis of PRINCE-Like Ciphers" focuses on the alpha reflection and establishes choice criteria for the alpha constant. It shows that a poorly chosen alpha would lead to efficient attacks on the full cipher; but the value randomly chosen by the designers is not among the weak ones.^[7]

Several meet-in-the-middle attacks have been published on round reduced versions.^[8][9][10]

An attack in the multi-user setting can find the keys of 2 users among a set of 2³² users in time 2⁶⁵.^[11]

An attack on 10 rounds with overall complexity of 118.56 bits has been published.^[12]

An attack on 7 rounds with time complexity of 2⁵⁷ operations has been published.^[13]

A differential fault attack has been published using 7 faulty cipher texts under random 4 bit nibble fault model.^[14]

The paper "New approaches for round-reduced PRINCE cipher cryptanalysis"^[15] presents boomerang attack andknown-plaintext attack on reduced round versions up to 6 rounds.

In 2015 few additional attacks have been published but are not freely available.^[16][17]

• http://eprint.iacr.org/2012/529.pdf original paper: "PRINCE – A Low-latency Block Cipher for Pervasive Computing Applications"
• https://www.emsec.rub.de/research/research_startseite/prince-challenge The Prince challenge home page
• https://github.com/sebastien-riou/prince-c-ref Software Implementations inC
• https://github.com/weedegee/prince Software Implementations inPython
• https://github.com/huljar/prince-vhdl Hardware Implementation inVHDL

• Block ciphers
• Cryptography

• CS1 errors: missing periodical
• Articles with short description
• Short description is different from Wikidata
• Articles needing additional references from May 2024
• All articles needing additional references