{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T14:46:04Z","timestamp":1776955564103,"version":"3.51.4"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030442224","type":"print"},{"value":"9783030442231","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","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":[[2020]]},"DOI":"10.1007\/978-3-030-44223-1_11","type":"book-chapter","created":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T23:04:06Z","timestamp":1586473446000},"page":"189-205","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":32,"title":["Defeating NewHope with a Single Trace"],"prefix":"10.1007","author":[{"given":"Dorian","family":"Amiet","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Curiger","sequence":"additional","affiliation":[]},{"given":"Lukas","family":"Leuenberger","sequence":"additional","affiliation":[]},{"given":"Paul","family":"Zbinden","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,10]]},"reference":[{"issue":"2","key":"11_CR1","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.M.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978). \nhttps:\/\/doi.org\/10.1145\/359340.359342","journal-title":"Commun. ACM"},{"issue":"5","key":"11_CR2","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484\u20131509 (1997). \nhttps:\/\/doi.org\/10.1137\/S0097539795293172","journal-title":"SIAM J. Comput."},{"issue":"3","key":"11_CR3","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/MSPEC.2019.8651931","volume":"56","author":"M Dyakonov","year":"2019","unstructured":"Dyakonov, M.: The case against quantum computing. IEEE Spectr. 56(3), 24\u201329 (2019)","journal-title":"IEEE Spectr."},{"issue":"5","key":"11_CR4","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1109\/MSP.2018.3761723","volume":"16","author":"M Mosca","year":"2018","unstructured":"Mosca, M.: Cybersecurity in an era with quantum computers: will we be ready? IEEE Secur. Priv. 16(5), 38\u201341 (2018). \nhttps:\/\/doi.org\/10.1109\/MSP.2018.3761723","journal-title":"IEEE Secur. Priv."},{"key":"11_CR5","unstructured":"National Institute of Standards and Technology: Submission requirements and evaluation criteria for the post-quantum cryptography standardization process (2016)"},{"key":"11_CR6","doi-asserted-by":"publisher","unstructured":"Alagic, G., et al.: Status report on the first round of the NIST post-quantum cryptography standardization process. NISTIR 8240 (2019). \nhttps:\/\/doi.org\/10.6028\/NIST.IR.8240","DOI":"10.6028\/NIST.IR.8240"},{"key":"11_CR7","unstructured":"Alkim, E., et al.: NewHope - algorithm specifications and supporting documentation. Version 1.02 (2019)"},{"key":"11_CR8","unstructured":"Alkim, E., Ducas, L., P\u00f6ppelmann, T., Schwabe, P.: NewHope without reconciliation. IACR Cryptology ePrint Archive, p. 1157 (2016). \nhttp:\/\/eprint.iacr.org\/2016\/1157"},{"key":"11_CR9","unstructured":"Alkim, E., Ducas, L., P\u00f6ppelmann, T., Schwabe, P.: Post-quantum key exchange - a new hope. In: 25th USENIX Security Symposium, USENIX Security 2016, Austin, TX, USA, 10\u201312 August 2016, pp. 327\u2013343 (2016)"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-13190-5_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"V Lyubashevsky","year":"2010","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 1\u201323. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-13190-5_1"},{"key":"11_CR11","doi-asserted-by":"publisher","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, 22\u201324 May 2005, pp. 84\u201393 (2005). \nhttps:\/\/doi.org\/10.1145\/1060590.1060603","DOI":"10.1145\/1060590.1060603"},{"key":"11_CR12","doi-asserted-by":"publisher","unstructured":"Regev, O.: The learning with errors problem (invited survey). In: Proceedings of the 25th Annual IEEE Conference on Computational Complexity, CCC 2010, Cambridge, Massachusetts, USA, 9\u201312 June 2010, pp. 191\u2013204 (2010). \nhttps:\/\/doi.org\/10.1109\/CCC.2010.26","DOI":"10.1109\/CCC.2010.26"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/3-540-68697-5_9","volume-title":"Advances in Cryptology \u2014 CRYPTO 1996","author":"PC Kocher","year":"1996","unstructured":"Kocher, P.C.: Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 104\u2013113. Springer, Heidelberg (1996). \nhttps:\/\/doi.org\/10.1007\/3-540-68697-5_9"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/3-540-48405-1_25","volume-title":"Advances in Cryptology \u2014 CRYPTO 1999","author":"P Kocher","year":"1999","unstructured":"Kocher, P., Jaffe, J., Jun, B.: Differential power analysis. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 388\u2013397. Springer, Heidelberg (1999). \nhttps:\/\/doi.org\/10.1007\/3-540-48405-1_25"},{"key":"11_CR15","doi-asserted-by":"publisher","unstructured":"Mulder, E.D., et al.: Electromagnetic analysis attack on an FPGA implementation of an elliptic curve cryptosystem. In: EUROCON 2005 - The International Conference on \u201cComputer as a Tool\u201d, vol. 2, pp. 1879\u20131882 (2005). \nhttps:\/\/doi.org\/10.1109\/EURCON.2005.1630348","DOI":"10.1109\/EURCON.2005.1630348"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/978-3-319-66787-4_25","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2017","author":"R Primas","year":"2017","unstructured":"Primas, R., Pessl, P., Mangard, S.: Single-trace side-channel attacks on masked lattice-based encryption. In: Fischer, W., Homma, N. (eds.) CHES 2017. LNCS, vol. 10529, pp. 513\u2013533. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-66787-4_25"},{"key":"11_CR17","doi-asserted-by":"publisher","unstructured":"Aysu, A., Tobah, Y., Tiwari, M., Gerstlauer, A., Orshansky, M.: Horizontal side-channel vulnerabilities of post-quantum key exchange protocols. In: 2018 IEEE International Symposium on Hardware Oriented Security and Trust, HOST 2018, Washington, DC, USA, 30 April\u20134 May 2018, pp. 81\u201388 (2018). \nhttps:\/\/doi.org\/10.1109\/HST.2018.8383894","DOI":"10.1109\/HST.2018.8383894"},{"key":"11_CR18","doi-asserted-by":"publisher","unstructured":"Bos, J.W., et al.: Frodo: take off the ring! practical, quantum-secure key exchange from LWE. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, Vienna, Austria, 24\u201328 October 2016, pp. 1006\u20131018 (2016). \nhttps:\/\/doi.org\/10.1145\/2976749.2978425","DOI":"10.1145\/2976749.2978425"},{"key":"11_CR19","doi-asserted-by":"publisher","unstructured":"Park, A., Han, D.: Chosen ciphertext simple power analysis on software 8-bit implementation of ring-LWE encryption. In: 2016 IEEE Asian Hardware-Oriented Security and Trust, AsianHOST 2016, Yilan, Taiwan, 19\u201320 December 2016, pp. 1\u20136 (2016). \nhttps:\/\/doi.org\/10.1109\/AsianHOST.2016.7835555","DOI":"10.1109\/AsianHOST.2016.7835555"},{"key":"11_CR20","unstructured":"Huang, W., Chen, J., Yang, B.: Correlation power analysis on NTRU prime and related countermeasures. IACR Cryptology ePrint Archive, p. 100 (2019). \nhttps:\/\/eprint.iacr.org\/2019\/100"},{"issue":"6\u20137","key":"11_CR21","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1016\/j.micpro.2013.04.008","volume":"37","author":"X Zheng","year":"2013","unstructured":"Zheng, X., Wang, A., Wei, W.: First-order collision attack on protected NTRU cryptosystem. Microprocess. Microsyst. Embed. Hardw. Design 37(6\u20137), 601\u2013609 (2013). \nhttps:\/\/doi.org\/10.1016\/j.micpro.2013.04.008","journal-title":"Microprocess. Microsyst. Embed. Hardw. Design"},{"issue":"2","key":"11_CR22","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s13389-016-0126-5","volume":"6","author":"O Reparaz","year":"2016","unstructured":"Reparaz, O., Roy, S.S., de Clercq, R., Vercauteren, F., Verbauwhede, I.: Masking ring-LWE. J. Cryptogr. Eng. 6(2), 139\u2013153 (2016). \nhttps:\/\/doi.org\/10.1007\/s13389-016-0126-5","journal-title":"J. Cryptogr. Eng."},{"key":"11_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-319-29360-8_15","volume-title":"Post-Quantum Cryptography","author":"O Reparaz","year":"2016","unstructured":"Reparaz, O., de Clercq, R., Roy, S.S., Vercauteren, F., Verbauwhede, I.: Additively homomorphic ring-LWE masking. In: Takagi, T. (ed.) PQCrypto 2016. LNCS, vol. 9606, pp. 233\u2013244. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-29360-8_15"},{"key":"11_CR24","doi-asserted-by":"publisher","unstructured":"Oder, T., Schneider, T., P\u00f6ppelmann, T., G\u00fcneysu, T.: Practical CCA2-secure and masked ring-LWE implementation. IACR Trans. Cryptogr. Hardw. Embed. Syst., 142\u2013174 (2018). \nhttps:\/\/doi.org\/10.13154\/tches.v2018.i1.142-174","DOI":"10.13154\/tches.v2018.i1.142-174"},{"key":"11_CR25","unstructured":"Fluhrer, S.R.: Cryptanalysis of ring-LWE based key exchange with key share reuse. IACR Cryptology ePrint Archive, p. 85 (2016). \nhttp:\/\/eprint.iacr.org\/2016\/085"},{"key":"11_CR26","doi-asserted-by":"publisher","unstructured":"Ding, J., Alsayigh, S., Saraswathy, R.V., Fluhrer, S.R., Lin, X.: Leakage of signal function with reused keys in RLWE key exchange. In: IEEE International Conference on Communications, ICC 2017, Paris, France, 21\u201325 May 2017, pp. 1\u20136 (2017). \nhttps:\/\/doi.org\/10.1109\/ICC.2017.7996806","DOI":"10.1109\/ICC.2017.7996806"},{"key":"11_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/978-3-030-12612-4_14","volume-title":"Topics in Cryptology \u2013 CT-RSA 2019","author":"A Bauer","year":"2019","unstructured":"Bauer, A., Gilbert, H., Renault, G., Rossi, M.: Assessment of the key-reuse resilience of NewHope. In: Matsui, M. (ed.) CT-RSA 2019. LNCS, vol. 11405, pp. 272\u2013292. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-12612-4_14"},{"key":"11_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1007\/978-3-030-29962-0_24","volume-title":"Computer Security \u2013 ESORICS 2019","author":"Y Qin","year":"2019","unstructured":"Qin, Y., Cheng, C., Ding, J.: A complete and optimized key mismatch attack on NIST candidate NewHope. In: Sako, K., Schneider, S., Ryan, P.Y.A. (eds.) ESORICS 2019, Part II. LNCS, vol. 11736, pp. 504\u2013520. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-29962-0_24"},{"key":"11_CR29","unstructured":"Avanzi, R., et al.: CRYSTALS-Kyber algorithm specifications and supporting documentation. Version 2.0 (2019)"},{"key":"11_CR30","unstructured":"Fisher, R.A., Yates, F., et al.: Statistical tables for biological, agricultural and medical research (1963). \nhttp:\/\/hdl.handle.net\/2440\/10701"},{"key":"11_CR31","doi-asserted-by":"publisher","unstructured":"Khalid, A., Oder, T., Valencia, F., O\u2019Neill, M., G\u00fcneysu, T., Regazzoni, F.: Physical protection of lattice-based cryptography: challenges and solutions. In: Proceedings of the 2018 on Great Lakes Symposium on VLSI, GLSVLSI 2018, Chicago, IL, USA, 23\u201325 May 2018, pp. 365\u2013370 (2018). \nhttps:\/\/doi.org\/10.1145\/3194554.3194616","DOI":"10.1145\/3194554.3194616"}],"container-title":["Lecture Notes in Computer Science","Post-Quantum Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-44223-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T23:14:29Z","timestamp":1586474069000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-44223-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030442224","9783030442231"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-44223-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"10 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PQCrypto","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Post-Quantum Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","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":"15 April 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 April 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pqcrypto2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pqcrypto2020.inria.fr\/","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":"86","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":"29","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":"34% - 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.5","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":"6","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)"}}]}}