Atlas home || Conferences | Abstracts | about Atlas
Host: University of Cincinnati
Sponsor: University of Cincinnati FlexSecure
Homepage: http://math.uc.edu/~aac/pqcrypto2008/
Email: ding@math.uc.edu
Organizers: Johannes Buchmann, Jintai Ding
Deadline for abstracts: June 15, 2008
Description:
Peter Shor’s algorithm shows that if one can build a quantum computer with large bit capacity, he or she can break currently most popular public-key cryptosystems: e.g., RSA, DSA, and ECDSA, which are based on hard number theory problems.
Can we build large quantum computers? What will they do to the cryptographic world, in particular, public key cryptographic world?
PQCrypto 2008 is the second of the new series of workshops on Post-Quantum cryptography, which is devoted to the cryptographic research in preparing us for the world of the possible future quantum computers. This series of workshop is organized due to the growing interest from academic researchers, industries and governments in this area. A very successful PQCrypto 2006, the first PQCrypto, was held in Belgium.
PQCrypto 2008 will serve as a forum for researchers to present results and exchange ideas in post-quantum cryptography. The topics include (but are not restricted to)
public key cryptosystems that have the potential to resist possible future quantum computers such as: hash-based Merkle-type signature schemes, lattice-based cryptosystems, code-based cryptosystems, multivariate cryptosystems and quantum cryptographic schemes;
classical and quantum attacks including side channel attacks on the post-quantum cryptosystems;
security models for the post-quantum era.
Program Chair: Johannes Buchmann, Jintai Ding
General Chair: Timothy Hodges
Submitted by: Jintai Ding
Date received: February 19, 2008, revised February 21, 2008
© 2008 Atlas Conferences Inc.