Generating hard instances of lattice problems (extended abstract)
Miklós Ajtai low
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.
this paper
works it cites
works citing it
node size = global citations · hover for the full title
Citation edge evidence
- Fully homomorphic encryption using ideal lattices→Generating hard instances of lattice problems (extended abstract)Legacy 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
- Advances in quantum cryptography→Generating hard instances of lattice problems (extended abstract)Legacy 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
- [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
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Fa…→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
- On lattices, learning with errors, random linear codes, and cryptography→Factoring polynomials with rational coefficientsLegacy edge — source detail unavailable
- Fully homomorphic encryption using ideal lattices→Factoring polynomials with rational coefficientsLegacy 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
- On Ideal Lattices and Learning with Errors over Rings→Fully homomorphic encryption using ideal latticesLegacy edge — source detail unavailable
- Advances in quantum cryptography→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
- 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 Ideal Lattices and Learning with Errors over RingsLegacy edge — source detail unavailable
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Fa…→Factoring polynomials with rational coefficientsLegacy edge — source detail unavailable
What this paper cites, inside the corpus
| Paper | Year | Cited |
|---|---|---|
| Factoring polynomials with rational coefficients | 1982 | 4,041 |
What cites it, inside the corpus
Links
Download BibTeX · Download RIS · 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
sha256 59007f057c7dae86…