{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:41:36Z","timestamp":1742913696487,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"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_2","type":"book-chapter","created":{"date-parts":[[2019,9,9]],"date-time":"2019-09-09T13:03:55Z","timestamp":1568034235000},"page":"24-39","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Breaking Randomized Mixed-Radix Scalar Multiplication Algorithms"],"prefix":"10.1007","author":[{"given":"J\u00e9r\u00e9mie","family":"Detrey","sequence":"first","affiliation":[]},{"given":"Laurent","family":"Imbert","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,9]]},"reference":[{"key":"2_CR1","unstructured":"Bernstein, D.J.: Differential addition chains (2006). https:\/\/cr.yp.to\/ecdh\/diffchain-20060219.pdf"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Lange, T.: Topics in computational number theory inspired by Peter L. Montgomery, Chap. Montgomery Curves and the Montgomery Ladder, pp. 82\u2013115. Cambridge University Press (2017). https:\/\/eprint.iacr.org\/2017\/293","DOI":"10.1017\/9781316271575.005"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-540-39927-8_32","volume-title":"Information and Communications Security","author":"M Ciet","year":"2003","unstructured":"Ciet, M., Joye, M.: (Virtually) free randomization techniques for elliptic curve cryptography. In: Qing, S., Gollmann, D., Zhou, J. (eds.) ICICS 2003. LNCS, vol. 2836, pp. 348\u2013359. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39927-8_32"},{"issue":"1","key":"2_CR4","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s10623-006-9014-9","volume":"42","author":"N Ebeid","year":"2007","unstructured":"Ebeid, N., Hasan, M.A.: On binary signed digit representations of integers. Des. Codes Crypt. 42(1), 43\u201365 (2007)","journal-title":"Des. Codes Crypt."},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-540-28632-5_23","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2004","author":"P-A Fouque","year":"2004","unstructured":"Fouque, P.-A., Muller, F., Poupard, G., Valette, F.: Defeating countermeasures based on randomized BSD representations. In: Joye, M., Quisquater, J.-J. (eds.) CHES 2004. LNCS, vol. 3156, pp. 312\u2013327. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28632-5_23"},{"issue":"6","key":"2_CR6","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/773473.178249","volume":"29","author":"Torbj\u00f6rn Granlund","year":"1994","unstructured":"Granlund, T., Montgomery, P.L.: Division by invariant integers using multiplication. In: Proceedings of the ACM SIGPLAN 1994 Conference on Programming Language Design and Implementation (PLDI 1994). ACM SIGPLAN Notices, vol. 29, pp. 61\u201372. ACM (1994)","journal-title":"ACM SIGPLAN Notices"},{"issue":"3","key":"2_CR7","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1109\/TC.2017.2750677","volume":"67","author":"E Guerrini","year":"2017","unstructured":"Guerrini, E., Imbert, L., Winterhalter, T.: Randomized mixed-radix scalar multiplication. IEEE Trans. Comput. 67(3), 418\u2013431 (2017). https:\/\/doi.org\/10.1109\/TC.2017.2750677","journal-title":"IEEE Trans. Comput."},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/3-540-36400-5_40","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2002","author":"J Cheol Ha","year":"2003","unstructured":"Cheol Ha, J., Jae Moon, S.: Randomized signed-scalar multiplication of ECC to resist power attacks. In: Kaliski, B.S., Ko\u00e7, K., Paar, C. (eds.) CHES 2002. LNCS, vol. 2523, pp. 551\u2013563. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36400-5_40"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-540-45238-6_3","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2003","author":"C Karlof","year":"2003","unstructured":"Karlof, C., Wagner, D.: Hidden Markov model cryptanalysis. In: Walter, C.D., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2003. LNCS, vol. 2779, pp. 17\u201334. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45238-6_3"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"M\u00e9loni, N., Hasan, M.A.: Random digit representation of integers. In: Proceedings of the 23rd IEEE Symposium on Computer Arithmetic, ARITH23, pp. 118\u2013125. IEEE Computer Society (2016)","DOI":"10.1109\/ARITH.2016.11"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/3-540-44709-1_5","volume-title":"Cryptographic Hardware and Embedded Systems \u2014 CHES 2001","author":"E Oswald","year":"2001","unstructured":"Oswald, E., Aigner, M.: Randomized addition-subtraction chains as a countermeasure against power attacks. In: Ko\u00e7, \u00c7.K., Naccache, D., Paar, C. (eds.) CHES 2001. LNCS, vol. 2162, pp. 39\u201350. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44709-1_5"},{"key":"2_CR12","first-page":"806","volume":"70","author":"EG Strauss","year":"1964","unstructured":"Strauss, E.G.: Addition chains of vectors (problem 5125). Am. Math. Mon. 70, 806\u2013808 (1964)","journal-title":"Am. Math. Mon."}],"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_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,23]],"date-time":"2024-07-23T00:02:49Z","timestamp":1721692969000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-30530-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030305291","9783030305307"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30530-7_2","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"}]}}