Paper 2020/1557

Efficient Quantum Public-Key Encryption From Learning With Errors

Javad Doliskani

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. MINOR revision.
Keywords
Quantum CryptographyPublic-Key EncryptionLearning With ErrorsDihedral Coset
Contact author(s)
javad doliskani @ ryerson ca
History
2020-12-14: received
Short URL
https://ia.cr/2020/1557
License
Creative Commons Attribution
CC BY

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},
      note = {\url{https://eprint.iacr.org/2020/1557}},
      url = {https://eprint.iacr.org/2020/1557}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.