Public key cryptosystems (PKC) are critical part of the foundation of modern communication systems, in particular, Internet. However Shor's algorithm shows that the existing PKC like Diffie-Hellmann key exchange, RSA and ECC can be broken by a quantum computer. To prepare for the coming age of quantum computing, we need to build new public key cryptosystems that could resist quantum computer attacks. In this lecture, we present a practical and provably secure (authenticated) key exchange protocol based on the learning with errors problems, which is conceptually simple and has strong provable security properties. This new constructions was established in 2011-2012. These protocols are indeed practical. We will explain that all the existing LWE based key exchanges are variants of this fundamental design.
In addition, we will explain how to use the signal function invented for KE for authentication schemes.
Jintai Ding is a professor at the Department of Mathematical Sciences of the University of Cincinnati. He received his B.A. from Xian Jiaotong University in 1988, his M.A. in mathematics from the University of Science and Technology of China in 1990 and his Ph.D in mathematics from Yale in 1995. He was a lecturer at the Research Institute for Mathematical Sciences of Kyoto University from 1995 to 1998. He has been a faculty member at the University of Cincinnati since 1998. From 2006 to 2007, he was a visiting professor and Alexander Von Humboldt Fellow at Technical University of Darmstadt. He received the Zhong Jia Qing Prize from by the Chinese Mathematical Society in 1990. He was a Taft fellow at Taft Research Center in 2009-2010. His main research interests are in cryptography, computational algebra and information security.
He was a co-chair of the second international workshop on post-quantum cryptography. He and his colleagues developed the Rainbow signature scheme, the GUI HFEV- signature, the Simple Matrix encryption scheme and the LWE-based post-quantum key exchange scheme.