{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T15:51:17Z","timestamp":1774367477531,"version":"3.50.1"},"reference-count":24,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Emerg. Topics Comput."],"published-print":{"date-parts":[[2022,10,1]]},"DOI":"10.1109\/tetc.2021.3138951","type":"journal-article","created":{"date-parts":[[2022,1,5]],"date-time":"2022-01-05T20:35:41Z","timestamp":1641414941000},"page":"1955-1965","source":"Crossref","is-referenced-by-count":2,"title":["Tight Bound on NewHope Failure Probability"],"prefix":"10.1109","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2521-2520","authenticated-orcid":false,"given":"Thomas","family":"Plantard","sequence":"first","affiliation":[{"name":"Institute of Cybersecurity and Cryptology, University of Wollongong, Wollongong, NSW, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1048-4822","authenticated-orcid":false,"given":"Arnaud","family":"Sipasseuth","sequence":"additional","affiliation":[{"name":"Information Security Laboratory, KDDI Research, Inc., Fujimino, Saitama, Japan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1562-5105","authenticated-orcid":false,"given":"Willy","family":"Susilo","sequence":"additional","affiliation":[{"name":"Institute of Cybersecurity and Cryptology, University of Wollongong, Wollongong, NSW, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7487-6986","authenticated-orcid":false,"given":"Vincent","family":"Zucca","sequence":"additional","affiliation":[{"name":"DALI, Université de Perpignan Via Domitia, Perpignan, France"}]}],"member":"263","reference":[{"key":"ref10","first-page":"237","article-title":"Compact and simple RLWE based key encapsulation mechanism","author":"alk?m","year":"2019","journal-title":"Proc 6th Int Conf Inf Secur Cryptol"},{"key":"ref11","article-title":"When NTT meets Karatsuba: Preprocess-then-NTT technique revisited","author":"zhu","year":"2019"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSP.2018.00032"},{"key":"ref13","author":"roberto","year":"2019","journal-title":"CRYSTALS-Kyber (Version 2 0) — Submission to Round 2 of the NIST Post-Quantum Project"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.2307\/2007970"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2977607"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38348-9_3"},{"key":"ref17","author":"granlund","year":"2015","journal-title":"GNU MP The GNU Multiple Precision Arithmetic Library"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1236463.1236468"},{"key":"ref19","author":"alkim","year":"2018","journal-title":"Algorithm Specification and Supporting Documentation"},{"key":"ref4","first-page":"327","article-title":"Post-quantum key exchange—A new hope","author":"alkim","year":"2016","journal-title":"Proc 25th USENIX Secur Symp"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-014-9938-4"},{"key":"ref6","article-title":"Newhope without reconciliation","author":"alkim","year":"2016"},{"key":"ref5","article-title":"Faster AVX2 optimized NTT multiplication for Ring-LWE lattice cryptography","author":"seiler","year":"2018"},{"key":"ref8","first-page":"117","article-title":"Preprocess-then-NTT technique and its applications to KYBER and NEWHOPE","author":"zhou","year":"2018","journal-title":"Proc Int Conf Inf Secur Cryptol"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/800205.806332"},{"key":"ref2","first-page":"1","article-title":"On ideal lattices and learning with errors over rings","author":"lyubashevsky","year":"2010","journal-title":"Proc Annu Int Conf Theory Appl Cryptogr Techn"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060603"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.46586\/tches.v2019.i3.180-201"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17259-6_19"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08344-5_21"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-31517-1_2"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-89339-6_16"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-56614-6_4"}],"container-title":["IEEE Transactions on Emerging Topics in Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6245516\/9970409\/09670685.pdf?arnumber=9670685","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,26]],"date-time":"2022-12-26T19:13:50Z","timestamp":1672082030000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9670685\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,1]]},"references-count":24,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tetc.2021.3138951","relation":{},"ISSN":["2168-6750","2376-4562"],"issn-type":[{"value":"2168-6750","type":"electronic"},{"value":"2376-4562","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,1]]}}}