Private Key and Public Key Quantum Cryptography
Daniel Gottesman
Dept. of Mathematics, UC Berkeley
Tuesday, March 5, 2002 15:00-16:00,
Room 145, NIST North (820)
Gaithersburg
Tuesday, March 5, 2002 13:00-14:00,
Room 4550
Boulder
Abstract:
Information has always been valuable, never more so than in
recent decades, and throughout history people have turned to
cryptography in an attempt to keep important information secret.
Coherent manipulation of quantum states promises to rearrange the
lists of possible and impossible cryptographic tasks. I will describe
Shor's algorithm to break classical codes with a quantum computer and
protocols for quantum key distribution using single photons to perform
unbreakable encryption. One useful classical technique is the idea of
a public key, which can be safely handed out even to an adversary. I
will also show how to create quantum protocols with similar
properties, and how they can be used to create unbreakable digital
signatures.
Speaker Bio:
Daniel Gottesman received a Ph.D. in Physics from Caltech in 1997.
He has had postdoctoral stays at Los Alamos National Laboratory
and at Microsoft Research. He is currently a Visiting Scholar
in the EECS Department at the University of California at Berkeley.
He is also the receipient of the prestigious Long-Term Prize Fellowship
of the Clay Mathematics Institute.
Gottesman's research centers on quantum computation and quantum cryptography.
He is well-known as the developer of the stabilizer code formalism for creating
and describing a large class of quantm error correcting codes
which admit fault-tolerant quantum computation.
Contact: R. F. BoisvertNote: Visitors from outside NIST must contact
Robin Bickel; (301) 975-3668;
at least 24 hours in advance.
|
