Who Cited It

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.

Factoring polynomials with rational coefficients (1982)Factoring polynomials with ra…Fully homomorphic encryption using ideal lattices (2009)Fully homomorphic encryption …Mersenne twister (1998)Mersenne twisterOn lattices, learning with errors, random linear codes, and cryptography (2005)On lattices, learning with er…On lattices, learning with errors, random linear codes, and cryptography (2009)On lattices, learning with er…NTRU: A ring-based public key cryptosystem (1998)NTRU: A ring-based public key…Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Fa… (2013)Homomorphic Encryption from L…Efficient Fully Homomorphic Encryption from (Standard) LWE (2011)Efficient Fully Homomorphic E…Closest point search in lattices (2002)Closest point search in latti…Lattice basis reduction: Improved practical algorithms and solving subset sum problems (1994)Lattice basis reduction: Impr…Generating hard instances of lattice problems (extended abstract) (1996)Generating hard instances of …
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

What cites it, inside the corpus

PaperYearCited
Fully homomorphic encryption using ideal lattices20096,701
Mersenne twister19985,779
On lattices, learning with errors, random linear codes, and cryptography20052,289
On lattices, learning with errors, random linear codes, and cryptography20092,288
NTRU: A ring-based public key cryptosystem19981,894
Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Fa…20131,493
Efficient Fully Homomorphic Encryption from (Standard) LWE20111,472
Closest point search in lattices20021,450
Lattice basis reduction: Improved practical algorithms and solving subset sum problems19941,429
Generating hard instances of lattice problems (extended abstract)19961,378

Links

DOI · Open access copy · OpenAlex record

Topics

Coding theory and cryptographyComputer Science
Analytic Number Theory ResearchMathematics
graph theory and CDMA systemsEngineering

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…