✳flâneur — a map of the web's best reading

Ring learning with errors - Wikipedia

en.wikipedia.org · 3,402 words · saved by 1 readers

In post-quantum cryptography, ring learning with errors (RLWE) is a computational problem which serves as the foundation of new cryptographic algorithms, such as NewHope, designed to protect against cryptanalysis by quantum computers and also to provide the basis for homomorphic encryption. Public-key cryptography relies on construction of mathematical problems that are believed to be hard to solve if no further information is available, but are easy to solve if some information used in the problem construction is known. Some problems of this sort that are currently used in cryptography are at risk of attack if sufficiently large quantum computers can ever be built, so resistant problems are sought. Homomorphic encryption is a form of encryption that allows computation on ciphertext, such as arithmetic on numeric values stored in an encrypted database. RLWE is more properly called learning with errors over rings and is simply the larger learning with errors (LWE) problem specialized to

Ring learning with errors - Wikipedia Jump to content From Wikipedia, the free encyclopedia Computational problem possibly useful for post-quantum cryptography In post-quantum cryptography , ring learning with errors ( RLWE ) is a computational problem which serves as the foundation of new cryptographic algorithms , such as NewHope , designed to protect against cryptanalysis by quantum computers and also to provide the basis for homomorphic encryption . Public-key cryptography relies on construction of mathematical problems that are believed to be hard to solve if no further information is ava

Explore this link on the map →

related reading