Construct · 1 fields · 1 citations

ring learning with errors: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
ring learningwith errors1 CONSTRUCTRing learning withLYUBASHEVSKY · CRYPTOGRAPHY

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Cryptography

a version of the learning with errors problem over polynomial rings that keeps worst-case hardness ties to ideal lattices while allowing more efficient schemes.

In cryptography, ring learning with errors refers to a version of the learning with errors problem over polynomial rings that keeps worst-case hardness ties to ideal lattices while allowing more efficient schemes. This meaning comes from Lyubashevsky (2010) in Lecture Notes in Computer Science.[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how ring learning with errors sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

BGV scheme1 fields · 1 citationsanchor · a standalone constructhardness4 fields · 4 citationsjingle · one word, four constructsideal2 fields · 2 citationsjingle · one word, two constructs

References

  1. Lyubashevsky, V., Peikert, C., & Regev, O. (2010). On Ideal Lattices and Learning with Errors over Rings. In Lecture Notes in Computer Science (pp. 1-23). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-13190-5_1

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct