SN Computer Science · 2023 · 22 citations · 21 references
ComputingComputer EngineeringComputer ScienceCryptographyQuantum ComputingSecure Software DevelopmentCryptographic AlgorithmsCryptographic ImplementationLattice-based CryptographyPost-quantum CryptographyQuantum ComputationQuantum CryptographyKey Encapsulation MechanismsPost-quantum Cryptographic ProtocolsPost-quantum Cryptography ImplementationPost-quantum Cryptography StandardizationPost-quantum Digital SignaturesPublic-key Cryptography ImplementationQuantum Digital SignaturesQuantum Public-key Cryptography
Abstract Widely used public key cryptography is threatened by the development of quantum computers. Post-quantum algorithms have been designed for the purpose of protecting sensitive data against attacks with quantum computers. National Institute of Standards and Technology has recently reached the end of the third round of post-quantum standardization process and has published three digital signatures and one key encapsulation mechanism for standardization. Three of the chosen algorithms are based on lattices. When implementing complex cryptographic algorithms, developers commonly use cryptographic libraries in their solutions to avoid mistakes. However, most of the open-source cryptography libraries do not yet have post-quantum algorithms integrated in them. We chose a C++ cryptography library, Crypto++, and created a fork where we integrated four lattice-based post-quantum algorithms. We analyzed the challenges in the process as well as the performance, correctness and security of the implemented algorithms. The performance of the integrated algorithms was overall good, but the integration process had its challenges, many of which were caused by the mathematical complexity of lattice-based algorithms. Different open-source implementations of post-quantum algorithms will be essential to their easier use for developers. Usability of the implementations is also important to avoid possible mistakes when using the algorithms.
21
A fast quantum mechanical algorithm for database search
Lov K. Grover · 1996 · 8.6K citations · Full text
Modular multiplication without trial division
Peter L. Montgomery · Mathematics of Computation · 1985 · 2.4K citations
On lattices, learning with errors, random linear codes, and cryptography
Oded Regev · 2005 · 2.2K citations