{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,8]],"date-time":"2026-10-08T16:29:02Z","timestamp":1791476942988,"version":"4.3.4"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540594093","type":"print"},{"value":"9783540492641","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-49264-x_9","type":"book-chapter","created":{"date-parts":[[2007,8,7]],"date-time":"2007-08-07T02:52:09Z","timestamp":1186455129000},"page":"106-120","source":"Crossref","is-referenced-by-count":81,"title":["A Block Lanczos Algorithm for Finding Dependencies over GF(2)"],"prefix":"10.1007","author":[{"given":"Peter L.","family":"Montgomery","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2001,7,13]]},"reference":[{"key":"9_CR1","unstructured":"Henk Boender, Private communication, 1994."},{"key":"9_CR2","first-page":"57","volume":"26A","author":"R. P. Brent","year":"1988","unstructured":"Richard P. Brent and Brendan D. McKay, On determinants of random symmetric matrices over \u2124m, Ars Combinatoria 26A (1988), 57\u201364.","journal-title":"Ars Combinatoria"},{"key":"9_CR3","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/BFb0091539","volume-title":"The Development of the Number Field Sieve","author":"J.P. Buhler","year":"1993","unstructured":"J.P. Buhler, H.W. Lenstra, Jr., and Carl Pomerance, Factoring integers with the number field sieve, The Development of the Number Field Sieve (Berlin) (A.K. Lenstra and H.W. Lenstra, Jr., eds.), Lecture Notes in Mathematics, vol. 1554, Springer-Verlag, Berlin, 1993, pp. 50\u201394."},{"key":"9_CR4","unstructured":"Scott Contini and Arjen K. Lenstra, Implementation of blocked Lanczos and Wiedemann algorithms, In preparation, 1995."},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0024-3795(93)90235-G","volume":"192","author":"D. Coppersmith","year":"1993","unstructured":"Don Coppersmith, Solving linear equations over GF(2): Block Lanczos algorithm, Linear Algebra and its Applications 192 (1993), 33\u201360.","journal-title":"Linear Algebra and its Applications"},{"issue":"205","key":"9_CR6","doi-asserted-by":"publisher","first-page":"333","DOI":"10.2307\/2153413","volume":"62","author":"D. Coppersmith","year":"1994","unstructured":"_____, Solving homogeneous linear equations over GF(2) via block Wiedemann algorithm, Mathematics of Computation 62 (1994), no. 205, 333\u2013350.","journal-title":"Mathematics of Computation"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01840433","volume":"1","author":"D. Coppersmith","year":"1986","unstructured":"Don Coppersmith, Andrew M. Odlyzko, and Richard Schroeppel, Discrete logarithms in GF(p), Algorithmica 1 (1986), 1\u201315.","journal-title":"Algorithmica"},{"key":"9_CR8","volume-title":"Lanczos algorithms for large symmetric eigenvalue computations. Vol. I Theory","author":"J. K. Cullum","year":"1985","unstructured":"Jane K. Cullum and Ralph A. Willoughby, Lanczos algorithms for large symmetric eigenvalue computations. Vol. I Theory, Birkh\u00e4user, Boston, 1985."},{"key":"9_CR9","volume-title":"The Art of Computer Programming","author":"D. E. Knuth","year":"1981","unstructured":"Donald E. Knuth, Seminumerical algorithms, The Art of Computer Programming, vol. 2, Addison-Wesley, Reading, MA, 2nd ed., 1981.","edition":"2nd ed."},{"key":"9_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/3-540-38424-3_8","volume-title":"Advances in Cryptology, CRYPTO\u2019 90","author":"B.A. LaMacchia","year":"1991","unstructured":"B.A. LaMacchia and A.M. Odlyzko, Solving large sparse systems over finite fields, Advances in Cryptology, CRYPTO\u2019 90 (A.J. Menezes and S.A. Vanstone, eds.), Lecture Notes in Computer Science, vol. 537, Springer-Verlag, pp. 109\u2013133."},{"issue":"203","key":"9_CR11","doi-asserted-by":"publisher","first-page":"319","DOI":"10.2307\/2152957","volume":"61","author":"A.K. Lenstra","year":"1993","unstructured":"A.K. Lenstra, H.W. Lenstra, Jr., M.S. Manasse, and J.M. Pollard, The factorization of the ninth Fermat number, Mathematics of Computation 61 (1993), no. 203, 319\u2013349.","journal-title":"Mathematics of Computation"},{"key":"9_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/3-540-39757-4_20","volume-title":"Advances in Cryptology: Proceedings of EUROCRYPT 84","author":"A.M. Odlyzko","year":"1985","unstructured":"A.M. Odlyzko, Discrete logarithms in finite fields and their cryptographic significance, Advances in Cryptology: Proceedings of EUROCRYPT 84 (New York) (T. Beth, N. Cot, and I. Ingemarsson, eds.), Lecture Notes in Computer Science, vol. 209, Springer-Verlag, pp. 224\u2013314."},{"key":"9_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/3-540-39757-4_17","volume-title":"Advances in Cryptology, Proceedings of EUROCRYPT 84","author":"C. Pomerance","year":"1985","unstructured":"Carl Pomerance, The quadratic sieve factoring algorithm, Advances in Cryptology, Proceedings of EUROCRYPT 84 (New York) (T. Beth, N. Cot, and I. Ingemarsson, eds.), Lecture Notes in Computer Science, vol. 209, Springer-Verlag, pp. 169\u2013182."},{"issue":"177","key":"9_CR14","doi-asserted-by":"publisher","first-page":"329","DOI":"10.2307\/2007894","volume":"48","author":"R. D. Silverman","year":"1987","unstructured":"Robert D. Silverman, The multiple polynomial quadratic sieve, Mathematics of Computation 48 (1987), no. 177, 329\u2013339.","journal-title":"Mathematics of Computation"},{"issue":"1","key":"9_CR15","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1109\/TIT.1986.1057137","volume":"32","author":"D. H. Wiedemann","year":"1986","unstructured":"Douglas H. Wiedemann, Solving sparse linear equations over finite fields, IEEE Trans. Inform. Theory 32 (1986), no. 1, 54\u201362.","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT \u201995"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49264-X_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,20]],"date-time":"2019-02-20T21:43:49Z","timestamp":1550699029000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49264-X_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540594093","9783540492641"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-49264-x_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1995]]}}}