2000 character limit reached
Quantum McEliece public-key encryption scheme
Published 19 Jan 2015 in quant-ph and cs.CR | (1501.04895v1)
Abstract: This paper investigates a quantum version of McEliece public-key encryption (PKE) scheme, and analyzes its security. As is well known, the security of classical McEliece PKE is not stronger than the onewayness of related classical one-way function. We prove the security of quantum McEliece PKE ranks between them. Moreover, we propose the double-encryption technique to improve its security, and the security of the improved scheme is proved to be between the original scheme and the quantum one-time pad.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.