Invited speakers
Daniel Bernstein
Research Professor in the Department of Computer Science
at the University of Illinois at Chicago
A brief survey of post-quantum
cryptography.
ABSTRACT: Available soon.
Graeme Smith
Postdoctoral Fellow at IBM T J Watson Research Center, Yorktown Heights
What is a Quantum Computer?
ABSTRACT: As a theoretical model, quantum computation offers the
potential for fast algorithms for some seemingly intractable computational
problems, most notably factoring. However, implementing this model in a
physical system presents many practical and conceptual challenges. I will
review the requirements for a physical system to truly implement quantum
computation, and discuss several proposals to do so.
Daniele Micciancio
Associate Professor in the Computer Science
and Engineering department at the University of California at San Diego
Lattice based cryptography: complexity assumptions and
cryptographic applications
ABSTRACT: Lattice-based cryptographic constructions hold a great
promise for post-quantum cryptography, as they enjoy very strong security
proofs based on worst-case hardness, relatively effient implementations, and
are believed to be secure against quantum computers. In this survey talk I
will describe the current state of the art in lattice based cryptography,
focusing on the complexity assumptions used in lattice based cryptography,
and how to build various kinds of cryptographic primitives (e.g., hash
functions, digital signatures, public-key encryption, etc.) based on these
assumptions.
Bo-Yin Yang
Associate Research Fellow at the
Institute of Information Science of Academia Sinica in Taiwan.
Fast Implementaton of XL
ABSTRACT:
Herein is the story behind an XL implemention that was used to show the
insecurity of QUAD(256,20,20) and a version of Rainbow. Along it we discuss
issues of theory, practice, and software engineering..
Johannes Buchmann
Professor of Computer Science and
Mathematics, Technische Universität Darmstadt.
Opening
talk Post Quantum Cryptography
|