Mathematics and Computer Science, Volume 1

5Developments in Post- Quantum Cryptography

Srijita Sarkar¹*, Saranya Kumar², Anaranya Bose³ and Tiyash Mukherjee¹

¹Computer Science and Engineering, Institute of Engineering and Management, Kolkata, India

²Information Technology, Institute of Engineering and Management, Kolkata, India

³Computer Science (Internet of Things), Institute of Engineering and Management, Kolkata, India

Abstract

Cryptography deals with the design of mechanisms based on mathematical algorithms that provide fundamental information security services for computers and communication systems. Modern-day cryptography makes use of binary bit sequences and relies on publicly known algorithms such as number theory, computational complexity theory, and probability theory that are practically impossible for conventional computers to compute. Quantum computers use quantum bits or Qubits and can get us “a quantum speedup,” which will take seconds to solve these complex computations. This quantum supremacy, which scientists hope to attain by the next two decades, would pose a serious threat to the existing cryptographic systems. The main algorithms that have been proposed for post-quantum primitives are based on lattices, multivariate polynomials, codes, hash functions, supersingular elliptical curves and so on. This paper focuses on the developments that have so far been made in the field of post-quantum cryptography and its future prospects.

Keywords: Information security, modern-day cryptography, quantum computers, ...