Lattice problem
In computer science, lattice problems are a class of optimization problems related to mathematical objects called lattices. The conjectured intractability of such problems is central to the construction of secure lattice-based cryptosystems: Lattice problems are an example of NP-hard problems which have been shown to be average-case hard, providing a test case for the security of cryptographic algorithms. In addition, some lattice problems which are worst-case hard can be used as a basis for extremely secure cryptographic schemes. The use of worst-case hardness in such schemes makes them among the very few schemes that are very likely secure even against quantum computers. For applications in such cryptosystems, lattices over vector space (often ) or free modules (often ) are generally con
CVPClosest vector problemComputational hardness assumptionDual latticeGGH encryption schemeGGH signature schemeGapsvpHans Frederick BlichfeldtHidden subgroup problemIdeal latticeLAMBDA methodLattice-based cryptographyLattice (group)Lattice problemsLearning with errorsLenstra–Lenstra–Lovász lattice basis reduction algorithmList of unsolved problems in computer scienceMiklós AjtaiMinkowski's theoremNP-intermediateNTRUEncryptNTRUSignPCP theoremPost-quantum cryptographyQuantum algorithmRing learning with errorsRing learning with errors key exchangeRing learning with errors signatureSVPSeptentrioShort integer solution problemShortest vector problem
Link from a Wikipage to another Wikipage
primaryTopic
Lattice problem
In computer science, lattice problems are a class of optimization problems related to mathematical objects called lattices. The conjectured intractability of such problems is central to the construction of secure lattice-based cryptosystems: Lattice problems are an example of NP-hard problems which have been shown to be average-case hard, providing a test case for the security of cryptographic algorithms. In addition, some lattice problems which are worst-case hard can be used as a basis for extremely secure cryptographic schemes. The use of worst-case hardness in such schemes makes them among the very few schemes that are very likely secure even against quantum computers. For applications in such cryptosystems, lattices over vector space (often ) or free modules (often ) are generally con
has abstract
En informatique, problèmes de ...... e
* Portail de la cryptologie
@fr
In computer science, lattice p ...... tor in the lattice L, that is,
@en
Зада́чі тео́рії ґра́ток — це к ...... го вектора в ґратці L, тобто :
@uk
Задачи теории решёток — это кл ...... о вектора в решётке L, то есть
@ru
Link from a Wikipage to an external page
Wikipage page ID
18,661,117
page length (characters) of wiki page
Wikipage revision ID
993,400,086
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
comment
En informatique, problèmes de ...... e
* Portail de la cryptologie
@fr
In computer science, lattice p ...... les (often ) are generally con
@en
Зада́чі тео́рії ґра́ток — це к ...... або вільних модулях (часто ).
@uk
Задачи теории решёток — это кл ...... ли свободных модулях (часто ).
@ru
label
Lattice problem
@en
Problème de réseau
@fr
Задачи теории решёток
@ru
Задачі теорії ґраток
@uk