Research Article
An Efficient Post-Quantum PKE from RLWR with Simple Security Proof
@INPROCEEDINGS{10.1007/978-3-030-90022-9_22, author={Parhat Abla and Mingsheng Wang}, title={An Efficient Post-Quantum PKE from RLWR with Simple Security Proof}, proceedings={Security and Privacy in Communication Networks. 17th EAI International Conference, SecureComm 2021, Virtual Event, September 6--9, 2021, Proceedings, Part II}, proceedings_a={SECURECOMM PART 2}, year={2021}, month={11}, keywords={RLWR Lattice Post-quantum Encryption}, doi={10.1007/978-3-030-90022-9_22} }- Parhat Abla
Mingsheng Wang
Year: 2021
An Efficient Post-Quantum PKE from RLWR with Simple Security Proof
SECURECOMM PART 2
Springer
DOI: 10.1007/978-3-030-90022-9_22
Abstract
In this paper, we propose a public-key encryption scheme based on the Ring Learning With Rounding (RLWR) problem. Our scheme is seen as RLWR based variant of Saber (NIST PQC standardization round 3 candidate scheme). The design motivation is to overcome the very involved security proofs of LWR based public-key encryption schemes. To simplify the previous very involved security proofs, we introduce an intermediate problem which is at least as hard as RLWE problem. In contradiction to the previous LWR based schemes, our construction shares simple and intuitive security proof. We first present an IND-CPA public-key encryption scheme, and then apply a variant of the Fujisaki–Okamoto transforms to create a CCA- secure KEM. Our parameterization of the final KEM and the reference implementation shows that the performance of our scheme is comparable with the NIST PQC standardization round 3 candidates.
