Factoring polynomials with rational coefficients

A. K. Lenstra; H. W. Lenstra; László Lovász

doi:https://doi.org/10.1007/bf01457454

Factoring polynomials with rational coefficients

1982 · Mathematische Annalen · 4,041 citations · 10 from inside this corpus

A. K. Lenstra low, H. W. Lenstra low, László Lovász

No abstract in the source record.

10 of 10 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.

Fully homomorphic encryption using ideal lattices→Factoring polynomials with rational coefficientsLegacy edge — source detail unavailable
Mersenne twister→Factoring polynomials with rational coefficientsLegacy 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→Factoring polynomials with rational coefficientsLegacy edge — source detail unavailable
NTRU: A ring-based public key cryptosystem→Factoring polynomials with rational coefficientsLegacy edge — source detail unavailable
Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Fa…→Factoring polynomials with rational coefficientsLegacy edge — source detail unavailable
Efficient Fully Homomorphic Encryption from (Standard) LWE→Factoring polynomials with rational coefficientsLegacy edge — source detail unavailable
Closest point search in lattices→Factoring polynomials with rational coefficientsLegacy edge — source detail unavailable
Lattice basis reduction: Improved practical algorithms and solving subset sum problems→Factoring polynomials with rational coefficientsLegacy edge — source detail unavailable
Generating hard instances of lattice problems (extended abstract)→Factoring polynomials with rational coefficientsLegacy edge — source detail unavailable
NTRU: A ring-based public key cryptosystem→Lattice basis reduction: Improved practical algorithms and solving subset sum problemsLegacy edge — source detail unavailable
Efficient Fully Homomorphic Encryption from (Standard) LWE→NTRU: A ring-based public key cryptosystemLegacy edge — source detail unavailable
Efficient Fully Homomorphic Encryption from (Standard) LWE→Fully homomorphic encryption using ideal latticesLegacy edge — source detail unavailable
Efficient Fully Homomorphic Encryption from (Standard) LWE→On lattices, learning with errors, random linear codes, and cryptographyLegacy 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
Fully homomorphic encryption using ideal lattices→NTRU: A ring-based public key cryptosystemLegacy edge — source detail unavailable
Fully homomorphic encryption using ideal lattices→On lattices, learning with errors, random linear codes, and cryptographyLegacy edge — source detail unavailable
Fully homomorphic encryption using ideal lattices→Generating hard instances of lattice problems (extended abstract)Legacy edge — source detail unavailable
Closest point search in lattices→Lattice basis reduction: Improved practical algorithms and solving subset sum problemsLegacy edge — source detail unavailable
Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Fa…→Efficient Fully Homomorphic Encryption from (Standard) LWELegacy edge — source detail unavailable
Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Fa…→Fully homomorphic encryption using ideal latticesLegacy edge — source detail unavailable
Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Fa…→On lattices, learning with errors, random linear codes, and cryptographyLegacy edge — source detail unavailable
Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Fa…→Generating hard instances of lattice problems (extended abstract)Legacy edge — source detail unavailable

What cites it, inside the corpus

Paper	Year	Cited
Fully homomorphic encryption using ideal lattices	2009	6,701
Mersenne twister	1998	5,779
On lattices, learning with errors, random linear codes, and cryptography	2005	2,289
On lattices, learning with errors, random linear codes, and cryptography	2009	2,288
NTRU: A ring-based public key cryptosystem	1998	1,894
Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Fa…	2013	1,493
Efficient Fully Homomorphic Encryption from (Standard) LWE	2011	1,472
Closest point search in lattices	2002	1,450
Lattice basis reduction: Improved practical algorithms and solving subset sum problems	1994	1,429
Generating hard instances of lattice problems (extended abstract)	1996	1,378

Links

Download BibTeX · Download RIS · DOI · Open access copy · OpenAlex record

Topics

Coding theory and cryptography	Computer Science
Analytic Number Theory Research	Mathematics
graph theory and CDMA systems	Engineering

Is this record sound?

complete

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

supports3 author record(s) attached.
supports19 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:46+00:00.

sha256 bba2969b3567609a…