A Note on Quantum McEliece Public-Key Cryptosystem
Source: Cornell University
The security of McEliece Public-Key Cryptosystem (PKC) relies on the difficulty of decoding general linear codes, an NP-complete problem. McEliece PKC has been analyzed for more than thirty years, and is still regarded as a secure one. It is generally accepted that quantum computer cannot solve NP-complete problems in polynomial time, so McEliece PKC is believed to be one that can resist quantum attacks. Eextended it to a public-key encryption algorithm for quantum messages. This quantum PKC will degenerate to original McEliece PKC if the plaintext state is restricted to single computational basis, then be secure to encrypt classical messages. Based on this quantum PKC, they introduce a new concept named induced trapdoor one-way quantum transformation and a general framework of quantum PKC.