{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:42:06Z","timestamp":1743147726568,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030578046"},{"type":"electronic","value":"9783030578053"}],"license":[{"start":{"date-parts":[[2020,8,28]],"date-time":"2020-08-28T00:00:00Z","timestamp":1598572800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,8,28]],"date-time":"2020-08-28T00:00:00Z","timestamp":1598572800000},"content-version":"vor","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":[[2021]]},"DOI":"10.1007\/978-3-030-57805-3_34","type":"book-chapter","created":{"date-parts":[[2020,8,27]],"date-time":"2020-08-27T13:04:15Z","timestamp":1598533455000},"page":"361-370","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Study of the Reconciliation Mechanism of NewHope"],"prefix":"10.1007","author":[{"given":"V\u00edctor","family":"Gayoso Mart\u00ednez","sequence":"first","affiliation":[]},{"given":"Luis","family":"Hern\u00e1ndez Encinas","sequence":"additional","affiliation":[]},{"given":"Agust\u00edn","family":"Mart\u00edn Mu\u00f1oz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,28]]},"reference":[{"key":"34_CR1","unstructured":"NIST: Public-key post-quantum cryptographic algorithms (2016). \nhttps:\/\/csrc.nist.gov\/News\/2016\/Public-Key-Post-Quantum-Cryptographic-Algorithms\n\n. Last Accessed 21 Apr 2020"},{"key":"34_CR2","unstructured":"NIST: Post-quantum cryptography (2017) \nhttps:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\n\n. Last Accessed 21 Apr 2020"},{"key":"34_CR3","unstructured":"Alkim, E., Avanzi, R., Bos, J., Ducas, L., de\u00a0la Piedra, A., P\u00f6ppelmann, T., Schwabe, P., Stebila, D.: NewHope (2017). \nhttps:\/\/www.newhopecrypto.org\n\n. Last Accessed 21 Apr 2020"},{"key":"34_CR4","unstructured":"Alkim, E., Avanzi, R., Bos, J., Ducas, L., de\u00a0la Piedra, A., P\u00f6ppelmann, T., Schwabe, P., Stebila, D.: NewHope. Algorithm specifications and supporting documentation (2019). \nhttps:\/\/www.newhopecrypto.org\/data\/NewHope_2019_07_10.pdf\n\n. Last Accessed 21 Apr 2020"},{"key":"34_CR5","unstructured":"Alkim, E., Ducas, L., P\u00f6ppelmann, T., Schwabe, P.: Post-quantum key exchange - a new hope. In: Proceedings of the 25th USENIX Security Symposium, pp. 327\u2013343 (2016)"},{"key":"34_CR6","unstructured":"Ding, J., Xie, X., Lin, X.: A simple provably secure key exchange scheme based on the learning with errors problem. Cryptology ePrint Archive, Report 2012\/688, pp. 1\u201315 (2012). \nhttps:\/\/eprint.iacr.org\/2012\/688\n\n. Last Accessed 21 Apr 2020"},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"Peikert, C.: Lattice cryptography for the internet. In: Mosca, M., (ed.) Post-Quantum Cryptography, pp. 197\u2013219. Springer International Publishing (2014)","DOI":"10.1007\/978-3-319-11659-4_12"},{"key":"34_CR8","unstructured":"Langley, A.: Post-quantum key agreement (2015). \nhttps:\/\/www.imperialviolet.org\/2015\/12\/24\/rlwe.html\n\n. Last Accessed 21 Apr 2020"},{"key":"34_CR9","unstructured":"Ducas, L.: Newhope\u2019s reconciliation mechanism explained (2016). \nhttps:\/\/homepages.cwi.nl\/~ducas\/weblog\/NewhopeRec\/index.html\n\n. Last Accessed 21 Apr 2020"},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Regev, O.: Lattice-based cryptography. In: Bernstein, D.J., Buchmann, J., Dahmen, E. (eds.) Post-Quantum Cryptography, pp. 147\u2013191. Springer, Berlin, Germany (2009)","DOI":"10.1007\/978-3-540-88702-7_5"},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography, pp. 84\u201393 (2005)","DOI":"10.1145\/1060590.1060603"},{"key":"34_CR12","doi-asserted-by":"crossref","unstructured":"Peikert, C.: Public-key cryptosystems from the worst-case shortest vector problem: extended abstract. In: STOC 2009, pp. 333\u2013342 (2009)","DOI":"10.1145\/1536414.1536461"},{"key":"34_CR13","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. Lecture Notes Computer Science, vol. 6110, pp. 1\u201323 (2010)","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"34_CR14","unstructured":"NIST: SHA-3 Standard: Permutation-Based Hash and Extendable-Output Functions. National Institute of Standards and Technology, NIST FIPS PUB 202, March 2015"},{"key":"34_CR15","unstructured":"Alkim, E., Ducas, L., P\u00f6ppelmann, T., Schwabe, P.: Post-quantum key exchange - a new hope. Cryptology ePrint Archive, Report 2015\/1092 (2015). \nhttp:\/\/eprint.iacr.org\/2015\/1092\n\n. Last Accessed 21 Apr 2020"}],"container-title":["Advances in Intelligent Systems and Computing","13th International Conference on Computational Intelligence in Security for Information Systems (CISIS 2020)"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-57805-3_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,7]],"date-time":"2020-09-07T11:14:01Z","timestamp":1599477241000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-57805-3_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,28]]},"ISBN":["9783030578046","9783030578053"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-57805-3_34","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2020,8,28]]},"assertion":[{"value":"28 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}