{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T10:32:10Z","timestamp":1764239530640},"publisher-location":"Berlin, Heidelberg","reference-count":42,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540884026"},{"type":"electronic","value":"9783540884033"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-88403-3_6","type":"book-chapter","created":{"date-parts":[[2008,10,7]],"date-time":"2008-10-07T00:26:31Z","timestamp":1223339191000},"page":"79-94","source":"Crossref","is-referenced-by-count":18,"title":["Explicit Hard Instances of the Shortest Vector Problem"],"prefix":"10.1007","author":[{"given":"Johannes","family":"Buchmann","sequence":"first","affiliation":[]},{"given":"Richard","family":"Lindner","sequence":"additional","affiliation":[]},{"given":"Markus","family":"R\u00fcckert","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"6_CR1","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1145\/1089023.1089025","volume":"52","author":"D. Aharonov","year":"2005","unstructured":"Aharonov, D., Regev, O.: Lattice problems in NP\u2009\u2229\u2009coNP. J. ACM\u00a052(5), 749\u2013765 (2005)","journal-title":"J. ACM"},{"key":"6_CR2","first-page":"99","volume-title":"Proceedings of the Annual Symposium on the Theory of Computing (STOC)","author":"M. Ajtai","year":"1996","unstructured":"Ajtai, M.: Generating hard instances of lattice problems. In: Proceedings of the Annual Symposium on the Theory of Computing (STOC), pp. 99\u2013108. ACM Press, New York (1996)"},{"key":"6_CR3","first-page":"284","volume-title":"Proceedings of the Annual Symposium on the Theory of Computing (STOC)","author":"M. Ajtai","year":"1997","unstructured":"Ajtai, M., Dwork, C.: A public-key cryptosystem with worst-case\/average-case equivalence. In: Proceedings of the Annual Symposium on the Theory of Computing (STOC), pp. 284\u2013293. ACM Press, New York (1997)"},{"key":"6_CR4","first-page":"601","volume-title":"Proceedings of the Annual Symposium on the Theory of Computing (STOC)","author":"M. Ajtai","year":"2001","unstructured":"Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. In: Proceedings of the Annual Symposium on the Theory of Computing (STOC), pp. 601\u2013610. ACM Press, New York (2001)"},{"issue":"2","key":"6_CR5","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1080\/10586458.2001.10504441","volume":"10","author":"D. Bailey","year":"2001","unstructured":"Bailey, D., Crandall, R.: On the random character of fundamental constant expansions. Experimental Mathematics\u00a010(2), 175\u2013190 (2001)","journal-title":"Experimental Mathematics"},{"issue":"4","key":"6_CR6","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1080\/10586458.2002.10504704","volume":"11","author":"D. Bailey","year":"2002","unstructured":"Bailey, D., Crandall, R.: Random generators and normal numbers. Experimental Mathematics\u00a011(4), 527\u2013546 (2002)","journal-title":"Experimental Mathematics"},{"issue":"4","key":"6_CR7","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/BF01445125","volume":"296","author":"W. Banaszczyk","year":"1993","unstructured":"Banaszczyk, W.: New bounds in some transference theorems in the geometry of numbers. Mathematische Annalen\u00a0296(4), 625\u2013635 (1993)","journal-title":"Mathematische Annalen"},{"key":"6_CR8","unstructured":"Buchmann, J., Lindner, R., R\u00fcckert, M.: Explicit hard instances of the shortest vector problem (extended version). Cryptology ePrint Archive, Report 2008\/333 (2008), http:\/\/eprint.iacr.org\/2008\/333"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Cai, J., Nerurkar, A.: An improved worst-case to average-case connection for lattice problems. In: Proceedings of the Annual Symposium on Foundations of Computer Science (FOCS), pp. 468\u2013477 (1997)","DOI":"10.1109\/SFCS.1997.646135"},{"key":"6_CR10","unstructured":"Certicom Corp. The Certicom ECC Challenge, http:\/\/www.certicom.com\/index.php\/the-certicom-ecc-challenge"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/3-540-69053-0_5","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"D. Coppersmith","year":"1997","unstructured":"Coppersmith, D., Shamir, A.: Lattice Attacks on NTRU. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 52\u201361. Springer, Heidelberg (1997)"},{"key":"6_CR12","unstructured":"Filipovi\u0107, B.: Implementierung der gitterbasenreduktion in segmenten. Master\u2019s thesis, Johann Wolfgang Goethe-Universit\u00e4t Frankfurt am Main (2002)"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-78967-3_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"N. Gama","year":"2008","unstructured":"Gama, N., Nguyen, P.Q.: Predicting lattice reduction. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 31\u201351. Springer, Heidelberg (2008)"},{"key":"6_CR14","first-page":"197","volume-title":"STOC","author":"C. Gentry","year":"2008","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Ladner, R.E., Dwork, C. (eds.) STOC, pp. 197\u2013206. ACM Press, New York (2008)"},{"issue":"3","key":"6_CR15","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1006\/jcss.1999.1686","volume":"60","author":"O. Goldreich","year":"2000","unstructured":"Goldreich, O., Goldwasser, S.: On the limits of nonapproximability of lattice problems. J. Comput. Syst. Sci.\u00a060(3), 540\u2013563 (2000)","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/BFb0052231","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"O. Goldreich","year":"1997","unstructured":"Goldreich, O., Goldwasser, S., Halevi, S.: Public-key cryptosystems from lattice reduction problems. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 112\u2013131. Springer, Heidelberg (1997)"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BFb0054868","volume-title":"Algorithmic Number Theory","author":"J. Hoffstein","year":"1998","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: A ring-based public key cryptosystem. In: Buhler, J. (ed.) ANTS 1998. LNCS, vol.\u00a01423, pp. 267\u2013288. Springer, Heidelberg (1998)"},{"key":"6_CR18","unstructured":"Hoffstein, J., Silverman, J.H., Whyte, W.: Estimated breaking times for NTRU lattices. Technical Report 012, Version 2, NTRU Cryptosystems (2003), http:\/\/ntru.com\/cryptolab\/tech_notes.htm"},{"key":"6_CR19","unstructured":"Howgrave-Graham, N., Pipher, H.J.J., Whyte, W.: On estimating the lattice security of NTRU. Technical Report 104, Cryptology ePrint Archive (2005), http:\/\/eprint.iacr.org\/2005\/104\/"},{"key":"6_CR20","doi-asserted-by":"crossref","first-page":"43","DOI":"10.3934\/jmd.2008.2.43","volume":"4","author":"D. Kleinbock","year":"2008","unstructured":"Kleinbock, D., Weiss, B.: Dirichlet\u2019s theorem on diophantine approximation and homogeneous flows. J.MOD.DYN.\u00a04, 43 (2008)","journal-title":"J.MOD.DYN."},{"key":"6_CR21","unstructured":"Koy, H.: Primale-duale Segment-Reduktion (2004), http:\/\/www.mi.informatik.uni-frankfurt.de\/research\/papers.html"},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/3-540-44670-2_7","volume-title":"Cryptography and Lattices","author":"H. Koy","year":"2001","unstructured":"Koy, H., Schnorr, C.-P.: Segment LLL-reduction of lattice bases. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol.\u00a02146, pp. 67\u201380. Springer, Heidelberg (2001)"},{"issue":"4","key":"6_CR23","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/BF02128669","volume":"10","author":"J.C. Lagarias","year":"1990","unstructured":"Lagarias, J.C., Lenstra Jr., H.W., Schnorr, C.-P.: Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice. Combinatorica\u00a010(4), 333\u2013348 (1990)","journal-title":"Combinatorica"},{"issue":"4","key":"6_CR24","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A. Lenstra","year":"1982","unstructured":"Lenstra, A., Lenstra, H., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Mathematische Annalen\u00a0261(4), 515\u2013534 (1982)","journal-title":"Mathematische Annalen"},{"key":"6_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-540-24587-2_22","volume-title":"Algorithms and Computation","author":"C. Ludwig","year":"2003","unstructured":"Ludwig, C.: A faster lattice reduction method using quantum search. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol.\u00a02906, pp. 199\u2013208. Springer, Heidelberg (2003)"},{"key":"6_CR26","unstructured":"Ludwig, C.: Practical Lattice Basis Sampling Reduction. PhD thesis, Technische Universit\u00e4t Darmstadt (2005), http:\/\/elib.tu-darmstadt.de\/diss\/000640\/"},{"key":"6_CR27","doi-asserted-by":"crossref","unstructured":"McCurley, K.S.: The discrete logarithm problem. In: Pomerance, C. (ed.) Cryptology and computational number theory, Providence, pp. 49\u201374. American Mathematical Society (1990)","DOI":"10.1090\/psapm\/042\/1095551"},{"issue":"1","key":"6_CR28","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1137\/S0097539703433511","volume":"34","author":"D. Micciancio","year":"2004","unstructured":"Micciancio, D.: Almost perfect lattices, the covering radius problem, and applications to Ajtai\u2019s connection factor. SIAM Journal on Computing\u00a034(1), 118\u2013169 (2004)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"6_CR29","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1137\/S0097539705447360","volume":"37","author":"D. Micciancio","year":"2007","unstructured":"Micciancio, D., Regev, O.: Worst-case to average-case reductions based on gaussian measures. SIAM Journal on Computing\u00a037(1), 267\u2013302 (2007)","journal-title":"SIAM Journal on Computing"},{"key":"6_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/11426639_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"P.Q. Nguyen","year":"2005","unstructured":"Nguyen, P.Q., Stehl\u00e9, D.: Floating-point LLL revisited. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 215\u2013233. Springer, Heidelberg (2005)"},{"key":"6_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/11792086_18","volume-title":"Algorithmic Number Theory","author":"P.Q. Nguyen","year":"2006","unstructured":"Nguyen, P.Q., Stehl\u00e9, D.: LLL on the average. In: Hess, F., Pauli, S., Pohst, M.E. (eds.) ANTS 2006. LNCS, vol.\u00a04076, pp. 238\u2013256. Springer, Heidelberg (2006)"},{"key":"6_CR32","first-page":"333","volume-title":"IEEE Conference on Computational Complexity","author":"C. Peikert","year":"2007","unstructured":"Peikert, C.: Limits on the hardness of lattice problems in \u2113 p norms. In: IEEE Conference on Computational Complexity, pp. 333\u2013346. IEEE Computer Society Press, Los Alamitos (2007)"},{"issue":"3","key":"6_CR33","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1137\/S0097539703440678","volume":"33","author":"O. Regev","year":"2004","unstructured":"Regev, O.: Quantum computation and lattice problems. SIAM J. Comput.\u00a033(3), 738\u2013760 (2004)","journal-title":"SIAM J. Comput."},{"key":"6_CR34","first-page":"84","volume-title":"Proceedings of the 37th annual ACM symposium on Theory of computing","author":"O. Regev","year":"2005","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, pp. 84\u201393. ACM Press, New York (2005)"},{"key":"6_CR35","unstructured":"Regev, O.: On the complexity of lattice problems with polynomial approximation factors. In: A survey for the LLL+25 conference (2007)"},{"key":"6_CR36","unstructured":"RSA Security Inc. The RSA Challenge Numbers, http:\/\/www.rsa.com\/rsalabs\/node.asp?id=2093"},{"key":"6_CR37","series-title":"Lecture Notes in Mathematics","volume-title":"Diophantine Approximation","author":"W. Schmidt","year":"1980","unstructured":"Schmidt, W.: Diophantine Approximation. Lecture Notes in Mathematics, vol.\u00a0785. Springer, Heidelberg (1980)"},{"key":"6_CR38","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0304-3975(87)90064-8","volume":"53","author":"C. Schnorr","year":"1987","unstructured":"Schnorr, C.: A hierarchy of polynomial time lattice basis reduction algorithms. Theoretical Computer Science\u00a053, 201\u2013224 (1987)","journal-title":"Theoretical Computer Science"},{"key":"6_CR39","first-page":"1","volume":"4","author":"C. Schnorr","year":"1994","unstructured":"Schnorr, C.: Block reduced lattice bases and successive minima. Combinatorics, Probability and Computing\u00a04, 1\u201316 (1994)","journal-title":"Combinatorics, Probability and Computing"},{"key":"6_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/3-540-36494-3_14","volume-title":"STACS 2003","author":"C. Schnorr","year":"2003","unstructured":"Schnorr, C.: Lattice reduction by random sampling and birthday methods. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol.\u00a02607, pp. 146\u2013156. Springer, Heidelberg (2003)"},{"key":"6_CR41","unstructured":"Shoup, V.: Number theory library (NTL) for C++, http:\/\/www.shoup.net\/ntl\/"},{"key":"6_CR42","unstructured":"Stehl\u00e9, D.: Damien Stehl\u00e9\u2019s homepage at \u00e9cole normale sup\u00e9rieure de Lyon, http:\/\/perso.ens-lyon.fr\/damien.stehle\/english.html"}],"container-title":["Lecture Notes in Computer Science","Post-Quantum Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-88403-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,8]],"date-time":"2020-05-08T18:34:31Z","timestamp":1588962871000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-88403-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540884026","9783540884033"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88403-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}