Name
Abstract | ||
|---|---|---|
Several ideal-lattice-based cryptosystems have been broken by recent attacks that exploit special structures of the rings used in those cryptosystems. The same structures are also used in the leading proposals for post-quantum lattice-based cryptography, including the classic NTRU cryptosystem and typical Ring-LWE-based cryptosystems. This paper (1) proposes NTRU Prime, which tweaks NTRU to use rings without these structures; (2) proposes Streamlined NTRU Prime, a public-key cryptosystem optimized from an implementation perspective, subject to the standard design goal of IND-CCA2 security; (3) finds high-security post-quantum parameters for Streamlined NTRU Prime; and (4) optimizes a constant-time implementation of those parameters. The resulting sizes and speeds show that reducing the attack surface has very low cost. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/978-3-319-72565-9_12 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
Post-quantum cryptography,Public-key encryption,Lattice-based cryptography,Ideal lattices,NTRU,Ring-LWE,Security,Soliloquy,Karatsuba,Software implementation,Vectorization,Fast sorting | Prime (order theory),NTRU,Post-quantum cryptography,Cryptography,Computer science,Parallel computing,Cryptosystem,Lattice-based cryptography,Public-key cryptography,Karatsuba algorithm | Conference |
Volume | ISSN | Citations |
10719 | 0302-9743 | 4 |
PageRank | References | Authors |
0.41 | 30 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daniel J. Bernstein | 1 | 1734 | 110.56 |
| Chitchanok Chuengsatiansup | 2 | 37 | 3.98 |
| Tanja Lange | 3 | 22 | 2.70 |
| Christine van Vredendaal | 4 | 47 | 7.27 |