{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T19:51:25Z","timestamp":1760385085422},"publisher-location":"Berlin, Heidelberg","reference-count":52,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642147111"},{"type":"electronic","value":"9783642147128"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14712-8_8","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T09:17:50Z","timestamp":1280395070000},"page":"124-143","source":"Crossref","is-referenced-by-count":15,"title":["Accelerating Lattice Reduction with FPGAs"],"prefix":"10.1007","author":[{"given":"J\u00e9r\u00e9mie","family":"Detrey","sequence":"first","affiliation":[]},{"given":"Guillaume","family":"Hanrot","sequence":"additional","affiliation":[]},{"given":"Xavier","family":"Pujol","sequence":"additional","affiliation":[]},{"given":"Damien","family":"Stehl\u00e9","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/978-3-642-13190-5_28","volume-title":"EUROCRYPT 2010","author":"S. Agrawal","year":"2010","unstructured":"Agrawal, S., Boneh, D., Boyen, X.: Efficient lattice (H)IBE in the standard model. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 553\u2013572. Springer, Heidelberg (2010)"},{"key":"8_CR2","first-page":"284","volume-title":"Proc. of STOC","author":"M. Ajtai","year":"1998","unstructured":"Ajtai, M.: The shortest vector problem in L 2 is NP-hard for randomized reductions (extended abstract). In: Proc. of STOC, pp. 284\u2013293. ACM, New York (1998)"},{"key":"8_CR3","first-page":"284","volume-title":"Proc. of STOC","author":"M. Ajtai","year":"1997","unstructured":"Ajtai, M., Dwork, C.: A public-key cryptosystem with worst-case\/average-case equivalence. In: Proc. of STOC, pp. 284\u2013293. ACM, New York (1997)"},{"key":"8_CR4","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1145\/380752.380857","volume-title":"Proc. of STOC","author":"M. Ajtai","year":"2001","unstructured":"Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. In: Proc. of STOC, pp. 601\u2013610. ACM, New York (2001)"},{"key":"8_CR5","unstructured":"Arbitman, Y., Dogon, G., Lyubashevsky, V., Micciancio, D., Peikert, C., Rosen, A.: SWIFFTX: a proposal for the SHA-3 standard. Submission to NIST (2008), http:\/\/www.eecs.harvard.edu\/~alon\/PAPERS\/lattices\/swifftx.pdf"},{"key":"8_CR6","unstructured":"Cad\u00e9, D., Pujol, X., Stehl\u00e9, D.: fplll - a floating-point LLL implementation, http:\/\/perso.ens-lyon.fr\/damien.stehle"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/978-3-642-13190-5_27","volume-title":"EUROCRYPT 2010","author":"D. Cash","year":"2010","unstructured":"Cash, D., Hofheinz, D., Kiltz, E., Peikert, C.: Bonsai trees, or how to delegate a lattice basis. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 523\u2013552. Springer, Heidelberg (2010)"},{"key":"8_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2016-7","volume-title":"Sphere Packings, Lattices and Groups","author":"J.H. Conway","year":"1988","unstructured":"Conway, J.H., Sloane, N.J.A.: Sphere Packings, Lattices and Groups. Springer, Heidelberg (1988)"},{"issue":"4","key":"8_CR9","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s001459900030","volume":"10","author":"D. Coppersmith","year":"1997","unstructured":"Coppersmith, D.: Small solutions to polynomial equations, and low exponent RSA vulnerabilities. J. Cryptology\u00a010(4), 233\u2013260 (1997)","journal-title":"J. Cryptology"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-642-13190-5_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"Dijk van","year":"2010","unstructured":"van Dijk, Gentry, C., Halevi, S., Vaikuntanathan, V.: Fully homomorphic encryption over the integers. In: Gilbert, H. (ed.) Advances in Cryptology \u2013 EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 24\u201343. Springer, Heidelberg (2010)"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1007\/3-540-12868-9_103","volume-title":"Computer Algebra","author":"U. Fincke","year":"1983","unstructured":"Fincke, U., Pohst, M.: A procedure for determining algebraic integers of given norm. In: van Hulzen, J.A. (ed.) ISSAC 1983 and EUROCAL 1983. LNCS, vol.\u00a0162, pp. 194\u2013202. Springer, Heidelberg (1983)"},{"key":"8_CR12","first-page":"207","volume-title":"Proc. of STOC","author":"N. Gama","year":"2008","unstructured":"Gama, N., Nguyen, P.Q.: Finding short lattice vectors within Mordell\u2019s inequality. In: Proc. of STOC, pp. 207\u2013216. ACM, New York (2008)"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-642-13190-5_13","volume-title":"EUROCRYPT 2010","author":"N. Gama","year":"2010","unstructured":"Gama, N., Nguyen, P.Q., Regev, O.: Lattice enumeration using extreme pruning. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 257\u2013278. Springer, Heidelberg (2010)"},{"key":"8_CR14","first-page":"169","volume-title":"Proc. of STOC","author":"C. Gentry","year":"2009","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proc. of STOC, pp. 169\u2013178. ACM, New York (2009)"},{"key":"8_CR15","first-page":"197","volume-title":"Proc. of STOC","author":"C. Gentry","year":"2008","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Proc. of STOC, pp. 197\u2013206. ACM, New York (2008)"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"8_CR17","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1515\/form.2003.009","volume":"15","author":"D. Goldstein","year":"2003","unstructured":"Goldstein, D., Mayer, A.: On the equidistribution of Hecke points. Forum Mathematicum\u00a015, 165\u2013189 (2003)","journal-title":"Forum Mathematicum"},{"key":"8_CR18","first-page":"1195","volume-title":"Proc. of MWSCAS","author":"Z. Guo","year":"2005","unstructured":"Guo, Z., Nilsson, P.: VLSI architecture of the soft-output sphere decoder for MIMO systems. In: Proc. of MWSCAS, vol.\u00a02, pp. 1195\u20131198. IEEE, Los Alamitos (2005)"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-540-74143-5_10","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"G. Hanrot","year":"2007","unstructured":"Hanrot, G., Stehl\u00e9, D.: Improved analysis of Kannan\u2019s shortest lattice vector algorithm. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 170\u2013186. Springer, Heidelberg (2007)"},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","first-page":"52","volume-title":"AFRICACRYPT","author":"J. Hermans","year":"2010","unstructured":"Hermans, J., Schneider, M., Buchmann, J., Vercauteren, F., Preneel, B.: Parallel shortest lattice vector enumeration on graphics cards. In: Bernstein, D.J., Lange, T. (eds.) AFRICACRYPT 2010. LNCS, vol.\u00a06055, pp. 52\u201368. Springer, Heidelberg (2010)"},{"key":"8_CR21","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.P. (ed.) ANTS 1998. LNCS, vol.\u00a01423, pp. 267\u2013288. Springer, Heidelberg (1998)"},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-540-74143-5_9","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"N. Howgrave-Graham","year":"2007","unstructured":"Howgrave-Graham, N.: A hybrid lattice-reduction and meet-in-the-middle attack against NTRU. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 150\u2013169. Springer, Heidelberg (2007)"},{"key":"8_CR23","first-page":"99","volume-title":"Proc. of STOC","author":"R. Kannan","year":"1983","unstructured":"Kannan, R.: Improved algorithms for integer programming and related lattice problems. In: Proc. of STOC, pp. 99\u2013108. ACM, New York (1983)"},{"key":"8_CR24","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A.K. Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra Jr., H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Math. Ann.\u00a0261, 515\u2013534 (1982)","journal-title":"Math. Ann."},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L.: An Algorithmic Theory of Numbers, Graphs and Convexity. SIAM, cBMS-NSF Regional Conference Series in Applied Mathematics (1986)","DOI":"10.1137\/1.9781611970203"},{"key":"8_CR26","unstructured":"Magma: The Magma computational algebra system, http:\/\/magma.maths.usyd.edu.au\/magma\/"},{"key":"8_CR27","doi-asserted-by":"crossref","unstructured":"May, A.: Using LLL-reduction for solving RSA and factorization problems: A survey. In: [32] (2009)","DOI":"10.1007\/978-3-642-02295-1_10"},{"key":"8_CR28","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-540-88702-7_5","volume-title":"Post-Quantum Cryptography","author":"D. Micciancio","year":"2009","unstructured":"Micciancio, D., Regev, O.: Lattice-based cryptography. In: Bernstein, D.J., Buchmann, J., Dahmen, E. (eds.) Post-Quantum Cryptography, pp. 147\u2013191. Springer, Heidelberg (2009)"},{"key":"8_CR29","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Voulgaris, P.: A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations. To appear in the proceedings of STOC 2010 (2010)","DOI":"10.1145\/1806689.1806739"},{"key":"8_CR30","first-page":"1468","volume-title":"Proc. of SODA","author":"D. Micciancio","year":"2010","unstructured":"Micciancio, D., Voulgaris, P.: Faster exponential time algorithms for the shortest vector problem. In: Proc. of SODA, pp. 1468\u20131480. SIAM, Philadelphia (2010)"},{"key":"8_CR31","first-page":"1591","volume":"40","author":"W.H. Mow","year":"1994","unstructured":"Mow, W.H.: Maximum likelihood sequence estimation from the lattice viewpoint. IEEE TIT\u00a040, 1591\u20131600 (1994)","journal-title":"IEEE TIT"},{"key":"8_CR32","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-02295-1","volume-title":"The LLL algorithm, survey and applications. Information Security and Cryptography","author":"P.Q. Nguyen","year":"2010","unstructured":"Nguyen, P.Q., Vall\u00e9e, B.: The LLL algorithm, survey and applications. Information Security and Cryptography. Springer, Heidelberg (2010)"},{"key":"8_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"8_CR34","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. (eds.) ANTS 2006. LNCS, vol.\u00a04076, pp. 238\u2013256. Springer, Heidelberg (2006)"},{"key":"8_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/BFb0055731","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"P.Q. Nguyen","year":"1998","unstructured":"Nguyen, P.Q., Stern, J.: Cryptanalysis of the Ajtai-Dwork cryptosystem. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 223\u2013242. Springer, Heidelberg (1998)"},{"key":"8_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/3-540-44670-2_12","volume-title":"Cryptography and Lattices","author":"P.Q. Nguyen","year":"2001","unstructured":"Nguyen, P.Q., Stern, J.: The two faces of lattices in cryptology. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol.\u00a02146, pp. 146\u2013180. Springer, Heidelberg (2001)"},{"key":"8_CR37","doi-asserted-by":"crossref","unstructured":"Nguyen, P.Q., Vidick, T.: Sieve algorithms for the shortest vector problem are practical. J. Mathematical Cryptology\u00a02(2) (2008)","DOI":"10.1515\/JMC.2008.009"},{"key":"8_CR38","doi-asserted-by":"crossref","unstructured":"Odlyzko, A.M.: The rise and fall of knapsack cryptosystems. In: Proceedings of Cryptology and Computational Number Theory. Proceedings of Symposia in Applied Mathematics, vol.\u00a042, pp. 75\u201388. AMS (1989)","DOI":"10.1090\/psapm\/042\/1095552"},{"key":"8_CR39","first-page":"333","volume-title":"Proc. of STOC","author":"C. Peikert","year":"2009","unstructured":"Peikert, C.: Public-key cryptosystems from the worst-case shortest vector problem. In: Proc. of STOC, pp. 333\u2013342. ACM, New York (2009)"},{"key":"8_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/978-3-540-89255-7_24","volume-title":"Advances in Cryptology - ASIACRYPT 2008","author":"X. Pujol","year":"2008","unstructured":"Pujol, X., Stehl\u00e9, D.: Rigorous and efficient short lattice vectors enumeration. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol.\u00a05350, pp. 390\u2013405. Springer, Heidelberg (2008)"},{"key":"8_CR41","unstructured":"Pujol, X., Stehl\u00e9, D.: Solving the shortest lattice vector problem in time 22.465n. Cryptology ePrint Archive, Report 2009\/605 (2009), http:\/\/eprint.iacr.org\/2009\/605"},{"key":"8_CR42","unstructured":"Regev, O.: Lattices in computer science (2004). lecture notes of a course given at the Tel. Aviv. University, http:\/\/www.cs.tau.ac.il\/~odedr\/teaching\/lattices_fall_2004\/"},{"key":"8_CR43","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1145\/1060590.1060603","volume-title":"Proc. of STOC","author":"O. Regev","year":"2005","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Proc. of STOC, pp. 84\u201393. ACM, New York (2005)"},{"key":"8_CR44","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0304-3975(87)90064-8","volume":"53","author":"C.P. Schnorr","year":"1987","unstructured":"Schnorr, C.P.: A hierarchy of polynomial lattice basis reduction algorithms. Theor. Comput. Sci.\u00a053, 201\u2013224 (1987)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR45","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01581144","volume":"66","author":"C.P. Schnorr","year":"1994","unstructured":"Schnorr, C.P., Euchner, M.: Lattice basis reduction: improved practical algorithms and solving subset sum problems. Math. Programming\u00a066, 181\u2013199 (1994)","journal-title":"Math. Programming"},{"key":"8_CR46","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Advances in Cryptology - EUROCRYPT \u201995","author":"C.P. Schnorr","year":"1995","unstructured":"Schnorr, C.P., H\u00f6rner, H.H.: Attacking the Chor-Rivest cryptosystem by improved lattice reduction. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol.\u00a0921, pp. 1\u201312. Springer, Heidelberg (1995)"},{"key":"8_CR47","unstructured":"Shoup, V.: NTL, Number Theory C++ Library, http:\/\/www.shoup.net\/ntl\/"},{"key":"8_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/978-3-642-13013-7_25","volume-title":"PKC 2010","author":"N.P. Smart","year":"2010","unstructured":"Smart, N.P., Vercauteren, F.: Fully homomorphic encryption with relatively small key and ciphertext sizes. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol.\u00a06056, pp. 420\u2013443. Springer, Heidelberg (2010)"},{"key":"8_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1007\/978-3-642-10366-7_36","volume-title":"Proc. of ASIACRYPT","author":"D. Stehl\u00e9","year":"2009","unstructured":"Stehl\u00e9, D., Steinfeld, R., Tanaka, K., Xagawa, K.: Efficient public key encryption based on ideal lattices. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol.\u00a05912, pp. 617\u2013635. Springer, Heidelberg (2009)"},{"issue":"2","key":"8_CR50","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1109\/JSAC.2008.080206","volume":"26","author":"C. Studer","year":"2008","unstructured":"Studer, C., Burg, A., B\u00f6lcskei, H.: Soft-output sphere decoding: Algorithms and VLSI implementation. IEEE Journal on Selected Areas in Communications\u00a026(2), 290\u2013300 (2008)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"8_CR51","first-page":"1639","volume":"45","author":"E. Viterbo","year":"1999","unstructured":"Viterbo, E., Boutros, J.: A universal lattice code decoder for fading channels. IEEE TIT\u00a045, 1639\u20131642 (1999)","journal-title":"IEEE TIT"},{"key":"8_CR52","unstructured":"Xilinx: Virtex-5 family overview, http:\/\/www.xilinx.com\/support\/documentation\/virtex-5.htm"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 LATINCRYPT 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14712-8_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T21:53:11Z","timestamp":1711662791000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14712-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642147111","9783642147128"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14712-8_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}