NTRUEncrypt

Short description: Lattice-based public key cryptosystem

The NTRUEncrypt public key cryptosystem, also known as the NTRU encryption algorithm, is an NTRU lattice-based alternative to RSA and elliptic curve cryptography (ECC) and is based on the shortest vector problem in a lattice (which is not known to be breakable using quantum computers).

It relies on the presumed difficulty of factoring certain polynomials in a truncated polynomial ring into a quotient of two polynomials having very small coefficients. Breaking the cryptosystem is strongly related, though not equivalent, to the algorithmic problem of lattice reduction in certain lattices. Careful choice of parameters is necessary to thwart some published attacks.

Since both encryption and decryption use only simple polynomial multiplication, these operations are very fast compared to other asymmetric encryption schemes, such as RSA, ElGamal and elliptic curve cryptography. However, NTRUEncrypt has not yet undergone a comparable amount of cryptographic analysis in deployed form.

A related algorithm is the NTRUSign digital signature algorithm.

Specifically, NTRU operations are based on objects in a truncated polynomial ring [math]\displaystyle{ \ R=\mathbb{Z}[X]/(X^N-1) }[/math] with convolution multiplication and all polynomials in the ring have integer coefficients and degree at most N-1:

[math]\displaystyle{ \textbf{a} = a_0 + a_1 X + a_2 X^2 + \cdots + a_{N-2} X^{N-2} + a_{N-1} X^{N-1} }[/math]

That [math]\displaystyle{ X^N = 1 }[/math] in this ring has the effect that multiplying a polynomial by [math]\displaystyle{ X }[/math] rotates the coefficients of the polynomial. A map of the form [math]\displaystyle{ f \mapsto fg }[/math] for a fixed [math]\displaystyle{ g \in R }[/math] thus produces a new polynomial [math]\displaystyle{ fg }[/math] where every coefficient depends on as many coefficients from [math]\displaystyle{ f }[/math] as there are nonzero coefficients in [math]\displaystyle{ g }[/math].

NTRU has three integer parameters (N, p, q), where N is the polynomial degree bound, p is called the small modulus, and q is called the large modulus; it is assumed that N is prime, q is always (much) larger than p, and p and q are coprime. Plaintext messages are polynomials modulo p but ciphertext messages are polynomials modulo q. Concretely the ciphertext consists of the plaintext message plus a randomly chosen multiple of the public key, but the public key may itself be regarded as a multiple of the small modulus p, which allows the holder of the private key to extract the plaintext from the ciphertext.

History

The NTRUEncrypt Public Key Cryptosystem is a relatively new cryptosystem. The first version of the system, which was simply called NTRU, was developed around 1996 by three mathematicians (Jeffrey Hoffstein, Jill Pipher, and Joseph H. Silverman). In 1996 these mathematicians together with Daniel Lieman founded the NTRU Cryptosystems, Inc. and were given a patent (now expired) on the cryptosystem.

During the last ten years people have been working on improving the cryptosystem. Since the first presentation of the cryptosystem, some changes were made to improve both the performance of the system and its security. Most performance improvements were focused on speeding up the process. Up till 2005 literature can be found that describes the decryption failures of the NTRUEncrypt. As for security, since the first version of the NTRUEncrypt, new parameters have been introduced that seem secure for all currently known attacks and reasonable increase in computation power.

