NTRU: A ring-based public key cryptosystem
Jeffrey Hoffstein, Jill Pipher, Joseph H. Silverman
No abstract in the source record.
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→NTRU: A ring-based public key cryptosystemLegacy edge — source detail unavailable
- On Ideal Lattices and Learning with Errors over Rings→NTRU: A ring-based public key cryptosystemLegacy edge — source detail unavailable
- Efficient Fully Homomorphic Encryption from (Standard) LWE→NTRU: A ring-based public key cryptosystemLegacy edge — source detail unavailable
- NTRU: A ring-based public key cryptosystem→A method for obtaining digital signatures and public-key cryptosystemsLegacy edge — source detail unavailable
- NTRU: A ring-based public key cryptosystem→A method for obtaining digital signatures and public-key cryptosystemsLegacy edge — source detail unavailable
- NTRU: A ring-based public key cryptosystem→Factoring polynomials with rational coefficientsLegacy edge — source detail unavailable
- NTRU: A ring-based public key cryptosystem→A Public-Key Cryptosystem Based On Algebraic Coding TheoryLegacy 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→Fully homomorphic encryption using ideal latticesLegacy edge — source detail unavailable
- Efficient Fully Homomorphic Encryption from (Standard) LWE→On Ideal Lattices and Learning with Errors over RingsLegacy edge — source detail unavailable
- Efficient Fully Homomorphic Encryption from (Standard) LWE→Factoring polynomials with rational coefficientsLegacy edge — source detail unavailable
- Fully homomorphic encryption using ideal lattices→A method for obtaining digital signatures and public-key cryptosystemsLegacy edge — source detail unavailable
- Fully homomorphic encryption using ideal lattices→Factoring polynomials with rational coefficientsLegacy edge — source detail unavailable
- Fully homomorphic encryption using ideal lattices→A method for obtaining digital signatures and public-key cryptosystemsLegacy edge — source detail unavailable
- On Ideal Lattices and Learning with Errors over Rings→Fully homomorphic encryption using ideal latticesLegacy edge — source detail unavailable
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems→Factoring polynomials with rational coefficientsLegacy edge — source detail unavailable
What this paper cites, inside the corpus
What cites it, inside the corpus
| Paper | Year | Cited |
|---|---|---|
| Fully homomorphic encryption using ideal lattices | 2009 | 6,701 |
| On Ideal Lattices and Learning with Errors over Rings | 2010 | 1,814 |
| Efficient Fully Homomorphic Encryption from (Standard) LWE | 2011 | 1,472 |
Links
Topics
| Cryptography and Data Security | Computer Science |
| Cryptographic Implementations and Security | 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.
- supports3 author record(s) attached.
- supports13 reference(s) recorded.
- neutralThe DOI carries no year to check against.
- supportsA title is present.
Provenance
sha256 930f5bc64fea8a60…