Mathematical and Statistical Aspects of Cryptography (January 12-14, 2012)
(in Kolkata, India)

This workshop focuses on mathematical and statistical aspects of public key cryptography. The main ingredients from mathematics so far include discrete logarithms and factoring over the integers, generalizations of the discrete logarithm to elliptic curves, hyperelliptic curves and further generalizations, aspects of infinite non-abelian groups, and closest vector problems (CVP) in integer lattices. Cryptanalysis in all of these areas can involve analyses of patterns in vast amounts of data, hence the need for statistical methods. One goal of this workshop, though not the only one, is to focus attention on the problem of quantifying the complexity of lattice-based problems, for example extrapolating the difficulty of solving a CVP in an integer lattice as a function of its dimension and other parameters.

A copy of the presentations given at this workshop is available as a PDF document.

Schedule and Supporting Materials

Thursday	January 12, 2012
Time	Description	Speaker	Abstracts	Slides
9:00 - 9:30	Registration and Inauguration
9:30 - 10:00	A survey of hard lattice problems and their connections	Benne de Weger, Technisch Universiteit Eindhoevn
10:00 - 10:30	Quantifying the security of lattice-based cryptosystems in practice	Joop van de Pol, University of Bristol
10:30 - 11:00	Lattice signature schemes based on the ring homomorphism of short polynomials to their evaluations	Jeffrey Hoffstein, Brown University
11:00 - 11:30	Tea/Coffee Break
11:30 - 12:00	Identity-Based Encryption: A 30-Minute Tour	Palash Sarkar, Indian Statistical Institute
12:00 - 12:30	A Generic Variant of NIST's KAS2 Key Agreement Protocol	Sanjit Chatterjee, Indian Institute of Science
12:30 - 1:00	Constant round non-malleable commitments	Vipul Goyal, Microsoft Research, India
1:00 - 2:00	Break for Lunch
2:00 - 2:30	Implicit Factorization and Related Problems: Lattice Based Analysis	Santanu Sarkar, Sarat Centenary College, Hooghly
2:30 - 3:00	An overview of Cold-Boot Attack related to RSA and Factorization	Sourav Sen Gupta, Indian Statistical Institute
3:00 - 3:30	Cryptanalysis of CRT-RSA having Low Hamming Weight Decryption Exponents	Subhamoy Maitra, Indian Statistical Institute
3:30	tea/coffee followed by informal discussions and small meetings
Friday	January 13, 2012
Time	Description	Speaker	Abstracts	Slides
9:30 - 10:00	Approximate common divisors via lattices	Nadia Heninger, University of California, San Diego
10:00 - 10:30	Practical Key Recovery Attack against NTRUSign Perturbation Countermeasure	Leo Ducas, École Normale Supérieure
10:30 - 11:00	A new perturbation strategy for NTRUSign	John Schanck, Security Innovation
11:00 - 11:30	Signature schemes from Lattices	Ananth Ragunathan, Stanford University
11:30 - 12:30	tea/coffee followed by informal discussions and small meetings
12:30 - 1:30	Break for Lunch
1:30 - 2:00	Cryptographic hash functions and digital signatures	Praveen Gauravaram, Indian Statistical Institute
2:00 - 2:30	Dual System Encryption Using Asymmetric Pairings and Related Assumptions	Somindu C. Ramanna, Indian Statistical Institute
2:30 - 3:00	On the power of Weakly Programmable Random Oracle	Rishiraj Bhattacharyya, Indian Statistical Institute
3:00 - 3:30	Relaxing IND-CCA: Indistinguishability Against Chosen Ciphertext Verification Attack	Sumit Pandey, Indian Statistical Institute
3:30	tea/coffee break followed by informal discussions
Saturday	January 14, 2012
Time	Description	Speaker	Abstracts	Slides
9:30 - 10:00	A battle of bits: building confidence in cryptography, part 1	Daniel J. Bernstein, University of Illinois at Chicago
10:00 - 10:30	A battle of bits: building confidence in cryptography, part 2	Tanja Lange, Technische Universiteit Eindhoven
10:30 - 11:00	Parallel Computing for Cryptanalysis	Daniel V. Bailey, EMC Product Security Office and Ruhr-University Bochum
11:00 - 11:30	Tea/Coffee Break
11:30 - 12:00	The Learning with Errors (LWE) problem and its cryptographic applications	Mahvir Prasad Jhanwar, C.R.Rao Institute
12:00 - 12:30	ID based Cryptography: opportunities and challenges	Ashutosh Saxena, Infosys
12:30 - 1:00	Randomness tests for Block cipher	Rajeeva L. Karandikar, Chennai Mathematical Institute
1:00 - 2:00	Break for Lunch
2:00 - 2:30	The cryptanalysis of the algebraic eraser	Dorian Goldfeld, Columbia University
2:30 - 3:00	Making NTRU as Secure as Worst-Case Problems over Ideal Lattices	Damien Stehle, Ecole Normale Superieure de Lyon
3:00 - 3:30	Arithmetic of Extension Fields of Small Characteristics: Recent Developments	Abhijit Das, Indian Institute of Technology, Kharagpur
3:30 - 4:00	Trends in Public Key Encryption with additional functionalities and stronger Challenges	C. Pandurangan, Indian Statistical Institute
4:00 - 4:30	Tea/Coffee Break
4:30 - 5:00	Wrap Up