乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:52:26Z","timestamp":1742925146818,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030688684"},{"type":"electronic","value":"9783030688691"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-68869-1_4","type":"book-chapter","created":{"date-parts":[[2021,2,19]],"date-time":"2021-02-19T00:24:44Z","timestamp":1613694284000},"page":"75-91","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A HDL Generator for Flexible and Efficient Finite-Field Multipliers on FPGAs"],"prefix":"10.1007","author":[{"given":"Jo\u00ebl","family":"Cath\u00e9bras","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7990-9070","authenticated-orcid":false,"given":"Roselyne","family":"Chotin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,17]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","unstructured":"Bossuet, L., Gogniat, G., Philippe, J.L.: Exploration de l\u2019espace de conception des architectures reconfigurables. 25(7), 921\u2013946. https:\/\/doi.org\/10.3166\/tsi.25.921-946","DOI":"10.3166\/tsi.25.921-946"},{"key":"4_CR2","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference on ITCS 2012. ACM Press (2012). https:\/\/doi.org\/10.1145\/2090236.2090262","DOI":"10.1145\/2090236.2090262"},{"key":"4_CR3","unstructured":"Cath\u00e9bras, J., Chotin, R.: Finely Pipelined Modular Multiplier (FPMM). https:\/\/gitlab.lip6.fr\/roselyne\/fpmm\/. Accessed 12 Aug 2020"},{"key":"4_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-007-2987-2","volume-title":"Guide to FPGA Implementation of Arithmetic Functions","author":"JP Deschamps","year":"2012","unstructured":"Deschamps, J.P., Sutter, G.D., Cant\u00f3, E.: Guide to FPGA Implementation of Arithmetic Functions. Springer, Netherlands (2012). https:\/\/doi.org\/10.1007\/978-94-007-2987-2"},{"key":"4_CR5","doi-asserted-by":"publisher","unstructured":"Gallin, G., Tisserand, A.: Generation of finely-pipelined GF(P) multipliers for flexible curve based cryptography on FPGAs, pp. 1\u201312. https:\/\/doi.org\/10.1109\/TC.2019.2920352","DOI":"10.1109\/TC.2019.2920352"},{"key":"4_CR6","unstructured":"Gallin, G., Tisserand, A.: Hyper-Threaded Modular Multipliers (HTMM). https:\/\/sourcesup.renater.fr\/www\/htmm\/. Accessed 25 Feb 2020"},{"key":"4_CR7","doi-asserted-by":"publisher","unstructured":"Gallin, G., Tisserand, A.: Hyper-threaded multiplier for HECC. In: 2017 51st Asilomar Conference on Signals, Systems, and Computers. IEEE (2017). https:\/\/doi.org\/10.1109\/acssc.2017.8335378","DOI":"10.1109\/acssc.2017.8335378"},{"issue":"3","key":"4_CR8","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/40.502403","volume":"16","author":"CK Koc","year":"1996","unstructured":"Koc, C.K., 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":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/978-3-662-43414-7_21","volume-title":"Selected Areas in Cryptography \u2013 SAC 2013","author":"Y Ma","year":"2014","unstructured":"Ma, Y., Liu, Z., Pan, W., Jing, J.: A high-speed elliptic curve cryptographic processor for generic curves over GF$$(p)$$. In: Lange, T., Lauter, K., Lison\u011bk, P. (eds.) SAC 2013. LNCS, vol. 8282, pp. 421\u2013437. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43414-7_21"},{"issue":"170","key":"4_CR10","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(170), 519 (1985). https:\/\/doi.org\/10.1090\/s0025-5718-1985-0777282-x","journal-title":"Math. Comput."},{"issue":"3","key":"4_CR11","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1049\/iet-cdt.2015.0055","volume":"10","author":"M Morales-Sandoval","year":"2016","unstructured":"Morales-Sandoval, M., Diaz-Perez, A.: Scalable GF(P) montgomery multiplier based on a digit-digit computation approach. IET Comput. Digit. Tech. 10(3), 102\u2013109 (2016). https:\/\/doi.org\/10.1049\/iet-cdt.2015.0055","journal-title":"IET Comput. Digit. Tech."},{"issue":"3","key":"4_CR12","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s41635-017-0018-x","volume":"1","author":"A Mrabet","year":"2017","unstructured":"Mrabet, A., et al.: A scalable and systolic architectures of montgomery modular multiplication for public key cryptosystems based on DSPs. J. Hardw. Syst. Secur. 1(3), 219\u2013236 (2017). https:\/\/doi.org\/10.1007\/s41635-017-0018-x","journal-title":"J. Hardw. Syst. Secur."},{"issue":"1","key":"4_CR13","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1109\/mdat.2016.2626445","volume":"34","author":"AD Pimentel","year":"2016","unstructured":"Pimentel, A.D.: Exploring exploration: a tutorial introduction to embedded systems design space exploration. IEEE Des. Test 34(1), 77\u201390 (2016). https:\/\/doi.org\/10.1109\/mdat.2016.2626445","journal-title":"IEEE Des. Test"},{"issue":"21","key":"4_CR14","doi-asserted-by":"publisher","first-page":"1831","DOI":"10.1049\/el:19991230","volume":"35","author":"C Walter","year":"1999","unstructured":"Walter, C.: Montgomery exponentiation needs no final subtractions. Electron. Lett. 35(21), 1831 (1999). https:\/\/doi.org\/10.1049\/el:19991230","journal-title":"Electron. Lett."}],"container-title":["Lecture Notes in Computer Science","Arithmetic of Finite Fields"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-68869-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,19]],"date-time":"2021-02-19T00:27:22Z","timestamp":1613694442000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-68869-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030688684","9783030688691"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-68869-1_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"17 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAIFI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on the Arithmetic of Finite Fields","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rennes","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waifi2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/waifi.org","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"55% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1.4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}