Design a post-quantum cryptographic algorithm based on lattice for mitigating quantum computing threats.

Cryptographic algorithms are fundamental tools for securing digital information, with symmetric and asymmetric algorithms serving as the cornerstone of modern encryption techniques. Symmetric algorithms utilize a single key for both encryption and decryption, while asymmetric algorithms employ a pair of keys for these operations. Classical cryptographic algorithms, including RSA and AES, have been extensively utilized to ensure data security across various digital platforms.

However, the emergence of quantum computing poses a significant threat to the security provided by classical cryptographic algorithms. Quantum computers have the potential to exploit vulnerabilities in these algorithms using algorithms like Shor’s algorithm, which can efficiently factorize large prime number and solve discrete logarithmic problems. The advancement of quantum will imposes a threat to traditional cryptographic methods, prompting the need for exploring new solutions to maintain rigid security against evolving threats.

To address this vulnerability, we propose lattice-based cryptography as an advanced solution for post-quantum cryptography (PQC). Lattice-based cryptography offers resistance against quantum attacks due to its complex mathematical properties and hardness assumptions. The moto of our research is to successfully design and implement lattice-based cryptographic algorithm, providing a robust defense mechanism against potential quantum computing threats and contribute to the ongoing evolution of cybersecurity measures.

Faculty Supervisor:

Ajmery Sultana

Student:

Partner:

Vellore Institute of Technology

Discipline:

Computer science

Sector:

Quantum Science; Cyber Security; Information and Communications Technology

University:

Algoma University

Program: