DeepAI AI Chat
Log In Sign Up

Efficient Quantum Public-Key Encryption From Learning With Errors

by   Javad Doliskani, et al.

Our main result is a quantum public-key encryption scheme based on the Extrapolated Dihedral 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 polynomial 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.


page 1

page 2

page 3

page 4


Quantum Public-Key Encryption with Tamper-Resilient Public Keys from One-Way Functions

We construct quantum public-key encryption from one-way functions. In ou...

Cryptanalysis of Three Quantum Money Schemes

We investigate the security assumptions behind three public-key quantum ...

Weak approximate unitary designs and applications to quantum encryption

Unitary t-designs are the bread and butter of quantum information theory...

RSA+: An algorithm at least as secure as RSA

The RSA algorithm has been around for nearly five decades and remains on...

Weak-Key Analysis for BIKE Post-Quantum Key Encapsulation Mechanism

The evolution of quantum computers poses a serious threat to contemporar...

Homomorphic Encryption based on Hidden Subspace Membership

In this paper, we propose a leveled fully homomorphic encryption scheme ...

Post-Quantum Key Agreement Protocol based on Non-Square Integer Matrices

We present in this paper an algorithm for exchanging session keys, coupl...