Metraipolis › archive › dc_ada5ec87600d

Ideal lattice — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Ideal_lattice
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-07T14:23:29.406Z
SHA-256 of the archived text
4695c7227b49cc5b0f4fb53f2c746363d90e8b429d1d8947e72fb056dab3aa51
Stable URL of this page
https://metraipolis.com/documento/dc_ada5ec87600d

How to cite

Ideal lattice — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Ideal_lattice (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_ada5ec87600d (Metraipolis archive dc_ada5ec87600d, sha256 4695c7227b49cc5b0f4fb53f2c746363d90e8b429d1d8947e72fb056dab3aa51)
BibTeX
@misc{dcada5ec87600d,
  title = {Ideal lattice — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Ideal_lattice},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_ada5ec87600d; sha256 4695c7227b49cc5b0f4fb53f2c746363d90e8b429d1d8947e72fb056dab3aa51},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Ideal_lattice. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In discrete mathematics, ideal lattices are a special class of lattices and a generalization of cyclic lattices. Ideal lattices naturally occur in many parts of number theory, but also in other areas. In particular, they have a significant place in cryptography. Micciancio defined a generalization of cyclic lattices as ideal lattices. They can be used in cryptosystems to decrease by a square root the number of parameters necessary to describe a lattice, making them more efficient. Ideal lattices are a new concept, but similar lattice classes have been used for a long time. For example, cyclic lattices, a special case of ideal lattices, are used in NTRUEncrypt and NTRUSign. Ideal lattices also form the basis for quantum computer attack resistant cryptography based on the Ring Learning with Errors. These cryptosystems are provably secure under the assumption that the shortest vector problem (SVP) is hard in these ideal lattices.

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; categoria «Number theory»).
Fonte: Wikipedia in inglese, voce «Ideal lattice» — https://en.wikipedia.org/wiki/Ideal_lattice
Wikidata Q5987986 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q5987986
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Ideal_lattice?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 1301207646, consultata il 2026-10-07T14:06:29.303Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 96c6d49e78c1d091be43ccb852d0c92342d5ae2a78322b572f8f74b76db33eac