{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T08:55:45Z","timestamp":1758704145080},"reference-count":16,"publisher":"Oxford University Press (OUP)","issue":"6","license":[{"start":{"date-parts":[[2022,2,19]],"date-time":"2022-02-19T00:00:00Z","timestamp":1645228800000},"content-version":"vor","delay-in-days":1,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,11,23]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>The latest advances in quantum computing forced the National Institute of Standards and Technology (NIST) to launch an initiative for selecting quantum-resistant cryptographic algorithms. One of the best-known proposals is NewHope, an algorithm that was initially designed as a key exchange algorithm. In its original design, NewHope presented a reconciliation mechanism that is complex and represents an entry barrier for potential implementers. This contribution presents equivalent schemes in one, two and three dimensions, which allow anyone to make the transition to the 4D NewHope algorithm easier to undertake. In addition to that, the effect of modifying some of the parameters associated to NewHope\u2019s reconciliation mechanism is studied, which has allowed us to propose different sets of parameters that could increase the security of NewHope implementations.<\/jats:p>","DOI":"10.1093\/jigpal\/jzac011","type":"journal-article","created":{"date-parts":[[2022,2,16]],"date-time":"2022-02-16T20:12:51Z","timestamp":1645042371000},"page":"1028-1040","source":"Crossref","is-referenced-by-count":5,"title":["A modification proposal for the reconciliation mechanism of the key exchange algorithm NewHope"],"prefix":"10.1093","volume":"30","author":[{"given":"V Gayoso","family":"Mart\u00ednez","sequence":"first","affiliation":[{"name":"Institute of Physical and Information Technologies (ITEFI) , Spanish National Research Council (CSIC), Madrid 28006, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L Hern\u00e1ndez","family":"Encinas","sequence":"additional","affiliation":[{"name":"Institute of Physical and Information Technologies (ITEFI) , Spanish National Research Council (CSIC), Madrid 28006, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A Mart\u00edn","family":"Mu\u00f1oz","sequence":"additional","affiliation":[{"name":"Institute of Physical and Information Technologies (ITEFI) , Spanish National Research Council (CSIC), Madrid 28006, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2022,2,18]]},"reference":[{"key":"2022112012290050700_ref1","article-title":"NewHope","author":"Alkim","year":"2017"},{"key":"2022112012290050700_ref2","article-title":"NewHope. Algorithm Specifications and Supporting Documentation","author":"Alkim","year":"2019"},{"key":"2022112012290050700_ref3","article-title":"Post-quantum key exchange\u2014a new hope","author":"Alkim","year":"2015","journal-title":"Cryptology ePrint Archive"},{"key":"2022112012290050700_ref4","first-page":"327","article-title":"Post-quantum key exchange\u2014a new hope","volume-title":"Proceedings of the 25th USENIX Security Symposium","author":"Alkim","year":"2016"},{"key":"2022112012290050700_ref5","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1112\/S1461157016000280","article-title":"On error distributions in ring-based LWE","volume":"19","author":"Castryck","year":"2016","journal-title":"LMS Journal of Computation and Mathematics"},{"key":"2022112012290050700_ref6","article-title":"A simple provably secure key exchange scheme based on the learning with errors problem","volume-title":"Cryptology ePrint Archive","author":"Ding","year":"2012"},{"key":"2022112012290050700_ref7","article-title":"NewHope\u2019s reconciliation mechanism explained","author":"Ducas","year":"2016"},{"key":"2022112012290050700_ref8","article-title":"Post-quantum key agreement","author":"Langley","year":"2015"},{"key":"2022112012290050700_ref9","doi-asserted-by":"crossref","DOI":"10.1145\/2535925","article-title":"On ideal lattices and learning with errors over rings","volume":"60","author":"Lyubashevsky","year":"2013","journal-title":"Journal of the ACM"},{"key":"2022112012290050700_ref10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-88702-7_5","article-title":"Lattice-based cryptography","volume-title":"Post-Quantum Cryptography, pp. 147\u2013191","author":"Micciancio","year":"2009"},{"key":"2022112012290050700_ref11","article-title":"SHA-3 Standard: permutation-based hash and extendable-output functions","volume-title":"National Institute of Standards and Technology, NIST FIPS PUB 202","author":"NIST","year":"2015"},{"key":"2022112012290050700_ref12","article-title":"Post-quantum cryptography","author":"NIST","year":"2017"},{"key":"2022112012290050700_ref13","article-title":"Status report on the second round of the NIST post-quantum cryptography standardization process","author":"NIST","year":"2020"},{"key":"2022112012290050700_ref14","first-page":"333","article-title":"Public-key cryptosystems from the worst-case shortest vector problem: extended abstract","volume-title":"Proceedings of the 41st Annual ACM Symposium on Theory of Computing","author":"Peikert","year":"2009"},{"key":"2022112012290050700_ref15","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/978-3-319-11659-4_12","article-title":"Lattice cryptography for the internet","volume-title":"Post-Quantum Cryptography","author":"Peikert","year":"2014"},{"key":"2022112012290050700_ref16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1568318.1568324","article-title":"On lattices, learning with errors, random linear codes, and cryptography","volume":"56","author":"Regev","year":"2009","journal-title":"Journal of the ACM"}],"container-title":["Logic Journal of the IGPL"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/jigpal\/article-pdf\/30\/6\/1028\/47058120\/jzac011.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/jigpal\/article-pdf\/30\/6\/1028\/47058120\/jzac011.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,20]],"date-time":"2022-11-20T12:29:13Z","timestamp":1668947353000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/jigpal\/article\/30\/6\/1028\/6529922"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,18]]},"references-count":16,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2022,2,18]]},"published-print":{"date-parts":[[2022,11,23]]}},"URL":"https:\/\/doi.org\/10.1093\/jigpal\/jzac011","relation":{},"ISSN":["1367-0751","1368-9894"],"issn-type":[{"value":"1367-0751","type":"print"},{"value":"1368-9894","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2022,12]]},"published":{"date-parts":[[2022,2,18]]}}}