Quantum encryption and generalized Shannon impossibility

Ching-Yi Lai*, Kai Min Chung

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


The famous Shannon impossibility result says that any encryption scheme with perfect secrecy requires a secret key at least as long as the message. In this paper we provide its quantum analogue with imperfect secrecy and imperfect correctness. We also give a systematic study of information-theoretically secure quantum encryption with two secrecy definitions. We show that the weaker one implies the stronger but with a security loss in d, where d is the dimension of the encrypted quantum system. This is good enough if the target secrecy error is of o(d- 1).

Original languageEnglish
Pages (from-to)1961-1972
Number of pages12
JournalDesigns, Codes, and Cryptography
Issue number9
StatePublished - 15 Sep 2019


  • Information-theoretic security
  • Key length
  • Quantum one-time pad
  • Shannon impossibility

Fingerprint Dive into the research topics of 'Quantum encryption and generalized Shannon impossibility'. Together they form a unique fingerprint.

Cite this