das-dipayan

 

Education

PhD in Mathematics (2020), National Institute of Technology, Durgapur, India.

MSc in Mathematics with Computer Applications (2015), National Institute of Technology, Durgapur, India.

BSc in Mathematics Hons. (2013), University of Calcutta, India.

 Research Interests

Number Theory, Lattice Theory, Public key Cryptography, Provable Security, Cryptanalysis

Research Description

My research focuses on cryptographic problems, particularly lattice-based cryptography, which is considered promising for post-quantum cryptography. I explore the mathematical hardness assumptions underlying lattice-based cryptosystems, aiming to develop secure and efficient cryptographic primitives resistant to attacks from classical and quantum computers.

Recent Publications

Calvin Abou Haidar, Dipayan Das, Anja Lehmann, Cavit Özbay, Octavio Perez Kempnerx: Privacy-Preserving Multi-Signatures: Generic Techniques and Constructions Without Pairings. PKC 2025 (to appear)

Dipayan Das, Antoine Joux: Key Recovery Attack on the Partial Vandermonde Knapsack Problem. EUROCRYPT 2024

Dipayan Das, Antoine Joux: On the Hardness of the Finite Field Isomorphism Problem. EUROCRYPT 2023

Dipayan Das, Jeffrey Hoffstein, Jill Pipher, William Whyte, Zhenfei Zhang: Modular lattice signatures, revisited. Design, Codes, and Cryptography 88(3): 505-532 (2020)

Shi Bai, Dipayan Das, Ryo Hiromasa, Miruna Rosca, Amin Sakzad, Damien Stehlé, Ron Steinfeld, Zhenfei Zhang: MPSign: A Signature from Small-Secret Middle-Product Learning with Errors. PKC 2020

Shi Bai, Katharina Boudgoust, Dipayan Das, Adeline Roux-Langlois, Weiqiang Wen, Zhenfei Zhang: Middle-Product Learning with Rounding Problem and Its Applications. ASIACRYPT 2019

Personal website: https://sites.google.com/site/dasdipayan9038

-----------------------------------------------