On lattices, learning with errors, random linear codes, and cryptography

Oded Regev

doi:https://doi.org/10.1145/1568318.1568324

On lattices, learning with errors, random linear codes, and cryptography

2009 · Journal of the ACM · 2,288 citations · 3 from inside this corpus

The source holds an abstract for this work, but its best open-access copy is under no open licence, which does not permit us to republish the text. Read it at the source below.

6 of 6 neighbouring works in this corpus. Blue is what this paper cites; orange is what cites it, and a dashed line is one neighbour citing another. Only the largest labels are drawn — every node carries its full title on hover.

this paper works it cites works citing it node size = global citations · hover for the full title

Citation edge evidence

Each row is directed from the citing work to the cited work. Source status remains readable without the interactive graph.

Advances in quantum cryptography→On lattices, learning with errors, random linear codes, and cryptographyLegacy edge — source detail unavailable
On Ideal Lattices and Learning with Errors over Rings→On lattices, learning with errors, random linear codes, and cryptographyLegacy edge — source detail unavailable
[No title in the source record — White Rose Research Online (University of Leeds, The Uni…→On lattices, learning with errors, random linear codes, and cryptographyLegacy edge — source detail unavailable
On lattices, learning with errors, random linear codes, and cryptography→Factoring polynomials with rational coefficientsLegacy edge — source detail unavailable
On lattices, learning with errors, random linear codes, and cryptography→On lattices, learning with errors, random linear codes, and cryptographyLegacy edge — source detail unavailable
On lattices, learning with errors, random linear codes, and cryptography→Generating hard instances of lattice problems (extended abstract)Legacy edge — source detail unavailable
On lattices, learning with errors, random linear codes, and cryptography→Factoring polynomials with rational coefficientsLegacy edge — source detail unavailable
On Ideal Lattices and Learning with Errors over Rings→Generating hard instances of lattice problems (extended abstract)Legacy edge — source detail unavailable
Generating hard instances of lattice problems (extended abstract)→Factoring polynomials with rational coefficientsLegacy edge — source detail unavailable
Advances in quantum cryptography→Generating hard instances of lattice problems (extended abstract)Legacy edge — source detail unavailable
[No title in the source record — White Rose Research Online (University of Leeds, The Uni…→Generating hard instances of lattice problems (extended abstract)Legacy edge — source detail unavailable

What this paper cites, inside the corpus

Paper	Year	Cited
Factoring polynomials with rational coefficients	1982	4,041
On lattices, learning with errors, random linear codes, and cryptography	2005	2,289
Generating hard instances of lattice problems (extended abstract)	1996	1,378

What cites it, inside the corpus

Paper	Year	Cited
Advances in quantum cryptography	2020	1,890
On Ideal Lattices and Learning with Errors over Rings	2010	1,814
[No title in the source record — White Rose Research Online (University of Leeds, The Uni…	2019	1,584

Links

Download BibTeX · Download RIS · DOI · OpenAlex record

Topics

Cryptography and Data Security	Computer Science
Complexity and Algorithms in Graphs	Computer Science
Coding theory and cryptography	Computer Science

Is this record sound?

complete

Nothing in this record contradicts itself and no field we check is missing.

supports1 author record(s) attached.
supports40 reference(s) recorded.
neutralThe DOI carries no year to check against.
supportsA title is present.

Provenance

Everything above was read from one stored OpenAlex payload, fetched 2026-09-04T03:58:50+00:00.

sha256 86a6d6715ff540a0…