Quantum Public-Key Cryptosystem Based on Classical NP-Complete Problem

Abstract

We present a quantum public-key cryptosystem based on a classical NP-complete problem related with finding a code word of a given weight in a linear binary code.

Cited by in corpus (11)

• Quantum asymmetric cryptography with symmetric keys
• Quantum public-key cryptosystems based on induced trapdoor one-way transformations
• Quantum Public-Key Encryption with Information Theoretic Security
• Quantum fully homomorphic encryption scheme based on quantum fault-tolerant construction
• A complete Classification of Quantum Public-key Encryption Protocols
• Quantum no-key protocols for secret transmission of quantum and classical message
• A note on quantum McEliece public-key cryptosystem
• Indistinguishability and semantic security for quantum encryption scheme
• Quantum public-key algorithms to encrypt and authenticate quantum messages with information-theoretic security
• Cryptography based on operator theory (I): quantum no-key protocols
• Bit-oriented quantum public-key encryption