Cryptanalysis of some Lattice-based Assumptions
Cryptography relies on the assumptions of computationally hard problems. It should be hard for security, offer functionalities for cryptographic applications, and be efficient to implement. Recently, lattice-based assumptions have emerged as a strong building block for post-quantum cryptography. In this talk, I will present recent cryptanalytic results on two lattice-based assumptions, namely the Finite Field Isomorpshim problem (PKC’18, JoMC’20), and the Partial Vandermonde Knapsack Problem (ACNS’14, DCC’15, ACISP’18, Eprint’20,DCC’22). These assumptions have been used extensively for various lattice-based constructions, including encryptions, fully homomorphic encryptions, signatures, signature aggregations, etc.
Online Meeting link (for those who cannot join in person): Webex link
Meeting number: 2513 368 9124
Meeting password: D2pMr7mSpt5
Speaker Biography
Dipayan Das was a PostDoc at CISPA-Helmholtz Center for Information Security in the group of Antoine Joux. He has completed his Ph.D. from NIT Durgapur. During his Ph.D., he was a visiting student at Hong Kong Polytechnic University. He has completed his MSc and BSc in mathematics from NIT Durgapur and University of Calcutta, respectively. He was an intern in the Summer Cryptology Internshipconducted by the R.C.Bose Center for Cryptology and Security of the Indian Statistical Institute.
