{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,27]],"date-time":"2026-10-27T12:00:04Z","timestamp":1793102404387,"version":"4.5.0"},"publisher-location":"New York, NY, USA","reference-count":80,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["MA 2536\/12"],"award-info":[{"award-number":["MA 2536\/12"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1145\/3634737.3645007","type":"proceedings-article","created":{"date-parts":[[2024,6,28]],"date-time":"2024-06-28T11:51:38Z","timestamp":1719575498000},"page":"560-574","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":26,"title":["SoK: CryptographicEstimators -- a Software Library for Cryptographic Hardness Estimation"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5806-3600","authenticated-orcid":false,"given":"Andre","family":"Esser","sequence":"first","affiliation":[{"name":"Technology Innovation Institute, Abu Dhabi, United Arab Emirates"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1388-6667","authenticated-orcid":false,"given":"Javier","family":"Verbel","sequence":"additional","affiliation":[{"name":"Technology Innovation Institute, Abu Dhabi, United Arab Emirates"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-7610-9143","authenticated-orcid":false,"given":"Floyd","family":"Zweydinger","sequence":"additional","affiliation":[{"name":"Technology Innovation Institute, Abu Dhabi, United Arab Emirates"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2349-0247","authenticated-orcid":false,"given":"Emanuele","family":"Bellini","sequence":"additional","affiliation":[{"name":"Technology Innovation Institute, Abu Dhabi, United Arab Emirates"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,7]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Slim Bettaieb, Lo\u00efc Bidoux, Alessandro Budroni, Victor Dyseryn, Andre Esser, Philippe Gaborit, Mukul Kulkarni, Victor Mateu, Marco Palumbi, Lucas Perin, and Jean-Pierre Tillich.","author":"Aaraj","year":"2023","unstructured":"[Aaraj et al.(2023)] Najwa Aaraj, Slim Bettaieb, Lo\u00efc Bidoux, Alessandro Budroni, Victor Dyseryn, Andre Esser, Philippe Gaborit, Mukul Kulkarni, Victor Mateu, Marco Palumbi, Lucas Perin, and Jean-Pierre Tillich. 2023. PERK. Technical Report. National Institute of Standards and Technology. available at https:\/\/csrc.nist.gov\/csrc\/media\/Projects\/pqc-dig-sig\/documents\/round-1\/spec-files\/PERK-spec-web.pdf."},{"key":"e_1_3_2_1_2_1","volume-title":"Daniel Apon, David Cooper, Quynh Dang, Thinh Dang, John Kelsey, Jacob Lichtinger, Carl Miller, Dustin Moody, Rene Peralta, et al.","author":"Alagic","year":"2022","unstructured":"[Alagic et al.(2022)] Gorjan Alagic, Daniel Apon, David Cooper, Quynh Dang, Thinh Dang, John Kelsey, Jacob Lichtinger, Carl Miller, Dustin Moody, Rene Peralta, et al. 2022. Status report on the third round of the NIST post-quantum cryptography standardization process. US Department of Commerce, NIST (2022)."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1515\/jmc-2015-0016"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-15982-4_13"},{"key":"e_1_3_2_1_5_1","volume-title":"Alessandro Barenghi, Luke Beckwith, Jean-Fran\u00e7ois Biasse, Andre Esser, Kris Gaj, Kamyar Mohajerani, Gerardo Pelosi, Edoardo Persichetti, Markku-Juhani Saarinen, Paolo Santini, and Robert Wallace.","author":"Baldi","year":"2023","unstructured":"[Baldi et al.(2023)] Marco Baldi, Alessandro Barenghi, Luke Beckwith, Jean-Fran\u00e7ois Biasse, Andre Esser, Kris Gaj, Kamyar Mohajerani, Gerardo Pelosi, Edoardo Persichetti, Markku-Juhani Saarinen, Paolo Santini, and Robert Wallace. 2023. LESS. Technical Report. National Institute of Standards and Technology. available at https:\/\/csrc.nist.gov\/csrc\/media\/Projects\/pqc-dig-sig\/documents\/round-1\/spec-files\/less-spec-web.pdf."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.3390\/a12100209"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2021.11.014"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jco.2012.07.001"},{"key":"e_1_3_2_1_9_1","volume-title":"Ayoub Otmani, and Mohamed Saeed-Taha.","author":"Bardet","year":"2019","unstructured":"[Bardet et al.(2019)] Magali Bardet, Ayoub Otmani, and Mohamed Saeed-Taha. 2019. Permutation Code Equivalence is Not Harder Than Graph Isomorphism When Hulls Are Trivial. In ISIT. IEEE, 2464--2468."},{"key":"e_1_3_2_1_10_1","first-page":"112","article-title":"] Alessandro Barenghi, Jean-Fran\u00e7ois Biasse, Tran Ngo, Edoardo Persichetti, and Paolo Santini. 2022a. Advanced signature functionalities from the code equivalence problem","volume":"7","author":"Barenghi","year":"2022","unstructured":"[Barenghi et al.(2022a)] Alessandro Barenghi, Jean-Fran\u00e7ois Biasse, Tran Ngo, Edoardo Persichetti, and Paolo Santini. 2022a. Advanced signature functionalities from the code equivalence problem. International Journal of Computer Mathematics: Computer Systems Theory 7, 2 (2022), 112--128.","journal-title":"International Journal of Computer Mathematics: Computer Systems Theory"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-81293-5_2"},{"key":"e_1_3_2_1_12_1","volume-title":"Jean-Francois Biasse, Edoardo Persichetti, and Paolo Santini.","author":"Barenghi","year":"2022","unstructured":"[Barenghi et al.(2022b)] Alessandro Barenghi, Jean-Francois Biasse, Edoardo Persichetti, and Paolo Santini. 2022b. On the Computational Hardness of the Code Equivalence Problem in Cryptography. Cryptology ePrint Archive, Report 2022\/967. https:\/\/eprint.iacr.org\/2022\/967."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48071-4_21"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_31"},{"key":"e_1_3_2_1_15_1","unstructured":"[Bellini and Esser(2021)] Emanuele Bellini and Andre Esser. 2021. Syndrome Decoding Estimator. https:\/\/github.com\/Crypto-TII\/syndrome_decoding_estimator"},{"key":"e_1_3_2_1_16_1","volume-title":"Rusydi H. Makarim, Carlo Sanna, and Javier Verbel.","author":"Bellini","year":"2022","unstructured":"[Bellini et al.(2022)] Emanuele Bellini, Rusydi H. Makarim, Carlo Sanna, and Javier Verbel. 2022. An Estimator for the Hardness of the MQ Problem. In Progress in Cryptology - AFRICACRYPT 2022, Lejla Batina and Joan Daemen (Eds.). Springer Nature Switzerland, Cham, 323--347."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-55589-8_15"},{"key":"e_1_3_2_1_18_1","volume-title":"CryptAttack-Tester: formalizing attack analyses. Cryptology ePrint Archive","author":"Bernstein Bernstein","year":"2023","unstructured":"[Bernstein and Chou(2023)] Daniel J Bernstein and Tung Chou. 2023. CryptAttack-Tester: formalizing attack analyses. Cryptology ePrint Archive (2023)."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88403-3_3"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1515\/JMC.2009.009"},{"key":"e_1_3_2_1_21_1","volume-title":"Delaram Kahrobaei, Ludovic Perret, and Javier Verbel.","author":"Bettale","year":"2023","unstructured":"[Bettale et al.(2023)] Luk Bettale, Delaram Kahrobaei, Ludovic Perret, and Javier Verbel. 2023. Biscuit. Technical Report. National Institute of Standards and Technology. available at https:\/\/csrc.nist.gov\/csrc\/media\/Projects\/pqc-dig-sig\/documents\/round-1\/spec-files\/Biscuit-spec-web.pdf."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-81652-0_15"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45727-3_7"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-99277-4_17"},{"key":"e_1_3_2_1_25_1","volume-title":"Ming-Shing Chen, Jintai Ding, Boru Gong, Matthias J. Kannwischer, Jacques Patarin, Bo-Yuan Peng, Dieter Schmidt, Cheng-Jhih Shih, Chengdong Tao, and Bo-Yin Yang.","author":"Beullens","year":"2023","unstructured":"[Beullens et al.(2023)] Ward Beullens, Ming-Shing Chen, Jintai Ding, Boru Gong, Matthias J. Kannwischer, Jacques Patarin, Bo-Yuan Peng, Dieter Schmidt, Cheng-Jhih Shih, Chengdong Tao, and Bo-Yin Yang. 2023. UOV. Technical Report. National Institute of Standards and Technology. available at https:\/\/csrc.nist.gov\/csrc\/media\/Projects\/pqc-dig-sig\/documents\/round-1\/specfiles\/UOV-spec-web.pdf."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-35423-7_1"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-51938-4_3"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2204.02915"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2019.26"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64834-3_22"},{"key":"e_1_3_2_1_31_1","volume-title":"Marcelo E. Kaihara, Thorsten Kleinjung, Arjen K. Lenstra, and Peter L. Montgomery.","author":"Bos","year":"2009","unstructured":"[Bos et al.(2009)] Joppe W. Bos, Marcelo E. Kaihara, Thorsten Kleinjung, Arjen K. Lenstra, and Peter L. Montgomery. 2009. On the Security of 1024-bit RSA and 160-bit Elliptic Curve Cryptography. Cryptology ePrint Archive, Report 2009\/389. https:\/\/eprint.iacr.org\/2009\/389."},{"key":"e_1_3_2_1_32_1","volume-title":"WCC workshop on coding and cryptography","volume":"214","author":"Leif Both Both","year":"2017","unstructured":"[Both and May(2017)] Leif Both and Alexander May. 2017. Optimizing BJMM with nearest neighbors: full decoding in 22\/21n and McEliece security. In WCC workshop on coding and cryptography, Vol. 214."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-79063-3_2"},{"key":"e_1_3_2_1_34_1","volume-title":"CHES","author":"Charles Bouillaguet Bouillaguet","year":"2010","unstructured":"[Bouillaguet et al.(2010)] Charles Bouillaguet, Hsieh-Chung Chen, Chen-Mou Cheng, Tung Chou, Ruben Niederhagen, Adi Shamir, and Bo-Yin Yang. 2010. Fast Exhaustive Search for Polynomial Systems in F2. In Cryptographic Hardware and Embedded Systems, CHES 2010. 203--218."},{"key":"e_1_3_2_1_35_1","unstructured":"[Carrier and Tillich(2023)] Kevin Carrier and Jean-Pierre Tillich. 2023. pqc-forum: ROUND 3 OFFICIAL COMMENT: SDitH. Available at: https:\/\/groups.google.com\/a\/list.nist.gov\/g\/pqc-forum\/c\/d_BcUfFGl5o."},{"key":"e_1_3_2_1_36_1","volume-title":"Ruben Niederhagen, Edoardo Persichetti, Tovohery Hajatiana Randrianarisoa, Krijn Reijnders, Simona Samardjiska, and Monika Trimoska.","author":"Chou","year":"2022","unstructured":"[Chou et al.(2022)] Tung Chou, Ruben Niederhagen, Edoardo Persichetti, Tovohery Hajatiana Randrianarisoa, Krijn Reijnders, Simona Samardjiska, and Monika Trimoska. 2022. Take your MEDS: Digital Signatures from Matrix Code Equivalence. Cryptology ePrint Archive, Report 2022\/1559. https:\/\/eprint.iacr.org\/2022\/1559."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45539-6_27"},{"key":"e_1_3_2_1_38_1","volume-title":"Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations. EUROCRYPT 2000","author":"Courtois Courtois","year":"1807","unstructured":"[Courtois et al.(2000b)] N. Courtois, A. Klimov, J. Patarin, and A. Shamir. 2000b. Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations. EUROCRYPT 2000, LNCS 1807 (2000), 392--407."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-16721-3_2"},{"key":"e_1_3_2_1_40_1","volume-title":"Boru Gong, Hao Guo, Xiaoou He, Yi Jin, Yuansheng Pan, Dieter Schmidt, Chengdong Tao, Danli Xie, Bo-Yin Yang, and Ziyu Zhao.","author":"Ding","year":"2023","unstructured":"[Ding et al.(2023)] Jintai Ding, Boru Gong, Hao Guo, Xiaoou He, Yi Jin, Yuansheng Pan, Dieter Schmidt, Chengdong Tao, Danli Xie, Bo-Yin Yang, and Ziyu Zhao. 2023. TUOV. Technical Report. National Institute of Standards and Technology. available at https:\/\/csrc.nist.gov\/csrc\/media\/Projects\/pqc-dig-sig\/documents\/round-1\/spec-files\/TUOV-spec-web.pdf."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-77870-5_14"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.151"},{"key":"e_1_3_2_1_43_1","volume-title":"Proc. 5th Joint Soviet-Swedish Int. Workshop Inform. Theory. 50--52","author":"Dumer Ilya","year":"1991","unstructured":"[Dumer(1991)] Ilya Dumer. 1991. On minimum distance decoding of linear codes. In Proc. 5th Joint Soviet-Swedish Int. Workshop Inform. Theory. 50--52."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-97121-2_5"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63715-0_17"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-07082-2_16"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-4049(99)00005-5"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/780506.780516"},{"key":"e_1_3_2_1_51_1","volume-title":"MinRank, Rank SD and PKP. IACR Cryptol. ePrint Arch.","author":"Feneuil Thibauld","year":"2022","unstructured":"[Feneuil(2022)] Thibauld Feneuil. 2022. Building MPCitH-based Signatures from MQ, MinRank, Rank SD and PKP. IACR Cryptol. ePrint Arch. (2022), 1512. https:\/\/eprint.iacr.org\/2022\/1512"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-15979-4_19"},{"key":"e_1_3_2_1_53_1","volume-title":"Technical Report","author":"Thibauld Feneuil Feneuil","unstructured":"[Feneuil and Rivain(2023)] Thibauld Feneuil and Matthieu Rivain. 2023. MQOM. Technical Report. National Institute of Standards and Technology. available at https:\/\/csrc.nist.gov\/csrc\/media\/Projects\/pqc-dig-sig\/documents\/round-1\/spec-files\/MQOM-spec-web.pdf."},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00193565"},{"key":"e_1_3_2_1_55_1","volume-title":"Beno\u00eet Cogliati, Jean-Charles Faug\u00e8re, Pierre-Alain Fouque, Robin Larrieu, Gilles Macario-Rat, Brice Minaud, and Jacques Patarin.","author":"Goubin","year":"2023","unstructured":"[Goubin et al.(2023)] Louis Goubin, Beno\u00eet Cogliati, Jean-Charles Faug\u00e8re, Pierre-Alain Fouque, Robin Larrieu, Gilles Macario-Rat, Brice Minaud, and Jacques Patarin. 2023. PROV. Technical Report. National Institute of Standards and Technology. available at https:\/\/csrc.nist.gov\/csrc\/media\/Projects\/pqc-dig-sig\/documents\/round-1\/spec-files\/prov-spec-web.pdf."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44586-2_12"},{"key":"e_1_3_2_1_58_1","volume-title":"Number-Theoretic Methods in Cryptology, Jerzy Kaczorowski, Josef Pieprzyk, and Jacek Pomyka\u0142a (Eds.)","author":"Antoine Joux Joux","unstructured":"[Joux and Vitse(2018)] Antoine Joux and Vanessa Vitse. 2018. A Crossbred Algorithm for Solving Boolean Polynomial Systems. In Number-Theoretic Methods in Cryptology, Jerzy Kaczorowski, Josef Pieprzyk, and Jacek Pomyka\u0142a (Eds.). Springer International Publishing, Cham, 3--21."},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48910-X_15"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-56620-7_7"},{"key":"e_1_3_2_1_61_1","volume-title":"Gilles Macario-Rat, and Jacques Patarin.","author":"Koussa","year":"2019","unstructured":"[Koussa et al.(2019)] Eliane Koussa, Gilles Macario-Rat, and Jacques Patarin. 2019. On the complexity of the Permuted Kernel Problem. Cryptology ePrint Archive, Report 2019\/412. https:\/\/eprint.iacr.org\/2019\/412."},{"key":"e_1_3_2_1_62_1","volume-title":"Workshop on the Theory and Application of of Cryptographic Techniques. Springer, 275--280","author":"Pil Joong Lee Lee","year":"1988","unstructured":"[Lee and Brickell(1988)] Pil Joong Lee and Ernest F Brickell. 1988. An observation on the security of McEliece's public-key cryptosystem. In Workshop on the Theory and Application of of Cryptographic Techniques. Springer, 275--280."},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-40061-5_4"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056498"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25385-0_6"},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46800-5_9"},{"key":"e_1_3_2_1_67_1","volume-title":"Thibauld Feneuil, Nicolas Gama, Shay Gueron, James Howe, David Joseph, Antoine Joux, Edoardo Persichetti, Tovohery H. Randrianarisoa, Matthieu Rivain, and Dongze Yue.","author":"Melchor","year":"2023","unstructured":"[Melchor et al.(2023)] Carlos Aguilar Melchor, Thibauld Feneuil, Nicolas Gama, Shay Gueron, James Howe, David Joseph, Antoine Joux, Edoardo Persichetti, Tovohery H. Randrianarisoa, Matthieu Rivain, and Dongze Yue. 2023. SDitH. Technical Report. National Institute of Standards and Technology. available at https:\/\/csrc.nist.gov\/csrc\/media\/Projects\/pqc-dig-sig\/documents\/round-1\/spec-files\/SDitH-spec-web.pdf."},{"key":"e_1_3_2_1_68_1","unstructured":"[NIST(2016)] NIST. 2016. Submission Requirements and Evaluation Criteria for the Post-Quantum Cryptography Standardization Process. Available at: https:\/\/csrc.nist.gov\/csrc\/media\/projects\/post-quantum-cryptography\/documents\/call-for-proposals-final-dec-2016.pdf."},{"key":"e_1_3_2_1_69_1","volume-title":"NIST PQC 2017 First Round Submissions. Available at: https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/post-quantum-cryptography-standardization\/round-1-submissions.","author":"NIST.","year":"2017","unstructured":"[NIST(2017)] NIST. 2017. NIST PQC 2017 First Round Submissions. Available at: https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/post-quantum-cryptography-standardization\/round-1-submissions."},{"key":"e_1_3_2_1_70_1","unstructured":"[NIST(2022)] NIST. 2022. Call for Additional Digital Signature Schemes for the Post-Quantum Cryptography Standardization Process. Available at: https:\/\/csrc.nist.gov\/csrc\/media\/Projects\/pqc-dig-sig\/documents\/call-for-proposals-dig-sig-sept-2022.pdf."},{"key":"e_1_3_2_1_71_1","volume-title":"NIST PQC 2023 Additional Signature First Round Submissions. Available at: https:\/\/csrc.nist.gov\/Projects\/pqc-dig-sig\/round-1-additional-signatures.","author":"NIST.","year":"2023","unstructured":"[NIST(2023)] NIST. 2023. NIST PQC 2023 Additional Signature First Round Submissions. Available at: https:\/\/csrc.nist.gov\/Projects\/pqc-dig-sig\/round-1-additional-signatures."},{"key":"e_1_3_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48329-2_33"},{"key":"e_1_3_2_1_73_1","volume-title":"Beno\u00eet Cogliati, Jean-Charles Faug\u00e8re, Pierre-Alain Fouque, Louis Goubin, Robin Larrieu, Gilles Macario-Rat, and Brice Minaud.","author":"Patarin","year":"2023","unstructured":"[Patarin et al.(2023)] Jacques Patarin, Beno\u00eet Cogliati, Jean-Charles Faug\u00e8re, Pierre-Alain Fouque, Louis Goubin, Robin Larrieu, Gilles Macario-Rat, and Brice Minaud. 2023. VOX. Technical Report. National Institute of Standards and Technology. available at https:\/\/csrc.nist.gov\/csrc\/media\/Projects\/pqc-dig-sig\/documents\/round-1\/spec-files\/vox-spec-web.pdf."},{"key":"e_1_3_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12929-2_7"},{"key":"e_1_3_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.623157"},{"key":"e_1_3_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057777"},{"key":"e_1_3_2_1_77_1","volume-title":"Simona Samardjiska, and Monika Trimoska.","author":"Reijnders","year":"2022","unstructured":"[Reijnders et al.(2022)] Krijn Reijnders, Simona Samardjiska, and Monika Trimoska. 2022. Hardness estimates of the Code Equivalence Problem in the Rank Metric. Cryptology ePrint Archive, Report 2022\/276. https:\/\/eprint.iacr.org\/2022\/276."},{"key":"e_1_3_2_1_78_1","volume-title":"Marco Baldi, and Franco Chiaraluce.","author":"Santini","year":"2022","unstructured":"[Santini et al.(2022)] Paolo Santini, Marco Baldi, and Franco Chiaraluce. 2022. Computational Hardness of the Permuted Kernel and Subcode Equivalence Problems. Cryptology ePrint Archive, Report 2022\/1749. https:\/\/eprint.iacr.org\/2022\/1749."},{"key":"e_1_3_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.5555\/252265.252288"},{"key":"e_1_3_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850662"},{"key":"e_1_3_2_1_81_1","volume-title":"International Workshop on Coding and Cryptography-WCC","author":"Nicolas Sendrier Sendrier","year":"2013","unstructured":"[Sendrier and Simos(2013)] Nicolas Sendrier and Dimitrios E Simos. 2013. How easy is code equivalence over Fq?. In International Workshop on Coding and Cryptography-WCC 2013."},{"key":"e_1_3_2_1_82_1","volume-title":"International Colloquium on Coding Theory and Applications","author":"Stern Jacques","unstructured":"[Stern(1988)] Jacques Stern. 1988. A method for finding codewords of small weight. In International Colloquium on Coding Theory and Applications. Springer, 106--113."},{"key":"e_1_3_2_1_83_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30057-8_10"}],"event":{"name":"ASIA CCS '24: 19th ACM Asia Conference on Computer and Communications Security","location":"Singapore Singapore","acronym":"ASIA CCS '24","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 19th ACM Asia Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3634737.3645007","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T23:44:06Z","timestamp":1750290246000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3634737.3645007"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7]]},"references-count":80,"alternative-id":["10.1145\/3634737.3645007","10.1145\/3634737"],"URL":"https:\/\/doi.org\/10.1145\/3634737.3645007","relation":{},"subject":[],"published":{"date-parts":[[2024,7]]},"assertion":[{"value":"2024-07-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}