Generating hard instances of lattice problems (extended abstract)

1996 · 1,378 citations · 6 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.

7 of 7 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 this paper cites, inside the corpus

Paper	Year	Cited
Factoring polynomials with rational coefficients	1982	4,041

What cites it, inside the corpus

Paper	Year	Cited
Fully homomorphic encryption using ideal lattices	2009	6,701
On lattices, learning with errors, random linear codes, and cryptography	2009	2,288
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
Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Fa…	2013	1,493

Links

DOI · Open access copy · OpenAlex record

Topics

Cryptography and Data Security	Computer Science
Complexity and Algorithms in Graphs	Computer Science
semigroups and automata theory	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.
supports9 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:59+00:00.

sha256 59007f057c7dae86…