{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T17:48:42Z","timestamp":1758476922339},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642121999"},{"type":"electronic","value":"9783642122002"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12200-2_25","type":"book-chapter","created":{"date-parts":[[2010,4,21]],"date-time":"2010-04-21T13:53:05Z","timestamp":1271857985000},"page":"267-281","source":"Crossref","is-referenced-by-count":3,"title":["Modelling the LLL Algorithm by Sandpiles"],"prefix":"10.1007","author":[{"given":"Manfred","family":"Madritsch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brigitte","family":"Vall\u00e9e","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"25_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.4086\/toc.2008.v004a002","volume":"4","author":"M. Ajtai","year":"2008","unstructured":"Ajtai, M.: Optimal lower bounds for the Korkine-Zolotareff parameters of a lattice and for Schnorr\u2019s algorithm for the shortest vector problem. Theory of Computing\u00a04(1), 21\u201351 (2008)","journal-title":"Theory of Computing"},{"issue":"2","key":"25_CR2","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/S0304-3975(01)00251-1","volume":"287","author":"A. Akhavi","year":"2002","unstructured":"Akhavi, A.: Random lattices, threshold phenomena and efficient reduction algorithms. Theoret. Comput. Sci.\u00a0287(2), 359\u2013385 (2002)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"25_CR3","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1103\/PhysRevLett.59.381","volume":"59","author":"P. Bak","year":"1987","unstructured":"Bak, P., Tang, C., Wiesenfeld, K.: Self-organized criticality: An explanation of the 1\/f noise. Phys. Rev. Lett.\u00a059(4), 381\u2013384 (1987)","journal-title":"Phys. Rev. Lett."},{"issue":"4","key":"25_CR4","doi-asserted-by":"publisher","first-page":"1339","DOI":"10.1109\/18.850673","volume":"46","author":"D. Boneh","year":"2000","unstructured":"Boneh, D., Durfee, G.: Cryptanalysis of RSA with private key d less than N \u2264 0.292. IEEE Trans. Inform. Theory\u00a046(4), 1339\u20131349 (2000)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"25_CR5","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(94)90071-X","volume":"123","author":"H. Daud\u00e9","year":"1994","unstructured":"Daud\u00e9, H., Vall\u00e9e, B.: An upper bound on the average number of iterations of the LLL algorithm. Theoretical Computer Science\u00a0123(1), 95\u2013115 (1994)","journal-title":"Theoretical Computer Science"},{"key":"25_CR6","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.: Predicting Lattice Reduction. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 31\u201351. Springer, Heidelberg (2008)"},{"key":"25_CR7","unstructured":"Georgieva, M.: \u00c9tude exp\u00e9rimentale de l\u2019algorithme LLL sur certaines bases de Coppersmith, Master Thesis, University of Caen (2009)"},{"issue":"2","key":"25_CR8","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0304-3975(93)90122-A","volume":"115","author":"E. Goles","year":"1993","unstructured":"Goles, E., Kiwi, M.A.: Games on line graphs and sandpiles. Theoret. Comput. Sci.\u00a0115(2), 321\u2013349 (1993)","journal-title":"Theoret. Comput. Sci."},{"key":"25_CR9","series-title":"Cambridge Lecture Notes in Physics","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0053958","volume-title":"Emergent complex behavior in physical and biological systems","author":"H.J. Jensen","year":"1998","unstructured":"Jensen, H.J.: Self-organized criticality. In: Emergent complex behavior in physical and biological systems. Cambridge Lecture Notes in Physics, vol.\u00a010. Cambridge University Press, Cambridge (1998)"},{"issue":"4","key":"25_CR10","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(4), 515\u2013534 (1982)","journal-title":"Math. Ann."},{"key":"25_CR11","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. Nguyen","year":"2006","unstructured":"Nguyen, P., 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)"},{"issue":"1","key":"25_CR12","doi-asserted-by":"publisher","first-page":"281","DOI":"10.3934\/dcds.2006.15.281","volume":"15","author":"B. Vall\u00e9e","year":"2006","unstructured":"Vall\u00e9e, B.: Euclidean Dynamics. Discrete and Continuous Dynamical Systems\u00a015(1), 281\u2013352 (2006)","journal-title":"Discrete and Continuous Dynamical Systems"},{"key":"25_CR13","series-title":"Collection Information Security and Cryptography Series","volume-title":"ch.3. The LLL Algorithm","author":"B. Vall\u00e9e","year":"2009","unstructured":"Vall\u00e9e, B., Vera, A.: Probabilistic analyses of lattice reduction algorithms. In: ch.3. The LLL Algorithm. Collection Information Security and Cryptography Series. Springer, Heidelberg (2009)"},{"key":"25_CR14","unstructured":"Vera, A.: Analyses de l\u2019algorithme de Gauss. Applications \u00e0 l\u2019analyse de l\u2019algorithme LLL, PhD Thesis, Universiy of Caen (2009)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2010: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12200-2_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T18:29:28Z","timestamp":1558290568000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12200-2_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642121999","9783642122002"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12200-2_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}