{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:38:41Z","timestamp":1786981121009,"version":"3.56.0"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2024,3,27]],"date-time":"2024-03-27T00:00:00Z","timestamp":1711497600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,3,27]],"date-time":"2024-03-27T00:00:00Z","timestamp":1711497600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"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":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2024,8]]},"DOI":"10.1007\/s10623-024-01381-2","type":"journal-article","created":{"date-parts":[[2024,3,27]],"date-time":"2024-03-27T09:03:37Z","timestamp":1711530217000},"page":"2131-2157","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["PERK: compact signature scheme based on a new variant of the permuted kernel problem"],"prefix":"10.1007","volume":"92","author":[{"given":"Slim","family":"Bettaieb","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3455-926X","authenticated-orcid":false,"given":"Lo\u00efc","family":"Bidoux","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Victor","family":"Dyseryn","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5806-3600","authenticated-orcid":false,"given":"Andre","family":"Esser","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Philippe","family":"Gaborit","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mukul","family":"Kulkarni","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marco","family":"Palumbi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,3,27]]},"reference":[{"key":"1381_CR1","unstructured":"Adj G., Rivera-Zamarripa L., Verbel J.: MinRank in the head: Short signatures from zero-knowledge proofs. Cryptology ePrint Archive, Report 2022\/1501 (2022). https:\/\/eprint.iacr.org\/2022\/1501."},{"key":"1381_CR2","doi-asserted-by":"crossref","unstructured":"Aguilar-Melchor C., Gama N., Howe J., H\u00fclsing A., Joseph D., Yue D.: The return of the sdith. In: Advances in Cryptology\u2013EUROCRYPT 2023: 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, April 23\u201327, 2023, Proceedings, Part V. pp. 564\u2013596. Springer (2023).","DOI":"10.1007\/978-3-031-30589-4_20"},{"key":"1381_CR3","unstructured":"Alekhnovich M.: More on average case vs approximation complexity. In: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science. p.\u00a0298. FOCS \u201903, IEEE Computer Society, USA (2003)."},{"key":"1381_CR4","doi-asserted-by":"publisher","unstructured":"Attema T., Cramer R., Kohl L.: A compressed $$\\Sigma $$-protocol theory for lattices. In: Malkin, T., Peikert, C. (eds.) CRYPTO\u00a02021, Part\u00a0II. LNCS, vol. 12826, pp. 549\u2013579. Springer, Heidelberg, Virtual Event (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_19.","DOI":"10.1007\/978-3-030-84245-1_19"},{"key":"1381_CR5","doi-asserted-by":"publisher","unstructured":"Attema T., Fehr S.: Parallel repetition of ($$k_1, \\dots , k_{\\mu }$$)-special-sound multi-round interactive proofs. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO\u00a02022, Part\u00a0I. LNCS, vol. 13507, pp. 415\u2013443. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_15.","DOI":"10.1007\/978-3-031-15802-5_15"},{"key":"1381_CR6","doi-asserted-by":"publisher","unstructured":"Attema T., Fehr S., Kloo\u00df M.: Fiat-shamir transformation of multi-round interactive proofs. In: Kiltz, E., Vaikuntanathan, V. (eds.) TCC\u00a02022, Part\u00a0I. LNCS, vol. 13747, pp. 113\u2013142. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-22318-1_5.","DOI":"10.1007\/978-3-031-22318-1_5"},{"key":"1381_CR7","doi-asserted-by":"publisher","unstructured":"Baldi M., Bitzer S., Pavoni A., Santini P., Wachter-Zeh A., Weger V.: Zero knowledge protocols and signatures from the restricted syndrome decoding problem. In: Tang, Q., Teague, V. (eds.) Public-Key Cryptography \u2013 PKC 2024. PKC 2024. Lecture Notes in Computer Science, vol. 14602. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-57722-2_8.","DOI":"10.1007\/978-3-031-57722-2_8"},{"key":"1381_CR8","doi-asserted-by":"publisher","unstructured":"Baritaud T., Campana M., Chauvaud P., Gilbert H.: On the security of the permuted kernel identification scheme. In: Brickell, E.F. (ed.) CRYPTO\u201992. LNCS, vol.\u00a0740, pp. 305\u2013311. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-48071-4_21.","DOI":"10.1007\/3-540-48071-4_21"},{"key":"1381_CR9","doi-asserted-by":"publisher","unstructured":"Bellare M., Davis H., G\u00fcnther F.: Separate your domains: NIST PQC KEMs, oracle cloning and read-only indifferentiability. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT\u00a02020, Part\u00a0II. LNCS, vol. 12106, pp. 3\u201332. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_1.","DOI":"10.1007\/978-3-030-45724-2_1"},{"key":"1381_CR10","doi-asserted-by":"crossref","unstructured":"Berger T.P., Gueye C.T., Klamti J.B.: A np-complete problem in coding theory with application to code based cryptography. In: Codes, Cryptology and Information Security: Second International Conference, C2SI 2017, Rabat, Morocco, April 10\u201312, 2017, Proceedings-In Honor of Claude Carlet. pp. 230\u2013237. Springer (2017).","DOI":"10.1007\/978-3-319-55589-8_15"},{"key":"1381_CR11","doi-asserted-by":"publisher","unstructured":"Beullens W.: Not enough LESS: An improved algorithm for solving code equivalence problems over $${\\mathbb{F}}_q$$. In: Dunkelman, O., Jr., M.J.J., O\u2019Flynn, C. (eds.) SAC 2020. LNCS, vol. 12804, pp. 387\u2013403. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-81652-0_15.","DOI":"10.1007\/978-3-030-81652-0_15"},{"key":"1381_CR12","doi-asserted-by":"publisher","unstructured":"Beullens W.: Sigma protocols for MQ, PKP and SIS, and Fishy signature schemes. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT\u00a02020, Part\u00a0III. LNCS, vol. 12107, pp. 183\u2013211. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-45727-3_7.","DOI":"10.1007\/978-3-030-45727-3_7"},{"key":"1381_CR13","doi-asserted-by":"publisher","unstructured":"Beullens W., Faug\u00e8re J.C., Koussa E., Macario-Rat G., Patarin J., Perret L.: PKP-based signature scheme. In: Hao, F., Ruj, S., Sen Gupta, S. (eds.) INDOCRYPT\u00a02019. LNCS, vol. 11898, pp. 3\u201322. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-35423-7_1.","DOI":"10.1007\/978-3-030-35423-7_1"},{"key":"1381_CR14","unstructured":"Beullens W., Feo L.D., Galbraith S.D., Petit C.: Proving knowledge of isogenies-a survey. Cryptology ePrint Archive, Paper 2023\/671 (2023). https:\/\/eprint.iacr.org\/2023\/671."},{"key":"1381_CR15","doi-asserted-by":"crossref","unstructured":"Bidoux L., Gaborit P.: Compact post-quantum signatures from proofs of knowledge leveraging structure for the PKP, SD and RSD problems. In: Codes, Cryptology and Information Security (C2SI). pp. 10\u201342. Springer (2023).","DOI":"10.1007\/978-3-031-33017-9_2"},{"issue":"2","key":"1381_CR16","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s10623-022-01114-3","volume":"91","author":"L Bidoux","year":"2023","unstructured":"Bidoux L., Gaborit P., Kulkarni M., Mateu V.: Code-based signatures from new proofs of knowledge for the syndrome decoding problem. Des. Codes Cryptogr. 91(2), 497\u2013544 (2023).","journal-title":"Des. Codes Cryptogr."},{"key":"1381_CR17","unstructured":"Chase M., Derler D., Goldfeder S., Kales D., Katz J., Kolesnikov V., Orlandi C., Ramacher S., Rechberger C., Slamanig D., Wang X., Zaverucha G.: The picnic signature scheme design document (version 3.0). Available at https:\/\/csrc.nist.gov\/CSRC\/media\/Projects\/post-quantum-cryptography\/documents\/round-3\/submissions\/Picnic-Round3.zip (2020)."},{"key":"1381_CR18","doi-asserted-by":"crossref","unstructured":"Chou T., Niederhagen R., Persichetti E., Randrianarisoa T.H., Reijnders K., Samardjiska S., Trimoska M.: Take your MEDS: digital signatures from matrix code equivalence. Cryptology ePrint Archive (2022).","DOI":"10.1007\/978-3-031-37679-5_2"},{"issue":"2","key":"1381_CR19","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s10623-014-0010-1","volume":"78","author":"C Delfs","year":"2016","unstructured":"Delfs C., Galbraith S.D.: Computing isogenies between supersingular elliptic curves over $${{\\mathbb{F} }_{p}}$$. Des. Codes Cryptogr. 78(2), 425\u2013440 (2016). https:\/\/doi.org\/10.1007\/s10623-014-0010-1.","journal-title":"Des. Codes Cryptogr."},{"key":"1381_CR20","doi-asserted-by":"crossref","unstructured":"Esser A., Verbel J., Zweydinger F., Bellini E.: CryptographicEstimators: a software library for cryptographic hardness estimation. Cryptology ePrint Archive (2023).","DOI":"10.1145\/3634737.3645007"},{"key":"1381_CR21","unstructured":"Feneuil T.: Building MPCitH-based signatures from MQ, MinRank, rank SD and PKP. Cryptology ePrint Archive, Report 2022\/1512 (2022). https:\/\/eprint.iacr.org\/2022\/1512."},{"key":"1381_CR22","doi-asserted-by":"publisher","unstructured":"Feneuil T., Joux A., Rivain M.: Syndrome decoding in the head: shorter signatures from zero-knowledge proofs. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO\u00a02022, Part\u00a0II. LNCS, vol. 13508, pp. 541\u2013572. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_19.","DOI":"10.1007\/978-3-031-15979-4_19"},{"key":"1381_CR23","doi-asserted-by":"publisher","unstructured":"Feneuil T., Maire J., Rivain M., Vergnaud D.: Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection. In: Agrawal S., Lin D. (eds.) ASIACRYPT\u00a02022, Part\u00a0II. LNCS, vol. 13792, pp. 371\u2013402. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-22966-4_13.","DOI":"10.1007\/978-3-031-22966-4_13"},{"issue":"2","key":"1381_CR24","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s10623-022-01116-1","volume":"91","author":"T Feneuil","year":"2023","unstructured":"Feneuil T., Joux A., Rivain M.: Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature. Des. Codes Cryptogr. 91(2), 563\u2013608 (2023).","journal-title":"Des. Codes Cryptogr."},{"key":"1381_CR25","doi-asserted-by":"publisher","unstructured":"Fiat A., Shamir A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko A.M. (ed.) CRYPTO\u201986. LNCS, vol.\u00a0263, pp. 186\u2013194. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_12.","DOI":"10.1007\/3-540-47721-7_12"},{"issue":"12","key":"1381_CR26","doi-asserted-by":"publisher","first-page":"7245","DOI":"10.1109\/TIT.2016.2616127","volume":"62","author":"P Gaborit","year":"2016","unstructured":"Gaborit P., Z\u00e9mor G.: On the hardness of the decoding and the minimum distance problems for rank codes. IEEE Trans. Inf. Theory 62(12), 7245\u20137252 (2016). https:\/\/doi.org\/10.1109\/TIT.2016.2616127.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1381_CR27","doi-asserted-by":"publisher","unstructured":"Gaborit P., Hauteville A., Phan D.H., Tillich J.P.: Identity-based encryption from codes with rank metric. In: Katz J., Shacham H. (eds.) CRYPTO\u00a02017, Part\u00a0III. LNCS, vol. 10403, pp. 194\u2013224. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-63697-9_7.","DOI":"10.1007\/978-3-319-63697-9_7"},{"key":"1381_CR28","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey M.R., Johnson D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Series of Books in the Mathematical Sciences. W. H. Freeman, New York (1979)."},{"issue":"2","key":"1381_CR29","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF00193565","volume":"5","author":"J Georgiades","year":"1992","unstructured":"Georgiades J.: Some remarks on the security of the identification scheme based on permuted kernels. J. Cryptol. 5(2), 133\u2013137 (1992). https:\/\/doi.org\/10.1007\/BF00193565.","journal-title":"J. Cryptol."},{"issue":"1","key":"1381_CR30","doi-asserted-by":"publisher","first-page":"5","DOI":"10.3390\/cryptography6010005","volume":"6","author":"S Gueron","year":"2022","unstructured":"Gueron S., Persichetti E., Santini P.: Designing a practical code-based signature scheme from zero-knowledge proofs with trusted setup. Cryptography 6(1), 5 (2022).","journal-title":"Cryptography"},{"key":"1381_CR31","unstructured":"H\u00fclsing A., Bernstein D.J., Dobraunig C., Eichlseder M., Fluhrer S., Gazdag S.L., Kampanakis P., K\u00f6lbl S., Lange T., Lauridsen M.M., Mendel F., Niederhagen R., Rechberger C., Rijneveld J., Schwabe P., Aumasson J.P., Westerbaan B., Beullens W.: SPHINCS+. Tech. rep., National Institute of Standards and Technology (2022). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/selected-algorithms-2022."},{"key":"1381_CR32","doi-asserted-by":"publisher","unstructured":"Ishai Y., Kushilevitz E., Ostrovsky R., Sahai A.: Zero-knowledge from secure multiparty computation. In: Johnson D.S., Feige U. (eds.) 39th ACM STOC. pp. 21\u201330. ACM Press (2007). https:\/\/doi.org\/10.1145\/1250790.1250794.","DOI":"10.1145\/1250790.1250794"},{"issue":"3","key":"1381_CR33","doi-asserted-by":"publisher","first-page":"1121","DOI":"10.1137\/080725398","volume":"39","author":"Y Ishai","year":"2009","unstructured":"Ishai Y., Kushilevitz E., Ostrovsky R., Sahai A.: Zero-knowledge proofs from secure multiparty computation. SIAM J. Comput. 39(3), 1121\u20131152 (2009). https:\/\/doi.org\/10.1137\/080725398.","journal-title":"SIAM J. Comput."},{"key":"1381_CR34","doi-asserted-by":"publisher","unstructured":"Jaulmes \u00c9., Joux A.: Cryptanalysis of PKP: A new approach. In: Kim K. (ed.) PKC\u00a02001. LNCS, vol.\u00a01992, pp. 165\u2013172. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44586-2_12.","DOI":"10.1007\/3-540-44586-2_12"},{"key":"1381_CR35","doi-asserted-by":"publisher","unstructured":"Kales D., Zaverucha G.: An attack on some signature schemes constructed from five-pass identification schemes. In: Krenn S., Shulman H., Vaudenay S. (eds.) CANS 20. LNCS, vol. 12579, pp. 3\u201322. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-65411-5_1.","DOI":"10.1007\/978-3-030-65411-5_1"},{"key":"1381_CR36","doi-asserted-by":"publisher","unstructured":"Katz J., Kolesnikov V., Wang X.: Improved non-interactive zero knowledge with applications to post-quantum signatures. In: Lie D., Mannan M., Backes M., Wang X. (eds.) ACM CCS 2018. pp. 525\u2013537. ACM Press (2018). https:\/\/doi.org\/10.1145\/3243734.3243805.","DOI":"10.1145\/3243734.3243805"},{"key":"1381_CR37","unstructured":"Koussa E., Macario-Rat G., Patarin J.: On the complexity of the permuted kernel problem. Cryptology ePrint Archive, Report 2019\/412 (2019), https:\/\/eprint.iacr.org\/2019\/412."},{"key":"1381_CR38","unstructured":"Lampe R., Patarin J.: Analysis of some natural variants of the pkp algorithm. Cryptology ePrint Archive (2011)."},{"key":"1381_CR39","unstructured":"Lyubashevsky V., Ducas L., Kiltz E., Lepoint T., Schwabe P., Seiler G., Stehl\u00e9 D., Bai S.: CRYSTALS-DILITHIUM. Tech. rep., National Institute of Standards and Technology (2022). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/selected-algorithms-2022."},{"key":"1381_CR40","unstructured":"NIST: Post-quantum cryptography standardization (2017). https:\/\/csrc.nist.gov\/CSRC\/media\/Projects\/Post-Quantum-Cryptography\/documents\/call-for-proposals-final-dec-2016.pdf."},{"key":"1381_CR41","unstructured":"NIST: Call for additional digital signature schemes for the post-quantum cryptography standardization process (2022). https:\/\/csrc.nist.gov\/csrc\/media\/Projects\/pqc-dig-sig\/documents\/call-for-proposals-dig-sig-sept-2022.pdf."},{"key":"1381_CR42","doi-asserted-by":"publisher","unstructured":"Overbeck R., Sendrier N.: Code-based cryptography, pp. 95\u2013145. Springer, Berlin. (2009). https:\/\/doi.org\/10.1007\/978-3-540-88702-7_4, https:\/\/doi.org\/10.1007\/978-3-540-88702-7_4.","DOI":"10.1007\/978-3-540-88702-7_4"},{"key":"1381_CR43","doi-asserted-by":"publisher","unstructured":"Paiva T.B., Terada R.: Cryptanalysis of the binary permuted kernel problem. In: Sako K., Tippenhauer N.O. (eds.) ACNS 21, Part\u00a0II. LNCS, vol. 12727, pp. 396\u2013423. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-030-78375-4_16.","DOI":"10.1007\/978-3-030-78375-4_16"},{"key":"1381_CR44","doi-asserted-by":"publisher","unstructured":"Patarin J., Chauvaud P.: Improved algorithms for the permuted kernel problem. In: Stinson D.R. (ed.) CRYPTO\u201993. LNCS, vol.\u00a0773, pp. 391\u2013402. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48329-2_33.","DOI":"10.1007\/3-540-48329-2_33"},{"key":"1381_CR45","unstructured":"Peikert C.: A decade of lattice cryptography. Cryptology ePrint Archive, Report 2015\/939 (2015). https:\/\/eprint.iacr.org\/2015\/939."},{"issue":"5","key":"1381_CR46","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1109\/TIT.1962.1057777","volume":"8","author":"E Prange","year":"1962","unstructured":"Prange E.: The use of information sets in decoding cyclic codes. IRE Trans. Inf. Theory 8(5), 5\u20139 (1962).","journal-title":"IRE Trans. Inf. Theory"},{"key":"1381_CR47","unstructured":"Prest T., Fouque P.A., Hoffstein J., Kirchner P., Lyubashevsky V., Pornin T., Ricosset T., Seiler G., Whyte W., Zhang Z.: FALCON. Tech. rep., National Institute of Standards and Technology (2022). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/selected-algorithms-2022."},{"key":"1381_CR48","doi-asserted-by":"publisher","DOI":"10.1145\/1568318.1568324","author":"O Regev","year":"2009","unstructured":"Regev O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM (2009). https:\/\/doi.org\/10.1145\/1568318.1568324.","journal-title":"J. ACM"},{"key":"1381_CR49","doi-asserted-by":"publisher","unstructured":"Santini P., Baldi M., Chiaraluce F.: Computational hardness of the permuted kernel and subcode equivalence problems. In: IEEE Transactions on Information Theory, vol. 70, no. 3, pp. 2254\u20132270 (2024). https:\/\/doi.org\/10.1109\/TIT.2023.3323068","DOI":"10.1109\/TIT.2023.3323068"},{"key":"1381_CR50","doi-asserted-by":"publisher","unstructured":"Shamir A.: An efficient identification scheme based on permuted kernels (extended abstract) (rump session). In: Brassard G. (ed.) CRYPTO\u201989. LNCS, vol.\u00a0435, pp. 606\u2013609. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_54.","DOI":"10.1007\/0-387-34805-0_54"},{"key":"1381_CR51","doi-asserted-by":"publisher","unstructured":"Shor P.W.: Algorithms for quantum computation: Discrete logarithms and factoring. In: 35th FOCS. pp. 124\u2013134. IEEE Computer Society Press (1994). https:\/\/doi.org\/10.1109\/SFCS.1994.365700.","DOI":"10.1109\/SFCS.1994.365700"},{"key":"1381_CR52","unstructured":"Wang W.: Shorter signatures from MQ. Cryptology ePrint Archive, Report 2022\/344 (2022). https:\/\/eprint.iacr.org\/2022\/344."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01381-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-024-01381-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01381-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,3]],"date-time":"2024-10-03T12:06:39Z","timestamp":1727957199000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-024-01381-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,27]]},"references-count":52,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["1381"],"URL":"https:\/\/doi.org\/10.1007\/s10623-024-01381-2","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,27]]},"assertion":[{"value":"22 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 December 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 February 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 March 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 September 2024","order":5,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Update","order":6,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The complete page range details was updated for the references 7 and 49.","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All authors of this paper are involved in the PERK submission to the NIST post-quantum additional call for digital signatures. The extended list of contributors to the PERK submission is available for consultation at\n                      \n                      . There are no other competing interests to declare.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}