{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,13]],"date-time":"2026-10-13T18:00:12Z","timestamp":1791914412723,"version":"4.3.4"},"publisher-location":"New York, NY, USA","reference-count":73,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,10,30]],"date-time":"2020-10-30T00:00:00Z","timestamp":1604016000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Horizon 2020","award":["803096"],"award-info":[{"award-number":["803096"]}]},{"name":"Australian Research Council Discovery Early Career Researcher Award","award":["DE200101577"],"award-info":[{"award-number":["DE200101577"]}]},{"name":"Carlsberg Foundation","award":["CF18-112"],"award-info":[{"award-number":["CF18-112"]}]},{"name":"Danish Independent Research Counci","award":["DFF-6108-00169"],"award-info":[{"award-number":["DFF-6108-00169"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,10,30]]},"DOI":"10.1145\/3372297.3417268","type":"proceedings-article","created":{"date-parts":[[2020,11,2]],"date-time":"2020-11-02T13:27:02Z","timestamp":1604323622000},"page":"225-242","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":64,"title":["LadderLeak: Breaking ECDSA with Less than One Bit of Nonce Leakage"],"prefix":"10.1145","author":[{"given":"Diego F.","family":"Aranha","sequence":"first","affiliation":[{"name":"Aarhus University, Aarhus, Denmark"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Felipe Rodrigues","family":"Novaes","sequence":"additional","affiliation":[{"name":"University of Campinas, Campinas, Brazil"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Akira","family":"Takahashi","sequence":"additional","affiliation":[{"name":"Aarhus University, Aarhus, Denmark"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mehdi","family":"Tibouchi","sequence":"additional","affiliation":[{"name":"NTT Corporation, Tokyo, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuval","family":"Yarom","sequence":"additional","affiliation":[{"name":"University of Adelaide & Data61, Adelaide, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,11,2]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"New Results on Instruction Cache Attacks. In CHES 2010 (LNCS","volume":"124","author":"Onur Aciic","year":"2010"},{"key":"e_1_3_2_2_2_1","volume-title":"New Branch Prediction Vulnerabilities in OpenSSL and Necessary Software Countermeasures. In 11th IMA International Conference on Cryptography and Coding (LNCS","volume":"203","author":"Onur Aciic","year":"2007"},{"key":"e_1_3_2_2_3_1","volume-title":"Cheap Hardware Parallelism Implies Cheap Security. In Fourth International Workshop on Fault Diagnosis and Tolerance in Cryptography","author":"Onur"},{"key":"e_1_3_2_2_4_1","volume-title":"Katrina E. Falkner, Joop van de Pol, and Yuval Yarom.","author":"Allan Thomas","year":"2016"},{"key":"e_1_3_2_2_5_1","unstructured":"D. F. Aranha etalmbox. [n.d.]. RELIC is an Efficient LIbrary for Cryptography . https:\/\/github.com\/relic-toolkit\/relic .  D. F. Aranha et almbox. [n.d.]. RELIC is an Efficient LIbrary for Cryptography . https:\/\/github.com\/relic-toolkit\/relic ."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45611-8_14"},{"key":"e_1_3_2_2_7_1","volume-title":"Improved Generic Algorithms for Hard Knapsacks. In EUROCRYPT 2011 (LNCS","volume":"385","author":"Becker Anja","year":"2011"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-29485-8_14"},{"key":"e_1_3_2_2_9_1","volume-title":"Long Way. In CHES 2014 (LNCS","volume":"92","author":"Benger Naomi"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-66787-4_27"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13389-012-0027-1"},{"key":"e_1_3_2_2_12_1","volume-title":"Faster Addition and Doubling on Elliptic Curves. In ASIACRYPT 2007 (LNCS","volume":"50","author":"Daniel"},{"key":"e_1_3_2_2_13_1","unstructured":"Daniel Bleichenbacher. 2000. On the generation of one-time keys in DL signature schemes. Presentation at IEEE P1363 working group meeting.  Daniel Bleichenbacher. 2000. On the generation of one-time keys in DL signature schemes. Presentation at IEEE P1363 working group meeting."},{"key":"e_1_3_2_2_14_1","volume-title":"Experiments with DSA . Rump session at CRYPTO","author":"Bleichenbacher Daniel","year":"2005"},{"key":"e_1_3_2_2_15_1","volume-title":"Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes. In CRYPTO'96 (LNCS","volume":"142","author":"Boneh Dan","year":"1996"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-03326-2_17"},{"key":"e_1_3_2_2_17_1","volume-title":"Remote Timing Attacks Are Still Practical. In ESORICS 2011 (LNCS","volume":"371","author":"Brumley Billy Bob","year":"2011"},{"key":"e_1_3_2_2_18_1","volume-title":"Port Contention for Fun and Profit. In 2019 IEEE Symposium on Security and Privacy . IEEE Computer Society Press, 870--887","author":"Aldaya Alejandro Cabrera","year":"2019"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.46586\/tches.v2020.i3.428-453"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48059-5_25"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13389-017-0157-6"},{"key":"e_1_3_2_2_22_1","volume-title":"Thomas Eisenbarth, Daniel Genkin, Nadia Heninger, Ahmad Moghimi, and Yuval Yarom.","author":"Dall Fergus","year":"2018"},{"key":"e_1_3_2_2_23_1","volume-title":"CHES 2013 (LNCS","volume":"452","author":"Mulder Elke De","year":"2013"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13389-014-0072-z"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-018-00594-6"},{"key":"e_1_3_2_2_26_1","first-page":"2","article-title":"High-speed Curve25519 on 8-bit, 16-bit, and 32-bit microcontrollers","volume":"77","author":"Michael D\u00fc","year":"2015","journal-title":"Des. Codes Cryptogr."},{"key":"e_1_3_2_2_27_1","volume-title":"C\u00e9 dric Murdica, and David Naccache","author":"Fouque Pierre-Alain","year":"2016"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2004.840301"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13389-016-0141-6"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978353"},{"key":"e_1_3_2_2_31_1","volume-title":"USENIX Security 2018 ,","author":"Gras Ben"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53140-2_16"},{"key":"e_1_3_2_2_33_1","volume-title":"USENIX Security","author":"Gruss Daniel","year":"2015"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2011.22"},{"key":"e_1_3_2_2_35_1","volume-title":"New Generic Algorithms for Hard Knapsacks. In EUROCRYPT 2010 (LNCS","volume":"256","author":"Howgrave-Graham Nick","year":"2010"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011214926272"},{"key":"e_1_3_2_2_37_1","volume-title":"Thomas Eisenbarth, and Berk Sunar.","author":"Apecechea Gorka Irazoqui","year":"2014"},{"key":"e_1_3_2_2_39_1","volume-title":"USENIX Security","author":"Lee Sangho","year":"2017"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.43"},{"key":"e_1_3_2_2_41_1","volume-title":"CT-RSA 2013 (LNCS","volume":"309","author":"Liu Mingjie"},{"key":"e_1_3_2_2_42_1","volume-title":"CHES'99 (LNCS","volume":"327","author":"L\u00f3pez-Hern\u00e1ndez Julio Cesar","year":"1999"},{"key":"e_1_3_2_2_43_1","volume-title":"WISA 08 (LNCS","author":"Medwed Marcel"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73074-3_15"},{"key":"e_1_3_2_2_45_1","volume-title":"TPM-FAIL: TPM meets Timing and Lattice Attacks. CoRR","author":"Moghimi Daniel","year":"2019"},{"key":"e_1_3_2_2_46_1","volume-title":"Speeding the Pollard and elliptic curve methods of factorization. Mathematics of computation","author":"Montgomery Peter L.","year":"1987"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-002-0021-3"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1025436905711"},{"key":"e_1_3_2_2_49_1","volume-title":"Nguyen and Mehdi Tibouchi","author":"Phong","year":"2012"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13389-017-0163-8"},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/11605805_1"},{"key":"e_1_3_2_2_52_1","volume-title":"USENIX Security 2017 ,","author":"Garc'ia Cesar Pereida"},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134023"},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49890-3_16"},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70697-9_10"},{"key":"e_1_3_2_2_56_1","volume-title":"is my code constant time?","author":"Reparaz Oscar"},{"key":"e_1_3_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.46586\/tches.v2019.i1.146-168"},{"key":"e_1_3_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3354197"},{"key":"e_1_3_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021317"},{"key":"e_1_3_2_2_60_1","volume-title":"Efficient Identification and Signatures for Smart Cards. In CRYPTO'89 (LNCS","volume":"252","author":"Schnorr Claus-Peter","year":"1990"},{"key":"e_1_3_2_2_61_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-35423-7_19"},{"key":"e_1_3_2_2_62_1","volume-title":"CARDIS (Lecture Notes in Computer Science","volume":"173","author":"Susella Ruggero","year":"2016"},{"key":"e_1_3_2_2_63_1","unstructured":"Akira Takahashi and Mehdi Tibouchi. 2018. New Bleichenbacher Records: Parallel Implementation. https:\/\/github.com\/security-kouza\/new-bleichenbacher-records .  Akira Takahashi and Mehdi Tibouchi. 2018. New Bleichenbacher Records: Parallel Implementation. https:\/\/github.com\/security-kouza\/new-bleichenbacher-records ."},{"key":"e_1_3_2_2_64_1","doi-asserted-by":"publisher","DOI":"10.46586\/tches.v2018.i3.331-371"},{"key":"e_1_3_2_2_65_1","unstructured":"The Sage Developers. YYYY. SageMath the Sage Mathematics Software System (Version x.y.z) . https:\/\/www.sagemath.org.  The Sage Developers. YYYY. SageMath the Sage Mathematics Software System (Version x.y.z) . https:\/\/www.sagemath.org."},{"key":"e_1_3_2_2_66_1","volume-title":"Cryptanalysis of Block Ciphers Implemented on Computers with Cache. In International Symposium on Information Theory and Its Applications .","author":"Tsunoo Yukiyasu","year":"2002"},{"key":"e_1_3_2_2_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/3274694.3274725"},{"key":"e_1_3_2_2_68_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-16715-2_1"},{"key":"e_1_3_2_2_69_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45708-9_19"},{"key":"e_1_3_2_2_70_1","volume-title":"USENIX Security 2020)","author":"Weiser Samuel"},{"key":"e_1_3_2_2_71_1","volume-title":"Cache Telepathy: Leveraging Shared Resource Attacks to Learn DNN Architectures. In USENIX Security","author":"Yan Mengjia","year":"2020"},{"key":"e_1_3_2_2_72_1","volume-title":"Mastik: A micro-architectural side-channel toolkit. Retrieved from School of Computer Science Adelaide: http:\/\/cs. adelaide. edu. au\/yval\/Mastik","author":"Yarom Yuval","year":"2016"},{"key":"e_1_3_2_2_73_1","unstructured":"Yuval Yarom and Katrina Falkner. 2014. FLUSH  Yuval Yarom and Katrina Falkner. 2014. FLUSH"},{"key":"e_1_3_2_2_74_1","volume-title":"Low Noise, L3 Cache Side-Channel Attack. In USENIX Security","author":"RELOAD","year":"2014"}],"event":{"name":"CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security","location":"Virtual Event USA","acronym":"CCS '20","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3372297.3417268","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3372297.3417268","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:01:31Z","timestamp":1750183291000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3372297.3417268"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,30]]},"references-count":73,"alternative-id":["10.1145\/3372297.3417268","10.1145\/3372297"],"URL":"https:\/\/doi.org\/10.1145\/3372297.3417268","relation":{},"subject":[],"published":{"date-parts":[[2020,10,30]]},"assertion":[{"value":"2020-11-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}