Paper 2018/109
NTRU-LPR IND-CPA: A New Ideal Lattices-based Scheme
Soda Diop, Bernard Ousmane Sané, Nafissatou Diarra, and Michel Seck
Abstract
In this paper, we propose NTRU-LPR IND-CPA, a new secure scheme based on the decisional variant of Bounded Distance Decoding problem over rings (DR-BDD). This scheme is IND-CPA secure and has two KEM variants IND-CCA2 secure in the random oracle model. NTRU-LPR IND-CPA is similar to NTRU LPRime and LPR Cryptosystem. NTRU-LPR IND-CPA does not have a problem of decryption failures. Our polynomial ring can be any ring of the form
Note: Forgotten character
Metadata
- Available format(s)
-
PDF
- Publication info
- Preprint. MINOR revision.
- Keywords
- Lattice-based Post-Quantum CryptographyNTRUEncryptNTRU-PrimeNTRU-LPRimeNTRU IND-CPAKEMRing-LWETitaniumKyberNewHopeFrodoKEMNTRU-HRSS-KEMSecurity proof
- Contact author(s)
- fifiramatou @ gmail com
- History
- 2018-03-05: last of 4 revisions
- 2018-01-30: received
- See all versions
- Short URL
- https://ia.cr/2018/109
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2018/109, author = {Soda Diop and Bernard Ousmane Sané and Nafissatou Diarra and Michel Seck}, title = {{NTRU}-{LPR} {IND}-{CPA}: A New Ideal Lattices-based Scheme}, howpublished = {Cryptology {ePrint} Archive, Paper 2018/109}, year = {2018}, url = {https://eprint.iacr.org/2018/109} }