{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T11:13:13Z","timestamp":1767611593782,"version":"3.44.0"},"publisher-location":"Cham","reference-count":57,"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_9","type":"book-chapter","created":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T05:20:52Z","timestamp":1752470452000},"page":"164-191","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["PMNS Arithmetic for\u00a0Elliptic Curve Cryptography"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4158-9176","authenticated-orcid":false,"given":"Fangan Yssouf","family":"Dosso","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3854-8253","authenticated-orcid":false,"given":"Sylvain","family":"Duquesne","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3840-584X","authenticated-orcid":false,"given":"Nadia","family":"El Mrabet","sequence":"additional","affiliation":[]},{"given":"Emma","family":"Gautier","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,7,2]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Bajard, J., Imbert, L., Plantard, T.: Arithmetic operations in the polynomial modular number system. In: 17th IEEE Symposium on Computer Arithmetic (ARITH-17 2005), 27\u201329 June 2005, pp. 206\u2013213 (2005)","DOI":"10.1109\/ARITH.2005.11"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-540-30564-4_11","volume-title":"Selected Areas in Cryptography","author":"J-C Bajard","year":"2004","unstructured":"Bajard, J.-C., Imbert, L., Plantard, T.: Modular number systems: beyond the mersenne family. In: Handschuh, H., Hasan, M.A. (eds.) SAC 2004. LNCS, vol. 3357, pp. 159\u2013169. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30564-4_11"},{"issue":"4","key":"9_CR3","doi-asserted-by":"publisher","first-page":"1298","DOI":"10.1007\/S00145-018-9280-5","volume":"32","author":"R Barbulescu","year":"2019","unstructured":"Barbulescu, R., Duquesne, S.: Updating key size estimations for pairings. J. Cryptol. 32(4), 1298\u20131336 (2019). https:\/\/doi.org\/10.1007\/S00145-018-9280-5","journal-title":"J. Cryptol."},{"key":"9_CR4","unstructured":"Barbulescu, R., El Mrabet, N., Ghammam, L.: A taxonomy of pairings, their security, their complexity. IACR Cryptol. ePrint Arch. 485 (2019). https:\/\/eprint.iacr.org\/2019\/485"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-540-24654-1_2","volume-title":"Selected Areas in Cryptography","author":"P Barreto","year":"2004","unstructured":"Barreto, P., Lynn, B., Scott, M.: On the selection of pairing-friendly groups. In: Matsui, M., Zuccherato, R.J. (eds.) SAC 2003. LNCS, vol. 3006, pp. 17\u201325. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24654-1_2"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/11693383_22","volume-title":"Selected Areas in Cryptography","author":"P Barreto","year":"2006","unstructured":"Barreto, P., Naehrig, M.: Pairing-friendly elliptic curves of prime order. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol. 3897, pp. 319\u2013331. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11693383_22"},{"key":"9_CR7","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":"9_CR8","unstructured":"Ben-Sasson, E., Chiesa, A., Tromer, E., Virza, M.: Succinct non-interactive zero knowledge for a von neumann architecture. In: Proceedings of the 23rd USENIX Conference on Security Symposium, SEC\u201914, , pp. 781\u2013796. USENIX Association (2014)"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s13389-012-0027-1","volume":"2","author":"DJ Bernstein","year":"2012","unstructured":"Bernstein, D.J., Duif, N., Lange, T., Schwabe, P., Yang, B.Y.: High-speed high-security signatures. J. Cryptogr. Eng. 2, 77\u201389 (2012). https:\/\/doi.org\/10.1007\/s13389-012-0027-1","journal-title":"J. Cryptogr. Eng."},{"key":"9_CR10","unstructured":"Bernstein, D.J., Lange, T.: Extended coordinates with a=-1 for twisted edwards curves. http:\/\/www.hyperelliptic.org\/EFD\/g1p\/auto-twisted-extended-1.html"},{"key":"9_CR11","unstructured":"Bernstein, D.J., Lange, T.: Explicit-formulas database for elliptic curve cryptography. https:\/\/hyperelliptic.org\/EFD"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/11745853_14","volume-title":"Public Key Cryptography - PKC 2006","author":"DJ Bernstein","year":"2006","unstructured":"Bernstein, D.J.: Curve25519: new diffie-hellman speed records. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.) PKC 2006. LNCS, vol. 3958, pp. 207\u2013228. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11745853_14"},{"key":"9_CR13","unstructured":"Bernstein, D.J., Lange, T.: Safecurves: choosing safe curves for elliptic-curve cryptography. https:\/\/safecurves.cr.yp.to"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-662-49301-4_17","volume-title":"The New Codebreakers","author":"DJ Bernstein","year":"2016","unstructured":"Bernstein, D.J., Lange, T., Niederhagen, R.: Dual EC: a standardized back door. In: Ryan, P., Naccache, D., Quisquater, J.-J. (eds.) The New Codebreakers. LNCS, vol. 9100, pp. 256\u2013281. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49301-4_17"},{"key":"9_CR15","unstructured":"Bonneau, J., Meckler, I., Rao, V., Shapiro, E.: Coda: Decentralized cryptocurrency at scale. Cryptology ePrint Archive, Paper 2020\/352 (2020). https:\/\/eprint.iacr.org\/2020\/352"},{"key":"9_CR16","unstructured":"Brainpool: Ecc brainpool standard curves and curve generation (2005). http:\/\/www.ecc-brainpool.org\/download\/Domain-parameters.pdf"},{"key":"9_CR17","unstructured":"Checkoway, S., et al.: On the practical exploitability of dual EC in TLS implementations. In: Fu, K., Jung, J. (eds.) Proceedings of the 23rd USENIX Security Symposium, San Diego, CA, USA, 20\u201322 August 2014, pp. 319\u2013335. USENIX Association (2014). https:\/\/www.usenix.org\/conference\/usenixsecurity14\/technical-sessions\/presentation\/checkoway"},{"key":"9_CR18","doi-asserted-by":"publisher","unstructured":"Costello, C., et al.: Geppetto: Versatile verifiable computation. In: 2015 IEEE Symposium on Security and Privacy, pp. 253\u2013270 (2015). https:\/\/doi.org\/10.1109\/SP.2015.23","DOI":"10.1109\/SP.2015.23"},{"key":"9_CR19","doi-asserted-by":"publisher","unstructured":"Didier, L., Dosso, F., El Mrabet, N., Marrez, J., V\u00e9ron, P.: Randomization of arithmetic over polynomial modular number system. In: 26th IEEE Symposium on Computer Arithmetic, ARITH 2019, pp. 199\u2013206 (2019). https:\/\/doi.org\/10.1109\/ARITH.2019.00048","DOI":"10.1109\/ARITH.2019.00048"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Didier, L.S., Dosso, F.Y., V\u00e9ron, P.: Efficient modular operations using the Adapted Modular Number System. J. Cryptogr. Eng., 1\u201323 (2020)","DOI":"10.1007\/s13389-019-00221-7"},{"key":"9_CR21","unstructured":"Dosso, F.Y., Berzati, A., El Mrabet, N., Proy, J.: PMNS revisited for consistent redundancy and equality test. Cryptology ePrint Archive, Paper 2023\/1231 (2023). https:\/\/eprint.iacr.org\/2023\/1231"},{"key":"9_CR22","unstructured":"Dosso, F.Y., El Mrabet, N., M\u00e9loni, N., Palma, F., V\u00e9ron, P.: Friendly primes for efficient modular arithmetic using the polynomial modular number system. Cryptology ePrint Archive, Paper 2025\/090 (2025). https:\/\/eprint.iacr.org\/2025\/090"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Dosso, F.Y., Robert, J.M., V\u00e9ron, P.: PMNS for efficient arithmetic and small memory cost. IEEE Trans. Emerg. Topics Comput. 10(3), 1263\u20131277 (2022). https:\/\/hal.science\/hal-03768546v1\/file\/TETC3187786.pdf","DOI":"10.1109\/TETC.2022.3187786"},{"key":"9_CR24","unstructured":"Dutta, R., Barua, R., Sarkar, P.: Pairing-based cryptographic protocols: a survey. IACR Cryptol. ePrint Arch. 64 (2004). http:\/\/eprint.iacr.org\/2004\/064"},{"key":"9_CR25","doi-asserted-by":"crossref","unstructured":"El Mrabet, N., Joye, M.: Guide to Pairing-Based Cryptography. Chapman & Hall\/CRC, Boca Raton (2016)","DOI":"10.1201\/9781315370170"},{"key":"9_CR26","unstructured":"Ethereum. https:\/\/ethereum.org\/en\/"},{"key":"9_CR27","unstructured":"Force, I.E.T.: Transport layer security. https:\/\/datatracker.ietf.org\/wg\/tls\/about\/"},{"issue":"2","key":"9_CR28","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/S00145-009-9048-Z","volume":"23","author":"D Freeman","year":"2010","unstructured":"Freeman, D., Scott, M., Teske, E.: A taxonomy of pairing-friendly elliptic curves. J. Cryptol. 23(2), 224\u2013280 (2010). https:\/\/doi.org\/10.1007\/S00145-009-9048-Z","journal-title":"J. Cryptol."},{"issue":"6","key":"9_CR29","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1109\/TEC.1959.5219515","volume":"8","author":"HL Garner","year":"1959","unstructured":"Garner, H.L.: The residue number system. IRE Trans. Electron. Comput. EL 8(6), 140\u2013147 (1959)","journal-title":"IRE Trans. Electron. Comput. EL"},{"key":"9_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1007\/978-3-642-38348-9_37","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"R Gennaro","year":"2013","unstructured":"Gennaro, R., Gentry, C., Parno, B., Raykova, M.: Quadratic span programs and succinct NIZKs without PCPs. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 626\u2013645. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_37"},{"key":"9_CR31","unstructured":"GMP: The GNU Multiple Precision Arithmetic library. https:\/\/gmplib.org"},{"key":"9_CR32","doi-asserted-by":"publisher","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM J. Comput. 18(1), 186\u2013208 (1989). https:\/\/doi.org\/10.1137\/0218012","DOI":"10.1137\/0218012"},{"key":"9_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/11935230_29","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2006","author":"J Groth","year":"2006","unstructured":"Groth, J.: Simulation-sound NIZK proofs for a practical language and constant size group signatures. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol. 4284, pp. 444\u2013459. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11935230_29"},{"key":"9_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-642-17373-8_19","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"J Groth","year":"2010","unstructured":"Groth, J.: Short pairing-based non-interactive zero-knowledge arguments. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 321\u2013340. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_19"},{"key":"9_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-662-49896-5_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"J Groth","year":"2016","unstructured":"Groth, J.: On the size of pairing-based non-interactive arguments. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 305\u2013326. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_11"},{"key":"9_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/11818175_6","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"J Groth","year":"2006","unstructured":"Groth, J., Ostrovsky, R., Sahai, A.: Non-interactive zaps and new techniques for NIZK. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 97\u2013111. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_6"},{"key":"9_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-540-78967-3_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"J Groth","year":"2008","unstructured":"Groth, J., Sahai, A.: Efficient non-interactive proof systems for bilinear groups. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 415\u2013432. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_24"},{"key":"9_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-540-89255-7_20","volume-title":"Advances in Cryptology - ASIACRYPT 2008","author":"H Hisil","year":"2008","unstructured":"Hisil, H., Wong, K.K.-H., Carter, G., Dawson, E.: Twisted edwards curves revisited. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol. 5350, pp. 326\u2013343. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-89255-7_20"},{"key":"9_CR39","first-page":"308","volume":"109","author":"WG Horner","year":"1819","unstructured":"Horner, W.G.: A new method of solving numerical equations of all orders, by continuous approximation. Phil. Trans. R. Soc. Lond. 109, 308\u2013335 (1819)","journal-title":"Phil. Trans. R. Soc. Lond."},{"key":"9_CR40","unstructured":"Software\u00a0Foundation Inc: OpenSSL Library. https:\/\/openssl.org"},{"key":"9_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-540-85538-5_9","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2008","author":"EJ Kachisa","year":"2008","unstructured":"Kachisa, E.J., Schaefer, E.F., Scott, M.: Constructing Brezing-Weng pairing-friendly elliptic curves using elements in the cyclotomic field. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol. 5209, pp. 126\u2013135. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85538-5_9"},{"key":"9_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/978-3-662-53018-4_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"T Kim","year":"2016","unstructured":"Kim, T., Barbulescu, R.: Extended tower number field sieve: a new complexity for the medium prime case. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9814, pp. 543\u2013571. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_20"},{"key":"9_CR43","unstructured":"Kosba, A.E., et al.: C\u00f8c\u00f8: A framework for building composable zero-knowledge proofs (2016). https:\/\/api.semanticscholar.org\/CorpusID:17760053"},{"key":"9_CR44","doi-asserted-by":"publisher","DOI":"10.1109\/TETC.2022.3190368","author":"N M\u00e9loni","year":"2022","unstructured":"M\u00e9loni, N.: An alternative approach to polynomial modular number system internal reduction. IEEE Trans. Emerg. Top. Comput. (2022). https:\/\/doi.org\/10.1109\/TETC.2022.3190368","journal-title":"IEEE Trans. Emerg. Top. Comput."},{"key":"9_CR45","doi-asserted-by":"publisher","unstructured":"Merkle, J., Lochter, M.: Elliptic Curve Cryptography (ECC) Brainpool Standard Curves and Curve Generation. RFC 5639 (2010). https:\/\/doi.org\/10.17487\/RFC5639. https:\/\/www.rfc-editor.org\/info\/rfc5639","DOI":"10.17487\/RFC5639"},{"issue":"170","key":"9_CR46","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"44","author":"P Montgomery","year":"1985","unstructured":"Montgomery, P.: Modular multiplication without trial division. Math. Comput. 44(170), 519\u2013521 (1985). https:\/\/doi.org\/10.1090\/S0025-5718-1985-0777282-X","journal-title":"Math. Comput."},{"key":"9_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-540-70500-0_34","volume-title":"Information Security and Privacy","author":"C Negre","year":"2008","unstructured":"Negre, C., Plantard, T.: Efficient modular arithmetic in adapted modular number system using lagrange representation. In: Mu, Y., Susilo, W., Seberry, J. (eds.) ACISP 2008. LNCS, vol. 5107, pp. 463\u2013477. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70500-0_34"},{"key":"9_CR48","unstructured":"NIST: The elliptic curve digital signature algorithm validation system. https:\/\/csrc.nist.gov\/presentations\/2004\/the-elliptic-curve-digital-signature-algorithm-val"},{"key":"9_CR49","unstructured":"NIST: Digital signature standard (dss), nist fips 186-4 (2009). http:\/\/nvlpubs.nist.gov\/nistpubs\/FIPS\/NIST.FIPS.186-4.pdf"},{"key":"9_CR50","doi-asserted-by":"crossref","unstructured":"Noyez, L., El Mrabet, N., Potin, O., V\u00e9ron, P.: Modular multiplication in the AMNS representation: hardware Implementation. In: Selected Areas in Cryptography, Montr\u00e9al (Qu\u00e9bec), France (2024)","DOI":"10.1007\/978-3-031-82841-6_11"},{"key":"9_CR51","unstructured":"Sakemi, Y., Kobayashi, T., Saito, T., Wahby, R.S.: Pairing-Friendly Curves. Internet-Draft draft-irtf-cfrg-pairing-friendly-curves-11, Internet Engineering Task Force (2022). https:\/\/datatracker.ietf.org\/doc\/draft-irtf-cfrg-pairing-friendly-curves\/11\/"},{"key":"9_CR52","unstructured":"Sch\u00fctze, T.: Requirements for standard elliptic curves position paper of the ecc brainpool (2014). https:\/\/api.semanticscholar.org\/CorpusID:16091050"},{"key":"9_CR53","doi-asserted-by":"publisher","unstructured":"Solinas, J.A.: Pseudo-Mersenne Prime, pp. 992\u2013992. Springer US, Boston (2011). https:\/\/doi.org\/10.1007\/978-1-4419-5906-5_42","DOI":"10.1007\/978-1-4419-5906-5_42"},{"key":"9_CR54","unstructured":"Stein, W., al.: Sagemath (2005). http:\/\/www.sagemath.org\/. Accessed 07 July 2022"},{"key":"9_CR55","unstructured":"Zcash: Rust implementation of the jubjub elliptic curve group. https:\/\/github.com\/zkcrypto\/jubjub\/tree\/main"},{"key":"9_CR56","unstructured":"Zcash: Zcash documentation. https:\/\/zcash.readthedocs.io\/en\/latest\/"},{"key":"9_CR57","unstructured":"ZcashTeam: Zk snark in zcash. https:\/\/z.cash"}],"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_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,7]],"date-time":"2025-09-07T07:28:21Z","timestamp":1757230101000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-97260-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,2]]},"ISBN":["9783031972591","9783031972607"],"references-count":57,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-97260-7_9","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"}}]}}