Analysis of resistance of the FULEECA, WAVE, BISCUIT, and RYDE post-quantum digital signature algorithms
Keywords:
BISCUIT, FULEECA, post-quantum digital signature algorithm, quantum computer, quantum cryptography, RYDE, WAVEAbstract
Post-quantum digital signature algorithms are being developed as an alternative to classical schemes, capable of ensuring cryptographic security even in the presence of quantum computing power.
The results of the analysis and research of the FULEECA, WAVE, BISCUIT, and RYDE post-quantum digital signature algorithms, which are based on different cryptographic approaches to ensuring resistance in quantum computing environments — from code and rank schemes to multilateral quadratic constructions — providing multi-level resistance to a wide range of attacks, are presented.
The analysis showed that all the algorithms considered have high potential for use in post-quantum systems, meeting key requirements for security, performance, and efficiency. At the same time, each algorithm has its own requirements for resources, key and signature sizes, implementation features, and cryptographic resistance to classical and quantum attacks.
The results provide a basis for further comparative analysis, as well as for formulating recommendations for the application of each of the algorithms depending on the specifics of the information system, the level of threats, and the limitations of the implementation environment.
References
Additional PQC Digital Signature Candidates Announced | Computer Security Resource Center. URL: https://csrc.nist.gov/news/2023/additional-pqc-digital-signature-candidates
Post-Quantum Cryptography: Digital Signature Schemes | Computer Security Resource Center. URL: https://csrc.nist.gov/Projects/pqc-dig-sig/round-1-additional-signatures
Nicolas T Courtois, Matthieu Finiasz, and Nicolas Sendrier. How to achieve a McEliece-based digital signature scheme. В Advances in Cryptology–ASIACRYPT 2001 // 7th International Conference on the Theory and Application of Cryptology and Information Security Gold Coast, Australia, December 9-13, 2001 Proceedings 7, pages 157-174. Springer, 2001.
Stefan Ritterhoff, Sebastian Bitzer, Patrick Karl, Georg Maringer, Thomas Schamberger, Jonas Schupp, Georg Sig,l Antonia Wachter-Zeh, Violetta Weger. FuLeeca Submission to the NIST Post-Quantum Cryptography Standardization Process Algorithm Specifications and Supporting Documentation // Technical University of Munich, Germany. 2023. URL: https://csrc.nist.gov/csrc/media/Projects/pqc-dig-sig/documents/round-1/spec-files/FuLeeca-spec-web.pdf.
Anna-Lena Horlemann-Trautmann and Violetta Weger. Information set decoding in the Lee metric with applications to cryptography // Advances in Mathematics of Communications. 2001. 15(4).
Violetta Weger, Karan Khathuria, Anna-Lena Horlemann, Massimo Battaglioni, Paolo Santini, and Edoardo Persichetti. On the hardness of the Lee syndrome decoding problem // Advances in Mathematics of Communications, April 2022. Publisher: Advances in Mathematics of Communications.
Craig Gentry. Key recovery and message attacks on ntru-composite. In Advances in Cryptology–EUROCRYPT 2001 // International Conference on the Theory and Application of Cryptographic Techniques Innsbruck, Austria, May 6-10, 2001 Proceedings 20, pages 182-194. Springer, 2001.
Carl Löndahl, Thomas Johansson, Masoumeh Koochak Shooshtari, Mahmoud Ahmadian-Attari, and Mohammad Reza Aref. Squaring attacks on McEliece public-key cryptosystems using quasicyclic codes of even dimension // Designs, Codes and Cryptography. 2016. 80:359-377.
Round 1 (Additional Signatures) OFFICIAL COMMENT: FuLeeca. URL: https://eprint.iacr.org/2024/353
Gustavo Banegas et al. Wave Round 1 Submission . NIST Computer Security Resource Center | CSRC. URL: https://csrc.nist.gov/csrc/media/Projects/pqc-dig-sig/documents/round-1/spec-files/wave-spec-web.pdf .
Bénéteau J., Deneuville J.-C., Gaborit P., & Zémor G. Wave: A new family of trapdoor one-way preimage sampleable functions based on codes. Post-Quantum Cryptography, PQCrypto 2019. URL: https://doi.org/10.1007/978-3-030-25510-7_15.
Luk Bettale, Delaram Kahrobaei. Biscuit: Shorter MPC-based Signature from PoSSo. URL: https://csrc.nist.gov/csrc/media/Projects/pqc-dig-sig/documents/round-1/spec-files/Biscuit-spec-web.pdf.
M. R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979.
Lisa Nicklasson. On the hilbert series of ideals generated by generic forms // Communications in Algebra.2016. No45(8). Р.3390–3395.
Aviad Kipnis, Jacques Patarin, and Louis Goubin. Unbalanced oil and vinegar signature schemes // Jacques Stern, editor, Advances in Cryptology – EUROCRYPT ’99. P. 206–222. Berlin, Heidelberg, 1999. Springer Berlin Heidelberg.
Enrico Thomae and Christopher Wolf. Solving underdetermined systems of multivariate quadratic equations revisited // Marc Fischlin, Johannes Buchmann, and Mark Manulis, editors, Public Key Cryptography – PKC 2012.P. 156 Berlin, Heidelberg, 1999. Springer Berlin Heidelberg.171. Springer Berlin Heidelberg 012.
H. Furue, S. Nakamura, and T. Takagi. Improving Thomae-Wolf algorithm for solving underdetermined multivariate quadratic polynomial problem // J. H. Cheon and J.-P. Tillich, editors, PQcrypto 2021. LNCS. P. 65–78, Cham, 2021. Springer International Publishing.
Hiroki Furue and Tsuyoshi Takagi. Fast enumeration algorithm for multivariate polynomials over general finite fields // Cryptology ePrint Archive, Paper 2023/619, 2023. https://eprint.iacr.org/2023/619.
Emanuele Bellini, Rusydi H. Makarim, Carlo Sanna, and Javier A. Verbel. An estimator for the hardness of the MQ problem. In Lejla Batina and Joan Daemen, editors, Progress in Cryptology – AFRICACRYPT 2022 // 13th International Conference on Cryptology in Africa, AFRICACRYPT 2022, Fes, Morocco, July 18-20, 2022, Proceedings, Lecture Notes in Computer Science. P. 323–347. Springer Nature Switzerland, 2022.
Peter Schwabe and Bas Westerbaan. Solving binary MQ with grover’s algorithm // Claude Carlet, M. Anwar Hasan, and Vishal Saraswat, editors, Security, Privacy, and Applied Cryptography Engineering – 6th International Conference, SPACE 2016, Hyderabad, India, December 14-18, 2016, Proceedings, volume 10076 of Lecture Notes in Computer Science. P. 303–322. Springer, 2016.
Nicolas Aragon et al. RYDE specifications. NIST Computer Security Resource Center | CSRC. URL: https://csrc.nist.gov/csrc/media/Projects/pqc-dig-sig/documents/round-1/spec-files/ryde-spec-web.pdf
Rahul Mishra, Bhupendra Singh, Radhakrishnan Delhibabu. Searching for S-boxes with better Diffusion using Evolutionary Algorithm. IACR Cryptology ePrint Archive. URL: https://eprint.iacr.org/2023/353
Downloads
Published
How to Cite
Issue
Section
License
Authors who publish with this journal agree to the following terms:
1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
