{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T11:28:59Z","timestamp":1769858939692,"version":"3.49.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032155405","type":"print"},{"value":"9783032155412","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-15541-2_2","type":"book-chapter","created":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T20:07:37Z","timestamp":1769803657000},"page":"23-38","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Isotropic Quadratic Forms, Diophantine Equations and\u00a0Digital Signatures, DEFIv2"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4584-3020","authenticated-orcid":false,"given":"Martin","family":"Feussner","sequence":"first","affiliation":[]},{"given":"Igor","family":"Semaev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,31]]},"reference":[{"key":"2_CR1","unstructured":"Bambury, H., Nguyen, P.Q.: Cryptanalysis of an Efficient Signature Based on Isotropic Quadratic Forms. Cryptology ePrint Archive, Paper 2025\/133 (2025). https:\/\/eprint.iacr.org\/2025\/133"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/3-540-39799-X_1","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201985 Proceedings","author":"D Estes","year":"1986","unstructured":"Estes, D., Adleman, L.M., Kompella, K., McCurley, K.S., Miller, G.L.: Breaking the Ong-Schnorr-Shamir signature scheme for quadratic number fields. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 3\u201313. Springer, Heidelberg (1986). https:\/\/doi.org\/10.1007\/3-540-39799-X_1"},{"key":"2_CR3","unstructured":"Feussner, M.: DEFIv2. GitHub repository (2025). https:\/\/github.com\/martinfeussner\/DEFIv2\/tree\/main"},{"key":"2_CR4","unstructured":"Feussner, M.: DEFIv2 Challenge Files. GitHub repository (2025). https:\/\/github.com\/martinfeussner\/DEFIv2\/tree\/main\/challenge-files"},{"key":"2_CR5","unstructured":"Feussner, M., Semaev, I.: Isotropic Quadratic Forms, Diophantine Equations and Digital Signatures. Cryptology ePrint Archive, Paper 2024\/679 (2024). https:\/\/eprint.iacr.org\/archive\/2024\/679\/20240503:175841"},{"key":"2_CR6","unstructured":"Feussner, M., Semaev, I.: New Digital Signature Scheme - DEFI. pqc-forum mailing list (2024). https:\/\/groups.google.com\/a\/list.nist.gov\/g\/pqc-forum\/c\/x7-nf3NuYTs\/m\/dGvflCePAQAJ"},{"key":"2_CR7","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 and Company, New York (1979)"},{"key":"2_CR8","doi-asserted-by":"publisher","unstructured":"Harry, Y.: The key exchange cryptosystem used with higher order diophantine equations. Int. J. Netw. Secur. Appl. 3(2) (2011). https:\/\/doi.org\/10.5121\/ijnsa.2011.3204","DOI":"10.5121\/ijnsa.2011.3204"},{"issue":"2","key":"2_CR9","doi-asserted-by":"publisher","first-page":"485","DOI":"10.2307\/1998017","volume":"260","author":"JC Lagarias","year":"1980","unstructured":"Lagarias, J.C.: On the computational complexity of determining the solvability or unsolvability of the equation $$X^2 - DY^2 = -1$$. Trans. Am. Math. Soc. 260(2), 485\u2013508 (1980). https:\/\/doi.org\/10.2307\/1998017","journal-title":"Trans. Am. Math. Soc."},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/3-540-45961-8_39","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201988","author":"T Matsumoto","year":"1988","unstructured":"Matsumoto, T., Imai, H.: Public quadratic polynomial-tuples for efficient signature-verification and message-encryption. In: Barstow, D., et al. (eds.) EUROCRYPT 1988. LNCS, vol. 330, pp. 419\u2013453. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/3-540-45961-8_39"},{"key":"2_CR11","volume-title":"Diophantine Equations","author":"LJ Mordell","year":"1969","unstructured":"Mordell, L.J.: Diophantine Equations. Academic Press, London and New York (1969)"},{"key":"2_CR12","unstructured":"National Institute of Standards and Technology (NIST): Post-Quantum Cryptography Standardization (2024). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/post-quantum-cryptography-standardization"},{"key":"2_CR13","doi-asserted-by":"publisher","unstructured":"Odlyzko, A.M.: The rise and fall of knapsack cryptosystems. in: cryptology and computational number theory. In: Proceedings of Symposia in Applied Mathematics, vol.\u00a042, pp. 75\u201388. American Mathematical Society (1991). https:\/\/doi.org\/10.1090\/psapm\/042\/1095552","DOI":"10.1090\/psapm\/042\/1095552"},{"key":"2_CR14","doi-asserted-by":"publisher","unstructured":"Ong, H., Schnorr, C.P., Shamir, A.: An Efficient Signature Scheme Based on Quadratic Equations. In: Proceedings of the Sixteenth Annual ACM Symposium on Theory of Computing (STOC \u201984). pp. 208\u2013216. Association for Computing Machinery, New York, NY, USA (1984). https:\/\/doi.org\/10.1145\/800057.808683","DOI":"10.1145\/800057.808683"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/3-540-68339-9_4","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201996","author":"J Patarin","year":"1996","unstructured":"Patarin, J.: Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): two new families of asymmetric algorithms. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 33\u201348. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68339-9_4"},{"key":"2_CR16","unstructured":"PQShield: NIST Signature Zoo (2024). https:\/\/pqshield.github.io\/nist-sigs-zoo\/"},{"key":"2_CR17","doi-asserted-by":"publisher","unstructured":"Prasamsa, K.V., Kameswari, P.A., Raju, K.N., Surendra, T., Devi, D.M.: A key exchange algorithm with binary quadratic forms to design complex security framework. Adv. Math.: Sci. J. 10(1), 589\u2013595 (2021). https:\/\/doi.org\/10.37418\/amsj.10.1.58","DOI":"10.37418\/amsj.10.1.58"},{"issue":"5","key":"2_CR18","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1109\/TIT.1984.1056964","volume":"30","author":"A Shamir","year":"1984","unstructured":"Shamir, A.: A polynomial-time algorithm for breaking the basic Merkle - Hellman cryptosystem. IEEE Trans. Inf. Theory 30(5), 699\u2013704 (1984). https:\/\/doi.org\/10.1109\/TIT.1984.1056964","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Lecture Notes in Computer Science","Lightweight Cryptography for Security and Privacy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-15541-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T20:07:39Z","timestamp":1769803659000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-15541-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032155405","9783032155412"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-15541-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"31 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"LightSec","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Lightweight Cryptography for Security and Privacy","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Istanbul","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"T\u00fcrkiye","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lightsec2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.encrypt-on.com\/activities\/conferences\/lightsec-2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}