Main approaches in post-quantum cryptography: description, a comparative study

MaRDI QIDQ6899621zbMATH OpenFDO

Authors Ekaterina Sergeevna Malygina, Aleksandr Kutsenko, S. A. Novoselov, Nikita Sergeevich Kolesnikov, Aleksandr Olegovich Bakharev, Irina Sergeevna Khil'chuk, Alexander Shaporenko, Natalia Tokareva

Publication date 14 November 2025

Published in Prikladnaya Diskretnaya Matematika. Supplement (Search for Journal in Brave)

zbMATH Keywords

error-correcting codesisogenieslattice-based cryptographypost-quantum cryptographyquantum computer

Mathematics Subject Classification ID

Quantum theory (81-XX) Statistical mechanics, structure of matter (82-XX)

Cites work

• BKZ 2.0: Better lattice security estimates
• Cryptanalysis of the Sidelnikov Cryptosystem
• Efficient Encryption From Random Quasi-Cyclic Codes
• Factoring polynomials with rational coefficients
• scientific article; zbMATH DE number 1186948 (Why is no real title available?)
• scientific article; zbMATH DE number 1256724 (Why is no real title available?)
• Introduction to post-quantum cryptography
• Lattice enumeration using extreme pruning
• New directions in nearest neighbor searching with applications to lattice sieving
• On the inherent intractability of certain coding problems (Corresp.)
• Optimal strategies for CSIDH
• Speed-ups and time-memory trade-offs for tuple lattice sieving

This page was built for publication: Main approaches in post-quantum cryptography: description, a comparative study

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6899621)