{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:16:31Z","timestamp":1742984191785,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030305291"},{"type":"electronic","value":"9783030305307"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-30530-7_6","type":"book-chapter","created":{"date-parts":[[2019,9,9]],"date-time":"2019-09-09T13:03:55Z","timestamp":1568034235000},"page":"109-129","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Don\u2019t Forget Your Roots: Constant-Time Root Finding over $$\\mathbb {F}_{2^m}$$"],"prefix":"10.1007","author":[{"given":"Douglas","family":"Martins","sequence":"first","affiliation":[]},{"given":"Gustavo","family":"Banegas","sequence":"additional","affiliation":[]},{"given":"Ricardo","family":"Cust\u00f3dio","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,9]]},"reference":[{"issue":"4","key":"6_CR1","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1515\/jmc-2018-0027","volume":"12","author":"G Banegas","year":"2018","unstructured":"Banegas, G., et al.: DAGS: key encapsulation using dyadic GS codes. J. Math. Cryptol. 12(4), 221\u2013239 (2018)","journal-title":"J. Math. Cryptol."},{"key":"6_CR2","unstructured":"Bardet, M., et al.: BIG QUAKE BInary Goppa QUAsi-cyclic Key Encapsulation, Technical report, National Institute of Standards and Technology (NIST) (2017)"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Berlekamp, E.: Algebraic Coding Theory. World Scientific (2015)","DOI":"10.1142\/9407"},{"issue":"111","key":"6_CR4","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1090\/S0025-5718-1970-0276200-X","volume":"24","author":"ER Berlekamp","year":"1970","unstructured":"Berlekamp, E.R.: Factoring polynomials over large finite fields. Math. Comput. 24(111), 713\u2013735 (1970)","journal-title":"Math. Comput."},{"key":"6_CR5","unstructured":"Bernstein, D.J.: Cache-timing attacks on AES (2005). https:\/\/cr.yp.to\/antiforgery\/cachetiming-20050414.pdf"},{"key":"6_CR6","unstructured":"Bernstein, D.J., Persichetti, E.: Towards KEM unification. Cryptology ePrint Archive, Report 2018\/526 (2018). https:\/\/eprint.iacr.org\/2018\/526"},{"key":"6_CR7","unstructured":"Biswas, B., Sendrier, N.: HyMES - an open source implementation of the McEliece cryptosystem (2008). http:\/\/www-rocq.inria.fr\/secret\/CBCrypto\/index.php?pg=hyme"},{"key":"6_CR8","unstructured":"Black, P.E.: Fisher-Yates shuffle. In: Dictionary Algorithms Data Structures. https:\/\/xlinux.nist.gov\/dads\/HTML\/fisherYatesShuffle.html. Accessed 23 Aug 2019"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-662-53140-2_16","volume-title":"Lecture Notes in Computer Science","author":"Leon Groot Bruinderink","year":"2016","unstructured":"Bruinderink, L.G., H\u00fclsing, A., Lange, T., Yarom, Y.: Flush, gauss, and reload - a cache attack on the BLISS lattice-based signature scheme. In: Proceedings of the 18th International Conference Cryptographic Hardware and Embedded Systems - CHES 2016, Santa Barbara, CA, USA, 17\u201319 August 2016, pp. 323\u2013345 (2016). https:\/\/doi.org\/10.1007\/978-3-662-53140-2_16"},{"issue":"1","key":"6_CR10","doi-asserted-by":"publisher","first-page":"7","DOI":"10.15837\/ijccc.2017.1.2780","volume":"12","author":"D Bucerzan","year":"2017","unstructured":"Bucerzan, D., Cayrel, P.L., Dra\u011foi, V., Richmond, T.: Improved timing attacks against the secret permutation in the McEliece PKC. Int. J. Comput. Commun. Control 12(1), 7\u201325 (2017)","journal-title":"Int. J. Comput. Commun. Control"},{"issue":"5","key":"6_CR11","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1109\/18.21214","volume":"34","author":"B Chor","year":"1988","unstructured":"Chor, B., Rivest, R.L.: A knapsack-type public key cryptosystem based on arithmetic in finite fields. IEEE Trans. Inf. Theor. 34(5), 901\u2013909 (1988)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-319-66787-4_11","volume-title":"Lecture Notes in Computer Science","author":"Tung Chou","year":"2017","unstructured":"Chou, T.: McBits revisited. In: Proceedings of the 19th International Conference on Cryptographic Hardware and Embedded Systems - CHES 2017, Taipei, Taiwan, 25\u201328 September 2017, pp. 213\u2013231 (2017). https:\/\/doi.org\/10.1007\/978-3-319-66787-4_11"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-319-55227-9_9","volume-title":"Arithmetic of Finite Fields","author":"JH Davenport","year":"2016","unstructured":"Davenport, J.H., Petit, C., Pring, B.: A generalised successive resultants algorithm. In: Duquesne, S., Petkova-Nikova, S. (eds.) WAIFI 2016. LNCS, vol. 10064, pp. 105\u2013124. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-55227-9_9"},{"issue":"11","key":"6_CR14","doi-asserted-by":"publisher","first-page":"1709","DOI":"10.1109\/TCOMM.2002.805269","volume":"50","author":"SV Fedorenko","year":"2002","unstructured":"Fedorenko, S.V., Trifonov, P.V.: Finding roots of polynomials over finite fields. IEEE Trans. Commun. 50(11), 1709\u20131711 (2002)","journal-title":"IEEE Trans. Commun."},{"key":"6_CR15","first-page":"114","volume":"44","author":"RJ McEliece","year":"1978","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. Deep Space Netw. Prog. Rep. 44, 114\u2013116 (1978)","journal-title":"Deep Space Netw. Prog. Rep."},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-642-05445-7_24","volume-title":"Selected Areas in Cryptography","author":"Rafael Misoczki","year":"2009","unstructured":"Misoczki, R., Barreto, P.S.L.M.: Compact McEliece keys from Goppa codes. In: 16th Annual International Workshop on Selected Areas in Cryptography, SAC 2009, Calgary, Alberta, Canada, August 13\u201314, 2009, Revised Selected Papers, pp. 376\u2013392 (2009). https:\/\/doi.org\/10.1007\/978-3-642-05445-7_24"},{"issue":"2","key":"6_CR17","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1109\/TIT.1975.1055350","volume":"21","author":"N Patterson","year":"1975","unstructured":"Patterson, N.: The algebraic decoding of Goppa codes. IEEE Trans. Inf. Theor. 21(2), 203\u2013207 (1975)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"6_CR18","unstructured":"Petit, C.: Finding roots in GF$$(p^n)$$ with the successive resultant algorithm. IACR Cryptology ePrint Archive 2014, 506 (2014)"},{"issue":"4","key":"6_CR19","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1137\/S0036144595295272","volume":"39","author":"C Savage","year":"1997","unstructured":"Savage, C.: A survey of combinatorial Gray codes. SIAM Rev. 39(4), 605\u2013629 (1997)","journal-title":"SIAM Rev."},{"key":"6_CR20","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-642-14423-3_12","volume-title":"Information, Security and Cryptology \u2013 ICISC 2009","author":"Abdulhadi Shoufan","year":"2010","unstructured":"Shoufan, A., Strenzke, F., Molter, H.G., St\u00f6ttinger, M.: A timing attack against Patterson algorithm in the McEliece PKC. In: 12th International Conference on Information, Security and Cryptology - ICISC 2009, Seoul, Korea, 2\u20134 December 2009, Revised Selected Papers, pp. 161\u2013175 (2009). https:\/\/doi.org\/10.1007\/978-3-642-14423-3_12"},{"key":"6_CR21","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/978-3-642-35404-5_18","volume-title":"Cryptology and Network Security","author":"Falko Strenzke","year":"2012","unstructured":"Strenzke, F.: Fast and secure root finding for code-based cryptosystems. In: Proceedings of the 11th International Conference on Cryptology and Network Security, CANS 2012, Darmstadt, Germany, 12\u201314 December 2012, pp. 232\u2013246 (2012). https:\/\/doi.org\/10.1007\/978-3-642-35404-5_18"},{"key":"6_CR22","unstructured":"Strenzke, F.: Efficiency and implementation security of code-based cryptosystems. Ph.D. thesis, Technische Universit\u00e4t (2013)"},{"key":"6_CR23","unstructured":"The Sage Developers: SageMath, the Sage Mathematics Software System (Version 8.7) (2019). https:\/\/www.sagemath.org"},{"issue":"5","key":"6_CR24","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1109\/26.923801","volume":"49","author":"TK Truong","year":"2001","unstructured":"Truong, T.K., Jeng, J.H., Reed, I.S.: Fast algorithm for computing the roots of error locator polynomials up to degree 11 in Reed-Solomon decoders. IEEE Trans. Commun. 49(5), 779\u2013783 (2001)","journal-title":"IEEE Trans. Commun."},{"key":"6_CR25","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-319-79063-3_4","volume-title":"Post-Quantum Cryptography","author":"Wen Wang","year":"2018","unstructured":"Wang, W., Szefer, J., Niederhagen, R.: FPGA-based Niederreiter cryptosystem using binary Goppa codes. In: Proceedings of the 9th International Conference Post-Quantum Cryptography, PQCrypto 2018, Fort Lauderdale, FL, USA, 9\u201311 April 2018, pp. 77\u201398 (2018). https:\/\/doi.org\/10.1007\/978-3-319-79063-3_4"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 LATINCRYPT 2019"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30530-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,23]],"date-time":"2024-07-23T00:02:45Z","timestamp":1721692965000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-30530-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030305291","9783030305307"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30530-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"9 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATINCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology and Information Security in Latin America","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santiago de Chile","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chile","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 October 2019","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":"latincrypt2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/latincrypt2019.cryptojedi.org\/index.shtml","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"WebSubRev","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40","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":"18","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":"0","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":"45% - 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.35","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":"3.35","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}