Now the system is fully accepted to IEEE P1363 standards under the specifications for lattice-based public-key cryptography (IEEE P1363.1). Because of the speed of the NTRUEncrypt Public Key Cryptosystem (see http://bench.cr.yp.to for benchmarking results) and its low memory use (see below), it can be used in applications such as mobile devices and Smart-cards. In April 2011, NTRUEncrypt was accepted as a X9.98 Standard, for use in the financial services industry.

Public key generation

Sending a secret message from Alice to Bob requires the generation of a public and a private key. The public key is known by both Alice and Bob and the private key is only known by Bob. To generate the key pair two polynomials f and g, with degree at most [math]\displaystyle{ \ N-1 }[/math] and with coefficients in {-1,0,1} are required. They can be considered as representations of the residue classes of polynomials modulo [math]\displaystyle{ \ X^N-1 }[/math] in R. The polynomial [math]\displaystyle{ \textbf{f} \in L_f }[/math] must satisfy the additional requirement that the inverses modulo q and modulo p (computed using the Euclidean algorithm) exist, which means that [math]\displaystyle{ \ \textbf{f} \cdot \textbf{f}_p = 1 \pmod p }[/math] and [math]\displaystyle{ \ \textbf{f} \cdot \textbf{f}_q = 1 \pmod q }[/math] must hold. So when the chosen f is not invertible, Bob has to go back and try another f.

Both f and [math]\displaystyle{ \ \mathbf{f}_p }[/math] (and [math]\displaystyle{ g }[/math]) are Bob's private key. The public key h is generated computing the quantity

[math]\displaystyle{ \textbf{h} = p\textbf{f}_q \cdot \textbf{g} \pmod q. }[/math]

Example: In this example the parameters (N, p, q) will have the values N = 11, p = 3 and q = 32 and therefore the polynomials f and g are of degree at most 10. The system parameters (N, p, q) are known to everybody. The polynomials are randomly chosen, so suppose they are represented by

[math]\displaystyle{ \textbf{f} = -1 + X + X^2 - X^4 + X^6 +X^9 - X^{10} }[/math]

[math]\displaystyle{ \textbf{g} = -1 + X^2 +X^3 + X^5 -X^8 - X^{10} }[/math]

Using the Euclidean algorithm the inverse of f modulo p and modulo q, respectively, is computed

[math]\displaystyle{ \textbf{f}_p = 1 + 2X + 2X^3 +2X^4 + X^5 +2X^7 + X^8+2X^9 \pmod 3 }[/math]

[math]\displaystyle{ \textbf{f}_q = 5 + 9X +6X^2+16X^3 + 4X^4 +15X^5 +16X^6+22X^7+20X^8+18X^9+30X^{10} \pmod {32} }[/math]

Which creates the public key h (known to both Alice and Bob) computing the product

[math]\displaystyle{ \textbf{h} = p\textbf{f}_q \cdot \textbf{g} \pmod {32} = 8 - 7X - 10X^2 - 12X^3 + 12X^4 - 8X^5 + 15X^6 - 13X^7 + 12X^8 - 13X^9 + 16X^{10} \pmod {32} }[/math]

Encryption

Alice, who wants to send a secret message to Bob, puts her message in the form of a polynomial m with coefficients in [math]\displaystyle{ [-p/2, p/2] }[/math] . In modern applications of the encryption, the message polynomial can be translated in a binary or ternary representation. After creating the message polynomial, Alice chooses randomly a polynomial r with small coefficients (not restricted to the set {-1,0,1}), that is meant to obscure the message.

With Bob's public key h the encrypted message e is computed:

[math]\displaystyle{ \textbf{e} = \textbf{r} \cdot \textbf{h} + \textbf{m} \pmod q }[/math]

This ciphertext hides Alice's messages and can be sent safely to Bob.

Example: Assume that Alice wants to send a message that can be written as polynomial

[math]\displaystyle{ \textbf{m} = -1 + X^3 - X^4-X^8+X^9+X^{10} }[/math]

and that the randomly chosen ‘blinding value’ can be expressed as

[math]\displaystyle{ \textbf{r} = -1+X^2+X^3+X^4-X^5-X^7 }[/math]

The ciphertext e that represents her encrypted message to Bob will look like

[math]\displaystyle{ \textbf{e} = \textbf{r} \cdot \textbf{h} + \textbf{m} \pmod {32} = 14 + 11X+26X^2+24X^3+14X^4+16X^5+30X^6+7X^7+25X^8+6X^9+19X^{10} \pmod {32} }[/math]

Decryption

Anybody knowing r could compute the message m by evaluating e - rh; so r must not be revealed by Alice. In addition to the publicly available information, Bob knows his own private key. Here is how he can obtain m: First he multiplies the encrypted message e and part of his private key f

[math]\displaystyle{ \textbf{a} = \textbf{f} \cdot \textbf{e} \pmod q }[/math]

By rewriting the polynomials, this equation is actually representing the following computation:

[math]\displaystyle{ \textbf{a} = \textbf{f} \cdot \textbf{e} \pmod q }[/math]

[math]\displaystyle{ \textbf{a} = \textbf{f} \cdot (\textbf{r} \cdot \textbf{h}+\textbf{m}) \pmod q }[/math]

[math]\displaystyle{ \textbf{a} = \textbf{f} \cdot (\textbf{r} \cdot p\textbf{f}_q \cdot \textbf{g} + \textbf{m}) \pmod q }[/math]

[math]\displaystyle{ \textbf{a} = p\textbf{r} \cdot \textbf{g} + \textbf{f} \cdot \textbf{m} \pmod q }[/math]

Instead of choosing the coefficients of a between 0 and q – 1 they are chosen in the interval [-q/2, q/2] to prevent that the original message may not be properly recovered since Alice chooses the coordinates of her message m in the interval [-p/2, p/2]. This implies that all coefficients of [math]\displaystyle{ \ p\textbf{r} \cdot \textbf{g} + \textbf{f} \cdot \textbf{m} }[/math] already lie within the interval [-q/2, q/2] because the polynomials r, g, f and m and prime p all have coefficients that are small compared to q. This means that all coefficients are left unchanged during reducing modulo q and that the original message may be recovered properly.

The next step will be to calculate a modulo p:

[math]\displaystyle{ \textbf{b} = \textbf{a} \pmod p = \textbf{f} \cdot \textbf{m} \pmod p }[/math]

because [math]\displaystyle{ \ p\textbf{r} \cdot \textbf{g} \pmod p =0 }[/math].

Knowing b Bob can use the other part of his private key [math]\displaystyle{ \ \left(\textbf{f}_p \right) }[/math] to recover Alice's message by multiplication of b and [math]\displaystyle{ \ \textbf{f}_p }[/math]

[math]\displaystyle{ \textbf{c} = \textbf{f}_p \cdot \textbf{b} = \textbf{f}_p \cdot \textbf{f} \cdot \textbf{m} \pmod p }[/math]

[math]\displaystyle{ \textbf{c} = \textbf{m} \pmod p }[/math]

because the property [math]\displaystyle{ \ \textbf{f} \cdot \textbf{f}_p =1 \pmod p }[/math] was required for [math]\displaystyle{ \ \textbf{f}_p }[/math].

Example: The encrypted message e from Alice to Bob is multiplied with polynomial f

[math]\displaystyle{ \textbf{a} = \textbf{f} \cdot \textbf{e} \pmod {32} = 3 -7X-10X^2-11X^3+10X^4+7X^5+6X^6+7X^7+5X^8-3X^9-7X^{10} \pmod {32}, }[/math]

where Bob uses the interval [-q/2, q/2] instead of the interval [0, q – 1] for the coefficients of polynomial a to prevent that the original message may not be recovered correctly.

Reducing the coefficients of a mod p results in

[math]\displaystyle{ \textbf{b} = \textbf{a} \pmod 3 = -X-X^2+X^3+X^4+X^5+X^7-X^8-X^{10} \pmod 3 }[/math]

which equals [math]\displaystyle{ \ \textbf{b} = \textbf{f} \cdot \textbf{m}\pmod 3 }[/math].

In the last step the result is multiplied with [math]\displaystyle{ \ \textbf{f}_p }[/math] from Bob's private key to end up with the original message m

[math]\displaystyle{ \textbf{c} = \textbf{f}_p \cdot \textbf{b} = \textbf{f}_p \cdot \textbf{f} \cdot \textbf{m} \pmod 3 = \textbf{m} \pmod 3 }[/math]

[math]\displaystyle{ \textbf{c} = -1+X^3-X^4-X^8+X^9+X^{10} }[/math]

Which indeed is the original message Alice has sent to Bob!

Attacks

Since the proposal of NTRU several attacks on the NTRUEncrypt public key cryptosystem have been introduced. Most attacks are focused on making a total break by finding the secret key f instead of just recovering the message m. If f is known to have very few non-zero coefficients Eve can successfully mount a brute force attack by trying all values for f. When Eve wants to know whether f´ is the secret key, she simply calculates [math]\displaystyle{ \ \textbf{f}' \cdot \textbf{h} \pmod q }[/math]. If it has small coefficients it might be the secret key f, and Eve can test if f´ is the secret key by using it to decrypt a message she encrypted herself. Eve could also try values of g and test if [math]\displaystyle{ \ \textbf{g}' \cdot \textbf{h}^{-1} \pmod q }[/math]has small values.

It is possible to mount a meet-in-the-middle attack which is more powerful. It can cut the search time by square root. The attack is based on the property that [math]\displaystyle{ \ \textbf{f} \cdot \textbf{h} = p\textbf{g} \pmod q }[/math].

Eve wants to find [math]\displaystyle{ \ \textbf{f}_1 }[/math] and [math]\displaystyle{ \ \textbf{f}_2 }[/math] such that [math]\displaystyle{ \ \textbf{f} = \textbf{f}_1 + \textbf{f}_2 }[/math] holds and such that they have the property

[math]\displaystyle{ \left( \textbf{f}_1+\textbf{f}_2 \right) \cdot \textbf{h} = \textbf{g} \pmod q }[/math]

[math]\displaystyle{ \textbf{f}_1 \cdot \textbf{h} = \textbf{g} -\textbf{f}_2 \cdot \textbf{h} \pmod q }[/math]

If f has d one's and N-d zero's, then Eve creates all possible [math]\displaystyle{ \ \textbf{f}_1 }[/math] and [math]\displaystyle{ \ \textbf{f}_2 }[/math] in which they both have length [math]\displaystyle{ \ \frac{1}{2} N }[/math] (e.g. [math]\displaystyle{ \ \textbf{f}_1 }[/math] covers the [math]\displaystyle{ \ \frac{1}{2} N }[/math] lowest coefficients of f and [math]\displaystyle{ \ \textbf{f}_2 }[/math] the highest) with d/2 one's. Then she computes [math]\displaystyle{ \textbf{f}_1 \cdot \textbf{h} \pmod q }[/math] for all [math]\displaystyle{ \ \textbf{f}_1 }[/math] and orders them in bins based on the first k coordinates. After that she computes all [math]\displaystyle{ \ -\textbf{f}_2 \cdot \textbf{h} \pmod q }[/math] and orders them in bins not only based on the first k coordinates, but also based on what happens if you add 1 to the first k coordinates. Then you check the bins that contain both [math]\displaystyle{ \ \textbf{f}_1 }[/math] and [math]\displaystyle{ \ \textbf{f}_2 }[/math] and see if the property [math]\displaystyle{ \ \textbf{f}_1 \cdot \textbf{h} = \textbf{g} -\textbf{f}_2 \cdot \textbf{h} \pmod q }[/math] holds.

The lattice reduction attack is one of the best known and one of the most practical methods to break the NTRUEncrypt. In a way it can be compared to the factorization of the modulus in RSA. The most used algorithm for the lattice reduction attack is the Lenstra-Lenstra-Lovász algorithm. Because the public key h contains both f and g one can try to obtain them from h. It is however too hard to find the secret key when the NTRUEncrypt parameters are chosen secure enough. The lattice reduction attack becomes harder if the dimension of the lattice gets bigger and the shortest vector gets longer.

The chosen ciphertext attack is also a method which recovers the secret key f and thereby results in a total break. In this attack Eve tries to obtain her own message from the ciphertext and thereby tries to obtain the secret key. In this attack Eve doesn't have any interaction with Bob.

How it works:

First Eve creates a cipher text [math]\displaystyle{ \ \textbf{e} = c\textbf{h} + c }[/math] such that [math]\displaystyle{ \ c = 0 \pmod p, c \lt \frac{q}{2} }[/math] and [math]\displaystyle{ \ 2c \gt \frac{q}{2} }[/math] When Eve writes down the steps to decipher e (without actually calculating the values since she does not know f) she finds [math]\displaystyle{ \ \textbf{a} = \textbf{f} \cdot \textbf{e} \pmod q }[/math]:

[math]\displaystyle{ \textbf{a} = \textbf{f} \left(c\textbf{h} + c\right) \pmod q }[/math]

[math]\displaystyle{ \textbf{a} = c\textbf{g} +c\textbf{f} \pmod q }[/math]

[math]\displaystyle{ \textbf{a} = c\textbf{g} + c\textbf{f} -qK }[/math]

In which [math]\displaystyle{ \ K = \sum k_i x^i }[/math] such that

[math]\displaystyle{ k_i=\begin{cases} 1 \ \ \qquad \text{if the} \ i^{th} \ \text{coefficient of} \ \textbf{f} \ \text{and} \ \textbf{g} \ \text{is} \ 1 \\ -1 \qquad \text{if the} \ i^{th} \ \text{coefficient of} \ \textbf{f} \ \text{and} \ \textbf{g} \ \text{is} \ -1\\ 0 \ \ \qquad \text{Otherwise}\end{cases} }[/math]

Example:

[math]\displaystyle{ \textbf{f} = -1+X+X^2-X^4+X^6+X^9-X^{10} }[/math]

[math]\displaystyle{ \textbf{g} = -1 +X^2+X^3+X^5-X^8-X^{10} }[/math]

Then K becomes [math]\displaystyle{ \ K = -1+X^2-X^{10} }[/math].

Reducing the coefficients of polynomials a mod p really reduces the coefficients of [math]\displaystyle{ \ c\textbf{g}+c\textbf{f}-qK \pmod p }[/math]. After multiplication with [math]\displaystyle{ \ \textbf{f}_p }[/math], Eve finds:

[math]\displaystyle{ \textbf{m} = c\textbf{f}_p \cdot \textbf{g}+c\textbf{f}_p \cdot \textbf{f}-q\textbf{f}_p \cdot K \pmod p }[/math]

[math]\displaystyle{ \textbf{m} = c\textbf{h}+c -q\textbf{f}_p \cdot K \pmod p }[/math]

Because c was chosen to be a multiple of p, m can be written as

[math]\displaystyle{ \textbf{m} = -q\textbf{f}_p \cdot K \pmod p }[/math]

Which means that [math]\displaystyle{ \ \textbf{f} = -qK \cdot \textbf{m}^{-1} \pmod p }[/math].

Now if f and g have few coefficients which are the same at the same factors, K has few non zero coefficients and is thereby small. By trying different values of K the attacker can recover f.

By encrypting and decrypting a message according to the NTRUEncrypt the attacker can check whether the function f is the correct secret key or not.

Security and performance improvements

Using the latest suggested parameters (see below) the NTRUEncrypt public key cryptosystem is secure to most attacks. There continues however to be a struggle between performance and security. It is hard to improve the security without slowing down the speed, and vice versa.

One way to speed up the process without damaging the effectiveness of the algorithm, is to make some changes in the secret key f. First, construct f such that [math]\displaystyle{ \ \textbf{f} = 1+p\textbf{F} }[/math], in which F is a small polynomial (i.e. coefficients {-1,0, 1}). By constructing f this way, f is invertible mod p. In fact [math]\displaystyle{ \ \textbf{f}^{-1} = 1\pmod p }[/math], which means that Bob does not have to actually calculate the inverse and that Bob does not have to conduct the second step of decryption. Therefore, constructing f this way saves a lot of time but it does not affect the security of the NTRUEncrypt because it is only easier to find [math]\displaystyle{ \ \textbf{f}_p }[/math] but f is still hard to recover. In this case f has coefficients different from -1, 0 or 1, because of the multiplication by p. But because Bob multiplies by p to generate the public key h, and later on reduces the ciphertext modulo p, this will not have an effect on the encryption method.

Second, f can be written as the product of multiple polynomials, such that the polynomials have many zero coefficients. This way fewer calculations have to be conducted.

According to the 2020 NTRU NIST submission the following parameters are considered secure:

Table 1: Parameters

	N	q	p
128 bit security margin (NTRU-HPS)	509	2048	3
192 bit security margin (NTRU-HPS)	677	2048	3
256 bit security margin (NTRU-HPS)	821	4096	3
256 bit security margin (NTRU-HRSS)	701	8192	3

References

• Jaulmes, E. and Joux, A. A Chosen-Ciphertext Attack against NTRU. Lecture Notes in Computer Science; Vol 1880. Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptography. pp. 20–35, 2000.
• Jeffrey Hoffstein, Jill Pipher, Joseph H. Silverman. NTRU: A Ring Based Public Key Cryptosystem. In Algorithmic Number Theory (ANTS III), Portland, OR, June 1998, J.P. Buhler (ed.), Lecture Notes in Computer Science 1423, Springer-Verlag, Berlin, 1998, 267–288.
• Howgrave-Graham, N., Silverman, J.H. & Whyte, W., Meet-In-The-Middle Attack on a NTRU Private Key.
• J. Hoffstein, J. Silverman. Optimizations for NTRU. Public-Key Cryptography and Computational Number Theory (Warsaw, September 11–15, 2000), DeGruyter, to appear.
• A. C. Atici, L. Batina, J. Fan & I. Verbauwhede. Low-cost implementations of NTRU for pervasive security.

External links

• NTRU technical website
• The IEEE P1363 Home Page
• Security Innovation (acquired NTRU Cryptosystems, Inc.)
• Open Source BSD license implementation of NTRUEncrypt
• Open Source GPL v2 license of NTRUEncrypt
• strongSwan Open Source IPsec solution using NTRUEncrypt-based key exchange
• - Embedded SSL/TLS Library offering cipher suites utilizing NTRU (wolfSSL)