{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T22:37:03Z","timestamp":1759963023796},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2009,5,26]],"date-time":"2009-05-26T00:00:00Z","timestamp":1243296000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1007\/s00607-009-0042-y","type":"journal-article","created":{"date-parts":[[2009,5,25]],"date-time":"2009-05-25T02:06:17Z","timestamp":1243217177000},"page":"105-125","source":"Crossref","is-referenced-by-count":13,"title":["Post-quantum cryptography: lattice signatures"],"prefix":"10.1007","volume":"85","author":[{"given":"Johannes","family":"Buchmann","sequence":"first","affiliation":[]},{"given":"Richard","family":"Lindner","sequence":"additional","affiliation":[]},{"given":"Markus","family":"R\u00fcckert","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Schneider","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,5,26]]},"reference":[{"key":"42_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai M (1996) Generating hard instances of lattice problems (extended abstract). In: Proceedings of the annual symposium on the theory of computing (STOC) 1996. ACM Press, pp 99\u2013108","DOI":"10.1145\/237814.237838"},{"key":"42_CR2","doi-asserted-by":"crossref","unstructured":"Ajtai M (1999) Generating hard instances of the short basis problem. In: International colloquium on automata, languages and programming (ICALP). Lecture notes in computer science. Springer, New York, pp 1\u20139","DOI":"10.1007\/3-540-48523-6_1"},{"issue":"1","key":"42_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579403","volume":"6","author":"L Babai","year":"1986","unstructured":"Babai L (1986) On Lov\u00e1sz\u2019 lattice reduction and the nearest lattice point problem. Combinatorica 6(1): 1\u201313","journal-title":"Combinatorica"},{"key":"42_CR4","volume-title":"Post-quantum cryptography","year":"2008","unstructured":"Bernstein, DJ, Buchmann, J, Dahmen, E (eds) (2008) Post-quantum cryptography. Springer, New York"},{"key":"42_CR5","doi-asserted-by":"crossref","unstructured":"Buchmann J, Dahmen E, Klintsevich E, Okeya K, Vuillaume C (2007) Merkle signatures with virtually unlimited signature capacity. In: International conference on applied cryptography and network security\u2014ACNS 2007. Lecture notes in computer science. Springer, New York, pp 31\u201345","DOI":"10.1007\/978-3-540-72738-5_3"},{"key":"42_CR6","doi-asserted-by":"crossref","unstructured":"Buchmann J, Dahmen E, Schneider M (2008) Merkle tree traversal revisited. In: Post-quantum cryptography (PQCrypto) 2008. Lecture notes in computer science. Springer, New York, pp 63\u201378","DOI":"10.1007\/978-3-540-88403-3_5"},{"key":"42_CR7","doi-asserted-by":"crossref","unstructured":"Buchmann J, Lindner R, R\u00fcckert M (2008) Explicit hard instances of the shortest vector problem. In: Post-quantum cryptography (PQCrypto) 2008. Lecture notes in computer science. Springer, New York, pp 79\u201394","DOI":"10.1007\/978-3-540-88403-3_6"},{"key":"42_CR8","doi-asserted-by":"crossref","unstructured":"Buchmann J, Lindner R, R\u00fcckert M, Schneider M (2008) Explicit hard instances of the shortest vector problem (extended version). Technical Report 2008\/333, Cryptology ePrint Archive","DOI":"10.1007\/978-3-540-88403-3_6"},{"issue":"1","key":"42_CR9","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/S0304-3975(01)00290-0","volume":"285","author":"I Dinur","year":"2002","unstructured":"Dinur I (2002) Approximating SVP\u221e to within almost-polynomial factors is NP-hard. Theor Comput Sci 285(1): 55\u201371","journal-title":"Theor Comput Sci"},{"key":"42_CR10","first-page":"233","volume-title":"EUROCRYPT. Lecture notes in computer science, vol 4004","author":"N Gama","year":"2006","unstructured":"Gama N, Howgrave-Graham N, Nguyen PQ (2006) Symplectic lattice reduction and NTRU. In: Vaudenay S(eds) EUROCRYPT. Lecture notes in computer science, vol 4004. Springer, New York, pp 233\u2013253"},{"key":"42_CR11","doi-asserted-by":"crossref","unstructured":"Gentry C, Jonsson J, Stern J, Szydlo M (2001) Cryptanalysis of the ntru signature scheme (nss) from eurocrypt 2001. In: Advances in cryptology\u2014Asiacrypt 2001, pp 1\u201320","DOI":"10.1007\/3-540-45682-1_1"},{"key":"42_CR12","doi-asserted-by":"crossref","unstructured":"Gentry C, Peikert C, Vaikuntanathan V (2008) Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of the annual symposium on the theory of computing (STOC) 2008. ACM Press, pp 197\u2013206","DOI":"10.1145\/1374376.1374407"},{"key":"42_CR13","doi-asserted-by":"crossref","unstructured":"Goldreich O, Goldwasser S, Halevi S (1997) Public-key cryptosystems from lattice reduction problems. In: Advances in cryptology\u2014crypto 1997. Lecture notes in computer science. Springer, New York, pp 112\u2013131","DOI":"10.1007\/BFb0052231"},{"key":"42_CR14","unstructured":"Hoffstein J, Howgrave-Graham N, Pipher J, Silverman JH, Whyte W (2005) Performance improvements and a baseline parameter generation algorithm for NTRUsign. http:\/\/grouper.ieee.org\/groups\/1363\/lattPK\/submissions.html"},{"key":"42_CR15","doi-asserted-by":"crossref","unstructured":"Hoffstein J, Pipher J, Silverman JH (2001) NSS: an ntru lattice-based signature scheme. In: Advances in cryptology\u2014Eurocrypt 2001. Lecture notes in computer science. Springer, New York, pp 211\u2013228","DOI":"10.1007\/3-540-44987-6_14"},{"key":"42_CR16","doi-asserted-by":"crossref","unstructured":"Jakobsson M, Leighton T, Micali S, Szydlo M (2003) Fractal merkle tree representation and traversal. In: Topics in cryptology\u2014cryptographer\u2019s track, RSA Conference (CT-RSA) 2003. Lecture notes in computer science. Springer, New York, pp 314\u2013326","DOI":"10.1007\/3-540-36563-X_21"},{"issue":"5","key":"42_CR17","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1145\/1089023.1089027","volume":"52","author":"S Khot","year":"2005","unstructured":"Khot S (2005) Hardness of approximating the shortest vector problem in lattices. J ACM 52(5): 789\u2013808","journal-title":"J ACM"},{"key":"42_CR18","unstructured":"Klein PN (2000) Finding the closest lattice vector when it\u2019s unusually close. In: Proceedings of the annual symposium on discrete algorithms (SODA) 2000. ACM Press, pp 937\u2013941"},{"issue":"4","key":"42_CR19","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A Lenstra","year":"1982","unstructured":"Lenstra A, Lenstra H, Lov\u00e1sz L (1982) Factoring polynomials with rational coefficients. Math Ann 261(4): 515\u2013534","journal-title":"Math Ann"},{"key":"42_CR20","doi-asserted-by":"crossref","unstructured":"Lyubashevsky V, Micciancio D (2006) Generalized compact knapsacks are collision resistant. In: International colloquium on automata, languages and programming (ICALP) 2006. Lecture notes in computer science. Springer, New York, pp 144\u2013155","DOI":"10.1007\/11787006_13"},{"key":"42_CR21","doi-asserted-by":"crossref","unstructured":"Lyubashevsky V, Micciancio D (2008) Asymptotically efficient lattice-based digital signatures. In: Theory of cryptography conference (TCC) 2008. Lecture notes in computer science. Springer, New York, pp 37\u201354","DOI":"10.1007\/978-3-540-78524-8_3"},{"key":"42_CR22","doi-asserted-by":"crossref","unstructured":"Lyubashevsky V, Micciancio D, Peikert C, Rosen A (2008) Swifft: a modest proposal for fft hashing. In: Fast software encryption (FSE) 2008. Lecture notes in computer science. Springer, New York, pp 54\u201372","DOI":"10.1007\/978-3-540-71039-4_4"},{"key":"42_CR23","doi-asserted-by":"crossref","unstructured":"Merkle R (1990) A certified digital signature. In: Advances in cryptology\u2014crypto 1989. Lecture notes in computer science. Springer, New York, pp 218\u2013238","DOI":"10.1007\/0-387-34805-0_21"},{"key":"42_CR24","doi-asserted-by":"crossref","unstructured":"Micciancio D (2001) Improving lattice based cryptosystems using the Hermite normal form. In: Cryptography and lattices (CaLC) 2001. Lecture notes in computer science. Springer, New York, pp 126\u2013145","DOI":"10.1007\/3-540-44670-2_11"},{"key":"42_CR25","doi-asserted-by":"crossref","unstructured":"Micciancio D (2002) Generalized compact knapsacks, cyclic lattices, and efficient one-way functions from worst-case complexity assumptions. In: Proceedings of the 43rd annual IEEE symposium on foundations of computer science, 2002, pp 356\u2013365","DOI":"10.1109\/SFCS.2002.1181960"},{"key":"42_CR26","doi-asserted-by":"crossref","unstructured":"Micciancio D, Goldwasser S (2002) Complexity of lattice problems: a cryptographic perspective. The Kluwer international series in engineering and computer science, vol 671. Kluwer, Boston","DOI":"10.1007\/978-1-4615-0897-7"},{"issue":"1","key":"42_CR27","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1137\/S0097539705447360","volume":"37","author":"D Micciancio","year":"2007","unstructured":"Micciancio D, Regev O (2007) Worst-case to average-case reductions based on gaussian measures. SIAM J Comput 37(1): 267\u2013302","journal-title":"SIAM J Comput"},{"key":"42_CR28","doi-asserted-by":"crossref","unstructured":"Nguyen PQ (1999) Cryptanalysis of the Goldreich-Goldwasser-Halevi cryptosystem from crypto\u201997. In: Advances in cryptology\u2014crypto 1999. Lecture notes in computer science. Springer, New York, pp 288\u2013304","DOI":"10.1007\/3-540-48405-1_18"},{"key":"42_CR29","unstructured":"Nguyen PQ, Regev O (2006) Learning a parallelepiped: cryptanalysis of GGH and NTRU signatures. In: Advances in cryptology\u2014Eurocrypt 2006. Lecture notes in computer science. Springer, New York, pp 215\u2013233"},{"key":"42_CR30","doi-asserted-by":"crossref","unstructured":"Peikert C, Rosen A (2006) Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices. In: Theory of cryptography conference (TCC) 2006. Lecture notes in computer science. Springer, New York, pp 145\u2013166","DOI":"10.1007\/11681878_8"},{"key":"42_CR31","unstructured":"Regev O (2007) On the complexity of lattice problems with polynomial approximation factors. In: A survey for the LLL+25 conference"},{"key":"42_CR32","doi-asserted-by":"crossref","unstructured":"Regev O, Rosen R (2006) Lattice problems and norm embeddings. In: Proceedings of the annual symposium on the theory of computing (STOC) 2006. ACM Press, pp 447\u2013456","DOI":"10.1145\/1132516.1132581"},{"issue":"5","key":"42_CR33","doi-asserted-by":"crossref","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor PW (1997) Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J Comput 26(5): 1484\u20131509","journal-title":"SIAM J Comput"},{"key":"42_CR34","doi-asserted-by":"crossref","unstructured":"Szydlo M (2003) Merkle tree traversal in log space and time (preprint version). http:\/\/www.szydlo.com","DOI":"10.1007\/978-3-540-24676-3_32"},{"key":"42_CR35","doi-asserted-by":"crossref","unstructured":"Szydlo M (2004) Merkle tree traversal in log space and time. In: Advances in cryptology\u2014Eurocrypt 2004. Lecture notes in computer science. Springer, New York, pp 541\u2013554","DOI":"10.1007\/978-3-540-24676-3_32"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-009-0042-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00607-009-0042-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-009-0042-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:30:21Z","timestamp":1559140221000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00607-009-0042-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5,26]]},"references-count":35,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2009,6]]}},"alternative-id":["42"],"URL":"https:\/\/doi.org\/10.1007\/s00607-009-0042-y","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,5,26]]}}}