Paper 2020/1557 Original: eprint.iacr.org/2020/1557 ↗
Efficient Quantum Public-Key Encryption From Learning With Errors
Abstract
Our main result is a quantum public-key encryption scheme based on the Extrapolated Di- hedral Coset problem (EDCP) which is equivalent, under quantum polynomial-time reductions, to the Learning With Errors (LWE) problem. For limited number of public keys (roughly linear in the security parameter), the proposed scheme is information-theoretically secure. For poly- nomial number of public keys, breaking the scheme is as hard as solving the LWE problem. The public keys in our scheme are quantum states of size Õ(n) qubits. The key generation and decryption algorithms require Õ(n) qubit operations while the encryption algorithm takes O(1) qubit operations.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2020-12-14: last updated
- 2020-12-14: published
- Short URL
- https://ia.cr/2020/1557
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2020/1557,
author = {Javad Doliskani},
title = {Efficient Quantum Public-Key Encryption From Learning With Errors},
howpublished = {Cryptology {ePrint} Archive, Paper 2020/1557},
year = {2020},
url = {https://eprint.iacr.org/2020/1557}
}