Small Pseudo-Random Families of Matrices: Derandomizing Approximate Quantum Encryption

Details Small Pseudo-Random Families of Matrices: Derandomizing Approximate Quantum Encryption Small Pseudo-Random Families of Matrices: Derandomizing Approximate Quantum Encryption

2004-04-13

arxiv.org/abs/quant-ph/0404075v1

Physics

Quantum Physics

11 pages, no figures. In Proceedings of RANDOM 2004, Cambridge, MA, August 2004

Scientific paper

A quantum encryption scheme (also called private quantum channel, or state randomization protocol) is a one-time pad for quantum messages. If two parties share a classical random string, one of them can transmit a quantum state to the other so that an eavesdropper gets little or no information about the state being transmitted. Perfect encryption schemes leak no information at all about the message. Approximate encryption schemes leak a non-zero (though small) amount of information but require a shorter shared random key. Approximate schemes with short keys have been shown to have a number of applications in quantum cryptography and information theory. This paper provides the first deterministic, polynomial-time constructions of quantum approximate encryption schemes with short keys. Previous constructions (quant-ph/0307104) are probabilistic--that is, they show that if the operators used for encryption are chosen at random, then with high probability the resulting protocol will be a secure encryption scheme. Moreover, the resulting protocol descriptions are exponentially long. Our protocols use keys of the same length as (or better length than) the probabilistic constructions; to encrypt $n$ qubits approximately, one needs $n+o(n)$ bits of shared key. An additional contribution of this paper is a connection between classical combinatorial derandomization and constructions of pseudo-random matrix families in a continuous space.

Affiliated with

Also associated with

No associations

Rating

Small Pseudo-Random Families of Matrices: Derandomizing Approximate Quantum Encryption does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Small Pseudo-Random Families of Matrices: Derandomizing Approximate Quantum Encryption, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Small Pseudo-Random Families of Matrices: Derandomizing Approximate Quantum Encryption will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-247514