General Information
The QuantumSafe Crypto Workshop, was held at CQT Level 3 Seminar Room, S150315, Centre for Quantum Technologies, National University of Singapore on October 3, 2016.
Program
03 Oct, Mon  
9:45  10:00hr  Coffee/Tea Reception 
10:00  10:10hr  Welcome 
10:10  11:00hr 
Leo Ducas, Centrum Wiskunde & Informatica (CWI), Amsterdam NewHope, Frodo, in Between and Beyond Abstract We start by a brief presentation of NewHope, an instantiation of a postquantum KeyExchange scheme based on the RingLWE assumption with a few new trick toward, simplicity, efficiency and security in the wild.

11:10  12:00hr 
Sze Ling Yeo, Institute for Infocomm Research (I2R), A*STAR Singapore On Semaev polynomials and ECDLP Attacks Abstract In this talk, we will review the approach of using Semaev polynomials to solve the elliptic curve discrete logarithm problem (ECDLP). In particular, we will outline how these polynomials can be used in an indexcalculus attack to solve ECDLP instances. We will demonstrate some specific instances where these attacks lead to subexponential attacks. On the other hand, we will discuss why subexponential claims on general instances using this approach can be controvertial. 
12:00  14:00hr  Lunch 
14:00  14:50hr 
KaiMin Chung, Academia Sinica, Taiwan Computational Notions of Quantum Entropy Abstract Computational entropies, such as HILL (min)entropy, metric (min)entropy, and guessing pseudoentropy, are fundamental concepts in cryptography and complexity theory. These notions measure how much (min)entropy a source $X$ has from the eyes of a computationally bounded party who may hold certain leakage information $B$ about $X$. In this work, we initiate the study of these notions in the quantum setting, where $X$ and/or $B$ may become quantum states. We first observe that these notions generalize naturally in the quantum setting, though some notions only generalize for classical $X$ with quantum $B$. We then explore whether classical theorems extend to the quantum setting. The results turn out to be quite intriguing, as summarized below:

14:50  15:40hr 
Divesh Aggarwal, Centre for Quantum Technologies, NUS, Singapore Algorithms for Lattice Problems via Discrete Gaussians Abstract I will present a randomized 2^{n+o(n)}time and space algorithm for solving the Shortest Vector Problem (SVP) and the Closest Vector Problem (CVP) on ndimensional Euclidean lattices.

15:40  16:00hr  Coffee/Tea Break 
16:00  16:50hr 
Khoa Nguyen, Nanyang Technological University, Singapore Some recent uses of Sternlike protocols in latticebased cryptography Abstract At CRYPTO 1993, Stern introduced a zeroknowledge protocol for the Syndrome Decoding problem, which later became one of the most prominent tools in codebased cryptography. The protocol was first adapted into the lattice setting by Kawachi, Tanaka and Xagawa (ASIACRYPT 2008). A recent body of work has developed Stern's protocol into a relatively strong tool for designing privacypreserving latticebased schemes (e.g., group signatures, logarithmicsize ring signatures, group encryption, compact ecash). In this talk, I will survey these recent developments. 