Metraipolis › archive › dc_682a4aabd239
NTRUEncrypt — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/NTRUEncrypt
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-06T00:11:20.310Z
- SHA-256 of the archived text
bfda47620737f9e43c2392385d058384c708406cadae04a8a90724bd7eaf665b- Stable URL of this page
https://metraipolis.com/documento/dc_682a4aabd239
How to cite
NTRUEncrypt — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/NTRUEncrypt (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_682a4aabd239 (Metraipolis archive dc_682a4aabd239, sha256 bfda47620737f9e43c2392385d058384c708406cadae04a8a90724bd7eaf665b)
BibTeX
@misc{dc682a4aabd239,
title = {NTRUEncrypt — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/NTRUEncrypt},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_682a4aabd239; sha256 bfda47620737f9e43c2392385d058384c708406cadae04a8a90724bd7eaf665b},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/NTRUEncrypt. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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 R = Z [ X ] / ( X N − 1 ) {\displaystyle \ R=\mathbb {Z} [X]/(X^{N}-1)} with convolution multiplication and all polynomials in the ring have integer coefficients and degree at most N-1: a = a 0 + a 1 X + a 2 X 2 + ⋯ + a N − 2 X N − 2 + a N − 1 X N − 1 {\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}} That X N = 1 {\displaystyle X^{N}=1} in this ring has the effect that multiplying a polynomial by X {\displaystyle X} rotates the coefficients of the polynomial. A map of the form f ↦ f g {\displaystyle f\mapsto fg} for a fixed g ∈ R {\displaystyle g\in R} thus produces a new polynomial f g {\displaystyle fg} where every coefficient depends on as many coefficients from f {\displaystyle f} as there are nonzero coefficients in g {\displaystyle g} . 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.
Tema degli esploratori: fiducia digitale e crittografia (deposito sistematico; ricerca «EdDSA»).
Fonte: Wikipedia in inglese, voce «NTRUEncrypt» — https://en.wikipedia.org/wiki/NTRUEncrypt
Wikidata Q1859242: «lattice-based public key cryptosystem» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q1859242
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/NTRUEncrypt?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1348222702, consultata il 2026-10-05T23:30:56.557Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: fec34ad07db5dda0e839fa56479ac797d4f47c232d7bbc53fff65512d32b1b61