Can algorithmic group theory offer quantum resistant algorithms to be used for cryptography?
Last year the NSA (National Security Agency) announced its plans for transitioning to cryptography that is resistant to a quantum computer. Shortly after, NIST (National Institute of Standards and Technology) announced a worldwide competition for quantum-resistant public-key algorithms. Group-based cryptography has been an active area for over a decade, and it has some promises to be one of the solutions for this call. In this talk, I will explore some of the proposed cryptographic schemes and raise some open problems.
Delaram Kahrobaei is a Full Professor at the City University of New York. She has a joint appointment at CUNY Graduate Center in the PhD program in Computer science and at New York City College of Technology (CUNY) in the Mathematics Department. Besides her position at CUNY, she is also an Adjunct Full Professor of Computer Science at the New York University Tandon School of Engineering as well as the President of a start-up Infoshield, Inc. Her main research area is Information Security, Cryptography, Data Science, Computational and Combinatorial Group Theory. Her research has been partially supported by grants from the Office of Naval Research ($900K), Association of Advancement in Sciences (AAAS), National Science Foundation, Research Foundation of CUNY, City Tech Foundation, London Mathematical Society, Edinburgh Mathematical Society, Swiss national Foundation.