{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T04:09:15Z","timestamp":1780546155190,"version":"3.54.1"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031828409","type":"print"},{"value":"9783031828416","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-82841-6_11","type":"book-chapter","created":{"date-parts":[[2025,3,12]],"date-time":"2025-03-12T12:25:01Z","timestamp":1741782301000},"page":"269-293","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Modular Multiplication in\u00a0the\u00a0AMNS Representation: Hardware Implementation"],"prefix":"10.1007","author":[{"given":"Louis","family":"Noyez","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nadia","family":"El Mrabet","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Olivier","family":"Potin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pascal","family":"Veron","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,3,13]]},"reference":[{"key":"11_CR1","unstructured":"https:\/\/cyber.gouv.fr\/igca (2022)"},{"key":"11_CR2","unstructured":"https:\/\/community.teamviewer.com\/French\/discussion\/105303\/amelioration-de-la-securite-cle-rsa-passe-de-2048-bits-a-4096-bits (2023)"},{"key":"11_CR3","unstructured":"FIOS DSP Montgomery Multiplier (2024). https:\/\/github.com\/LOUISNOYEZ\/AMNS_MM"},{"issue":"6","key":"11_CR4","doi-asserted-by":"publisher","first-page":"2137","DOI":"10.1109\/TCSII.2020.3040665","volume":"68","author":"AAH Abd-Elkader","year":"2021","unstructured":"Abd-Elkader, A.A.H., Rashdan, M., Hasaneen, E.S.A.M., Hamed, H.F.A.: FPGA-based optimized design of montgomery modular multiplier. IEEE Trans. Circuits Syst. II Express Briefs 68(6), 2137\u20132141 (2021). https:\/\/doi.org\/10.1109\/TCSII.2020.3040665","journal-title":"IEEE Trans. Circuits Syst. II Express Briefs"},{"key":"11_CR5","doi-asserted-by":"publisher","unstructured":"Ahsan, J., Esmaeildoust, M., Kaabi, A., Zarei, V.: Efficient FPGA implementation of RNS montgomery multiplication using balanced RNS bases. Integration 84, 72\u201383 (2022). https:\/\/doi.org\/10.1016\/j.vlsi.2021.12.006. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0167926021001322","DOI":"10.1016\/j.vlsi.2021.12.006"},{"key":"11_CR6","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"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-030-03332-3_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"W Castryck","year":"2018","unstructured":"Castryck, W., Lange, T., Martindale, C., Panny, L., Renes, J.: CSIDH: an efficient post-quantum commutative group action. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11274, pp. 395\u2013427. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03332-3_15"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Chaouch, A., Didier, L.S., Dosso, F.Y., El Mrabet, N., Bouallegue, B., Ouni, B.: Two hardware implementations for modular multiplication in the AMNS: sequential and semi-parallel. J. Inf. Secur. Appl. 58, 102770 (2021). https:\/\/www.sciencedirect.com\/science\/article\/pii\/S2214212621000193","DOI":"10.1016\/j.jisa.2021.102770"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-540-24654-1_24","volume-title":"Selected Areas in Cryptography","author":"J Chung","year":"2004","unstructured":"Chung, J., Hasan, A.: More generalized Mersenne numbers. In: Matsui, M., Zuccherato, R.J. (eds.) SAC 2003. LNCS, vol. 3006, pp. 335\u2013347. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24654-1_24"},{"key":"11_CR10","doi-asserted-by":"publisher","unstructured":"Coladon, T., Elbaz-Vincent, P., Hugounenq, C.: MPHELL: a fast and robust library with unified and versatile arithmetics for elliptic curves cryptography. In: 2021 IEEE 28th Symposium on Computer Arithmetic (ARITH), pp. 78\u201385 (2021). https:\/\/doi.org\/10.1109\/ARITH51176.2021.00026","DOI":"10.1109\/ARITH51176.2021.00026"},{"key":"11_CR11","doi-asserted-by":"publisher","unstructured":"Dai, W., Chen, D.D., Cheung, R.C.C., Ko\u00e7, C.K.: Area-time efficient architecture of FFT-based Montgomery multiplication. IEEE Trans. Comput. 66(3), 375\u2013388 (2017). https:\/\/doi.org\/10.1109\/TC.2016.2601334","DOI":"10.1109\/TC.2016.2601334"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-030-64837-4_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"L De Feo","year":"2020","unstructured":"De Feo, L., Kohel, D., Leroux, A., Petit, C., Wesolowski, B.: SQISign: compact post-quantum signatures from quaternions and isogenies. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12491, pp. 64\u201393. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64837-4_3"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Didier, L.S., Dosso, F.Y., V\u00e9ron, P.: Efficient modular operations using the adapted modular number system. J. Cryptograph. Eng. 10(2), 111\u2013133 (2020). http:\/\/link.springer.com\/10.1007\/s13389-019-00221-7","DOI":"10.1007\/s13389-019-00221-7"},{"issue":"3","key":"11_CR14","doi-asserted-by":"publisher","first-page":"1263","DOI":"10.1109\/TETC.2022.3187786","volume":"10","author":"FY Dosso","year":"2022","unstructured":"Dosso, F.Y., Robert, J.M., V\u00e9ron, P.: PMNS for efficient arithmetic and small memory cost. IEEE Trans. Emerg. Top. Comput. 10(3), 1263\u20131277 (2022). https:\/\/doi.org\/10.1109\/TETC.2022.3187786","journal-title":"IEEE Trans. Emerg. Top. Comput."},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/3-540-46877-3_21","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201990","author":"SR Duss\u00e9","year":"1991","unstructured":"Duss\u00e9, S.R., Kaliski, B.S.: A cryptographic library for the Motorola DSP56000. In: Damg\u00e5rd, I.B. (ed.) EUROCRYPT 1990. LNCS, vol. 473, pp. 230\u2013244. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-46877-3_21"},{"issue":"7","key":"11_CR16","doi-asserted-by":"publisher","first-page":"923","DOI":"10.1109\/TC.2010.247","volume":"60","author":"M Huang","year":"2011","unstructured":"Huang, M., Gaj, K., El-Ghazawi, T.: New hardware architectures for Montgomery modular multiplication algorithm. IEEE Trans. Comput. 60(7), 923\u2013936 (2011). https:\/\/doi.org\/10.1109\/TC.2010.247","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"11_CR17","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/40.502403","volume":"16","author":"C Kaya Koc","year":"1996","unstructured":"Kaya Koc, C., Acar, T., Kaliski, B.: Analyzing and comparing Montgomery multiplication algorithms. IEEE Micro 16(3), 26\u201333 (1996). https:\/\/doi.org\/10.1109\/40.502403","journal-title":"IEEE Micro"},{"key":"11_CR18","doi-asserted-by":"publisher","unstructured":"Khan, S., Javeed, K., Shah, Y.A.: High-speed FPGA implementation of fullword Montgomery multiplier for ECC applications. Microprocess. Microsyst. 62, 91\u2013101 (2018). https:\/\/doi.org\/10.1016\/j.micpro.2018.07.005. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0141933117302843","DOI":"10.1016\/j.micpro.2018.07.005"},{"issue":"177","key":"11_CR19","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","volume":"48","author":"N Koblitz","year":"1987","unstructured":"Koblitz, N.: Elliptic curve cryptosystems. Math. Comput. 48(177), 203\u2013209 (1987)","journal-title":"Math. Comput."},{"key":"11_CR20","doi-asserted-by":"publisher","unstructured":"Liu, R., Li, S.: A design and implementation of Montgomery modular multiplier. In: 2019 IEEE International Symposium on Circuits and Systems (ISCAS), pp.\u00a01\u20134 (2019). https:\/\/doi.org\/10.1109\/ISCAS.2019.8702684","DOI":"10.1109\/ISCAS.2019.8702684"},{"key":"11_CR21","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"44","author":"PL Montgomery","year":"1985","unstructured":"Montgomery, P.L.: Modular multiplication without trial division. Math. Comput. 44, 519\u2013521 (1985)","journal-title":"Math. Comput."},{"key":"11_CR22","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":"11_CR23","doi-asserted-by":"crossref","unstructured":"Noyez, L., El Mrabet, N., Potin, O., Veron, P.: Montgomery multiplication scalable systolic designs optimized for DSP48e2. ACM Trans. Reconfigurable Technol. Syst. 17(1), 1\u201331 (2024). https:\/\/dl.acm.org\/doi\/10.1145\/3624571","DOI":"10.1145\/3624571"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978). https:\/\/doi.org\/10.1145\/359340.359342","DOI":"10.1145\/359340.359342"},{"key":"11_CR25","doi-asserted-by":"crossref","unstructured":"Solinas, J.: Pseudo-Mersenne prime. In: van Tilborg, H.C.A. (ed.) Encyclopedia of Cryptography and Security, pp. 482\u2013483. Springer, Boston (2005). https:\/\/doi.org\/10.1007\/0-387-23483-7_325","DOI":"10.1007\/0-387-23483-7_325"},{"key":"11_CR26","doi-asserted-by":"crossref","unstructured":"Solinas, J.A.: Generalized Mersenne prime. In: Van\u00a0Tilborg, H.C.A., Jajodia, S. (eds.) Encyclopedia of Cryptography and Security, pp. 509\u2013510. Springer, Boston (2011). http:\/\/link.springer.com\/10.1007\/978-1-4419-5906-5_32","DOI":"10.1007\/978-1-4419-5906-5_32"},{"key":"11_CR27","doi-asserted-by":"crossref","unstructured":"Tenca, A.F., Ko\u00e7, \u00c7.K.: A scalable architecture for Montgomery multiplication. In: Workshop on Cryptographic Hardware and Embedded Systems (1999)","DOI":"10.1007\/3-540-48059-5_10"},{"key":"11_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/3-540-44709-1_17","volume-title":"Cryptographic Hardware and Embedded Systems \u2014 CHES 2001","author":"AF Tenca","year":"2001","unstructured":"Tenca, A.F., Todorov, G., Ko\u00e7, \u00c7.K.: High-radix design of a scalable modular multiplier. In: Ko\u00e7, \u00c7.K., Naccache, D., Paar, C. (eds.) CHES 2001. LNCS, vol. 2162, pp. 185\u2013201. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44709-1_17"},{"issue":"6","key":"11_CR29","doi-asserted-by":"publisher","first-page":"1902","DOI":"10.1109\/TCSI.2020.2966755","volume":"67","author":"E \u00d6zt\u00fcrk","year":"2020","unstructured":"\u00d6zt\u00fcrk, E.: Design and implementation of a low-latency modular multiplication algorithm. IEEE Trans. Circuits Syst. I Regul. Pap. 67(6), 1902\u20131911 (2020). https:\/\/doi.org\/10.1109\/TCSI.2020.2966755","journal-title":"IEEE Trans. Circuits Syst. I Regul. Pap."}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography \u2013 SAC 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-82841-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,12]],"date-time":"2025-03-12T12:25:07Z","timestamp":1741782307000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-82841-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031828409","9783031828416"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-82841-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"13 March 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Selected Areas in Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montreal, QC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sacrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sacworkshop.org\/SAC24\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}