Lecture notes in electrical engineering

Post-quantum Cryptography: A Solution to the Challenges of Classical Encryption Algorithms

Shagun Sharma, K. R. Ramkumar, Amanpreet Kaur, Taniya Hasija, Sudesh Kumar Mittal, K. K. Singh

Published Jan 1, 2023• 36 citations

DOI: 10.1007/978-981-19-6383-4_3

Related papers

A Survey of Cryptographic Algorithms in Cybersecurity: From Classical Methods to Quantum-Resistant Solutions

Swapnali N Tambe-Jagtap

As quantum computing technology evolves, it poses greater risks to current cryptography schemes such as RSA and Elliptic Curve Cryptography (ECC), widely used to secure digital communications These classical algorithms are based on mathematical problems that quantum algorithms such as Shore-Grover deal with. Both, can resolve much faster, making them vulnerable to quantum attack This has given rise to post-quantum cryptography (PQC), which focuses on developing quantum-resistant algorithms to protect data in the future of quantum computers classical cryptography Can Break This paper aims to provide a comprehensive insight into quantum-resistant cryptographic algorithms, including lattice-based, hash-based, code-based, and multivariable polynomial methods. It examines the efficiency, benefits, and challenges associated with implementing these algorithms in real-world applications. By comparing key parameters such as key size, encryption/decryption speed, and signature size, this study examines the relative strengths and limitations of post-quantum algorithms to their classical counterparts The results show that lattice-based algorithms , such as NTRU and Kyber, offer promising solutions with relative efficiency and manageable key sizes, making them potential candidates for quantum-resistant cryptography but other approaches , such as SPHINCS+ (hash-based) and McEliece (code-based), large -Face challenges of key size and slow encryption speed, which may limit their usefulness in some applications Despite these challenges, quantum post-cryptography is necessary to secure the future of digital communications.

Shifra.Jun 1, 202323 citations

Post-quantum Cryptography: A Review on Cryptographic Solutions for the Era of Quantum Computing

Manmohan Singh, Sandeep K. Sood, Munish Bhatia

Archives of Computational Methods in EngineeringSep 24, 202523 citations

Post Quantum Cryptography Algorithms: A Review and Applications

Bikram Paul, Gaurav Trivedi

Lecture notes in networks and systemsJan 1, 20237 citations

Research on Cryptography Based on Quantum-Resistant Algorithms

Yu Zhang

In this paper, we discuss the challenges of quantum computing to traditional cryptography and the latest development of post-quantum cryptography as a coping strategy. As quantum computing advances, cryptographic algorithms that rely on the complexity of classical computers, such as RSA and ECC, are at risk of failing, which has prompted the cryptography community to seek new encryption solutions. Post-quantum cryptography focuses on encryption technology and develops resistance to quantum computing attacks. It studies encryption schemes based on lattice theory, multivariate polynomials, coding theory, and hash functions. In addition, lattice-based cryptography is critical. It builds multiple algorithms, including RLWE and NTRU, focusing on LWE and SIS issues, demonstrating strong potential in a quantum computing environment. In terms of signature algorithms, Dilithium and Falcon lattice-based schemes are the focus of standardization. In the simulation analysis of these algorithms, we evaluated their security, efficiency, and compatibility, laying the theoretical and practical foundation for the cryptosystem transformation in the post-quantum era.

International Conference on Electronics and Devices, Computational Science (ICEDCS)Sep 23, 20246 citations

Post-Quantum Cryptography: Algorithms and Implementation Challenges

Murali Krishna Pasupuleti

The advent of quantum computing presents a significant threat to classical public-key cryptographic systems, including RSA and Elliptic Curve Cryptography (ECC), thereby accelerating the development and standardization of post-quantum cryptography (PQC). This study evaluates the performance and implementation challenges of leading PQC algorithms across three major categories: lattice-based, hash-based, and multivariate cryptographic schemes. Utilizing empirical benchmark data from NIST candidate algorithms, the analysis focuses on key generation time, encryption latency, and memory consumption. Simulations and regression modeling reveal that lattice-based algorithms, particularly Kyber, demonstrate favorable trade-offs between computational efficiency and cryptographic strength. However, these schemes also present integration difficulties, especially in resource-constrained or legacy systems. Hash-based schemes like SPHINCS+ exhibit strong security guarantees but suffer from high latency and memory overhead, while multivariate algorithms such as Rainbow offer compact key sizes with moderate performance. The findings highlight the need for application-specific evaluation in selecting PQC solutions and provide actionable insights for guiding secure and efficient cryptographic transitions in the post-quantum era. Keywords: Post-Quantum Cryptography, Lattice-Based Cryptography, Hash-Based Cryptography, Multivariate Cryptography, Quantum Computing, Cryptographic Algorithms, Key Generation, Encryption Latency, Implementation Challenges, NIST PQC Standardization

International Journal of Academic and Industrial Research Innovations(IJAIRI)Jun 26, 20251 citation

CRYPTOGRAPHIC ALGORITHMS ON THE WAY TO POST-QUANTUM CRYPTOGRAPHY

Pavel Nikolaevich Nasedkin, Vladimir Aleksandrovich Sverkunov

Information Technology and Mathematical Modeling in the Management of Complex SystemsJan 1, 20220 citations