{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:25:56Z","timestamp":1757618756018,"version":"3.44.0"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031972591"},{"type":"electronic","value":"9783031972607"}],"license":[{"start":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T00:00:00Z","timestamp":1751414400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T00:00:00Z","timestamp":1751414400000},"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-031-97260-7_10","type":"book-chapter","created":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T05:20:47Z","timestamp":1752470447000},"page":"192-215","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Constant-Time Integer Arithmetic for\u00a0SQIsign"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8997-6100","authenticated-orcid":false,"given":"Fatna","family":"Kouider","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0002-5565-5744","authenticated-orcid":false,"given":"Anisha","family":"Mukherjee","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0001-8386-006X","authenticated-orcid":false,"given":"David","family":"Jacquemin","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2043-9542","authenticated-orcid":false,"given":"P\u00e9ter","family":"Kutas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,7,2]]},"reference":[{"key":"10_CR1","unstructured":"Aardal, M.A., et al.: SQISIGN: algorithm specifications and supporting documentation. National Institute for Standards and Technology (2025)"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/3-540-47721-7_24","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 86","author":"P Barrett","year":"1987","unstructured":"Barrett, P.: Implementing the Rivest Shamir and Adleman public key encryption algorithm on a standard digital signal processor. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 311\u2013323. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_24"},{"key":"10_CR3","doi-asserted-by":"publisher","unstructured":"Bernstein, D.J., Yang, B.Y.: Fast constant-time gcd computation and modular inversion. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2019(3), 340\u2013398 (2019). https:\/\/doi.org\/10.13154\/tches.v2019.i3.340-398","DOI":"10.13154\/tches.v2019.i3.340-398"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-642-15497-3_9","volume-title":"Computer Security \u2013 ESORICS 2010","author":"O Catrina","year":"2010","unstructured":"Catrina, O., de Hoogh, S.: Secure multiparty linear programming using fixed-point arithmetic. In: Gritzalis, D., Preneel, B., Theoharidou, M. (eds.) ESORICS 2010. LNCS, vol. 6345, pp. 134\u2013150. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15497-3_9"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-14577-3_6","volume-title":"Financial Cryptography and Data Security","author":"O Catrina","year":"2010","unstructured":"Catrina, O., Saxena, A.: Secure computation with fixed-point numbers. In: Sion, R. (ed.) FC 2010. LNCS, vol. 6052, pp. 35\u201350. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14577-3_6"},{"key":"10_CR6","unstructured":"Chavez-Saab, J., et al.: SQISIGN: algorithm specifications and supporting documentation. National Institute for Standards and Technology (2023)"},{"issue":"4","key":"10_CR7","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1147\/sj.294.0526","volume":"29","author":"PG Comba","year":"1990","unstructured":"Comba, P.G.: Exponentiation cryptosystems on the ibm pc. IBM Syst. J. 29(4), 526\u2013538 (1990). https:\/\/doi.org\/10.1147\/sj.294.0526","journal-title":"IBM Syst. J."},{"key":"10_CR8","unstructured":"Crypto, P.A.: Timecop: automated dynamic analysis for timing side-channels. https:\/\/www.post-apocalyptic-crypto.org\/timecop\/"},{"key":"10_CR9","unstructured":"Granlund, T.: The GMP\u00a0development team: GNU MP: The GNU Multiple Precision Arithmetic Library. https:\/\/gmplib.org\/"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Hanyecz, O., Karenin, A., Kirshanova, E., Kutas, P., Schaeffler, S.: Constant time lattice reduction in dimension 4 with application to sqisign. IACR Trans. Cryptogr. Hardw. Embed. Syst. (2024). https:\/\/eprint.iacr.org\/2025\/027","DOI":"10.46586\/tches.v2025.i2.511-534"},{"key":"10_CR11","unstructured":"Jacquemin, D., Mukherjee, A., Kutas, P., ROY, S.S.: Ready to SQI? safety first! towards a constant-time implementation of isogeny-based signature, SQIsign. Cryptology ePrint Archive, Paper 2023\/807 (2023). https:\/\/eprint.iacr.org\/2023\/807"},{"key":"10_CR12","unstructured":"Jao, D., et al.: Sidh-spec (2022). https:\/\/sike.org\/files\/SIDH-spec.pdf"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/3-540-36400-5_22","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2002","author":"M Joye","year":"2003","unstructured":"Joye, M., Yen, S.-M.: The montgomery powering ladder. In: Kaliski, B.S., Ko\u00e7, K., Paar, C. (eds.) CHES 2002. LNCS, vol. 2523, pp. 291\u2013302. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36400-5_22"},{"key":"10_CR14","doi-asserted-by":"publisher","unstructured":"Korzilius, S., Schoenmakers, B.: Divisions and square roots with tight error analysis from newton\u2013raphson iteration in secure fixed-point arithmetic. Cryptography 7(3), 43 (2023). https:\/\/doi.org\/10.3390\/cryptography7030043","DOI":"10.3390\/cryptography7030043"},{"key":"10_CR15","unstructured":"Longa, P., Leroux, A.: sqisign-ec23 (2023). https:\/\/github.com\/SQISign\/sqisign-ec23"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Montgomery, P.L.: Modular multiplication without trial division. Math. Comput. 44(170), 519\u2013521 (1985). https:\/\/www.ams.org\/journals\/mcom\/1985-44-170\/S0025-5718-1985-0777282-X\/S0025-5718-1985-0777282-X.pdf","DOI":"10.1090\/S0025-5718-1985-0777282-X"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Montgomery, P.L.: Speeding the pollard and elliptic curve methods of factorization. Math. Comput. 48(177), 243\u2013264 (1987). https:\/\/wstein.org\/edu\/124\/misc\/montgomery.pdf","DOI":"10.1090\/S0025-5718-1987-0866113-7"},{"key":"10_CR18","unstructured":"National Institute for Standards and Technology (NIST): Post-quantum cryptography: Additional digital signature schemes. https:\/\/csrc.nist.gov\/projects\/pqc-dig-sig\/round-2-additional-signatures"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Seward, J., Nethercote, N., et\u00a0al.: Valgrind: a framework for heavyweight dynamic binary instrumentation. Website (2007). https:\/\/valgrind.org\/","DOI":"10.1145\/1250734.1250746"},{"issue":"5","key":"10_CR20","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484\u20131509 (1997)","journal-title":"SIAM J. Comput."},{"key":"10_CR21","doi-asserted-by":"publisher","unstructured":"Shor, P.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings 35th Annual Symposium on Foundations of Computer Science, pp. 124\u2013134 (1994). https:\/\/doi.org\/10.1109\/SFCS.1994.365700","DOI":"10.1109\/SFCS.1994.365700"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Voight, J.: Quaternion Algebras, Graduate Texts in Mathematics, vol.\u00a0288. Springer, Heidelberg (2021). https:\/\/library.oapen.org\/handle\/20.500.12657\/50018","DOI":"10.1007\/978-3-030-56694-4"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology - AFRICACRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-97260-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,7]],"date-time":"2025-09-07T07:24:31Z","timestamp":1757229871000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-97260-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,2]]},"ISBN":["9783031972591","9783031972607"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-97260-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,7,2]]},"assertion":[{"value":"2 July 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AFRICACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in Africa","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rabat","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","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":"21 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"africacrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/africacrypt2025.sciencesconf.org","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}