{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T16:17:43Z","timestamp":1772727463237,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540602217","type":"print"},{"value":"9783540447504","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-44750-4_34","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T04:39:53Z","timestamp":1187239193000},"page":"424-437","source":"Crossref","is-referenced-by-count":65,"title":["Quantum Cryptanalysis of Hidden Linear Functions"],"prefix":"10.1007","author":[{"given":"Dan","family":"Boneh","sequence":"first","affiliation":[]},{"given":"Richard J.","family":"Lipton","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,13]]},"reference":[{"key":"34_CR1","unstructured":"R. Beals, Computing Fourier Transform over S n in QP, unpublished manuscript."},{"key":"34_CR2","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1147\/rd.176.0525","volume":"17","author":"C. Bennett","year":"1973","unstructured":"C. Bennett, Logical reversibility of computation, IBM J. Res. Develop. vol. 17, 1973, pp. 525\u2013532.","journal-title":"IBM J. Res. Develop."},{"key":"34_CR3","unstructured":"C. Bennett, E. Bernstein, G. Brassard, U. Vazirani, Strengths and Weaknesses of Quantum Computing, to appear."},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"E. Bernstein and U. Vazirani, Quantum Complexity Theory, Proc. 25th ACM Symp. on Theory of Computation, 1993.","DOI":"10.1145\/167088.167097"},{"key":"34_CR5","unstructured":"D. Coppersmith, An Approximate Fourier Transform Useful in Quantum Factoring, IBM Research Report 19642, 1994."},{"issue":"6","key":"34_CR6","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"W. Diffie and M. Hellman, New Directions in Cryptography, IEEE transactions on Information Theory, vol. 22, no. 6, pp. 644\u2013654, 1976.","journal-title":"IEEE transactions on Information Theory"},{"key":"34_CR7","doi-asserted-by":"publisher","first-page":"203","DOI":"10.2307\/2007884","volume":"48","author":"N. Koblitz","year":"1987","unstructured":"N. Koblitz, Elliptic Curve Cryptosystems, Mathematics of Computations 48, 1987, pp. 203\u2013209.","journal-title":"Mathematics of Computations"},{"key":"34_CR8","unstructured":"S. Lang, Algebra."},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"U. Maurer and Y. Yacobi, Non-interactive public-key cryptography, EuroCrypt91, pp.498\u2013507, 1991.","DOI":"10.1007\/3-540-46416-6_43"},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"K. McCurley, A Key Distribution System Equivalent to Factoring, Journal of Cryptology, vol. 1, no. 2, pp. 95\u2013105.","DOI":"10.1007\/BF02351718"},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"V. Miller, Uses of Elliptic Curves in Cryptography, In Proceedings of Crypto 1985, pp. 417\u2013426.","DOI":"10.1007\/3-540-39799-X_31"},{"key":"34_CR12","unstructured":"B. Preneel, R. Govaerts, J. Vandewalle, Hash Functions Based on Block Ciphers: A Synthetic Approach, in Proc. of Advances in Cryptology, CRYPTO\u2019 93."},{"key":"34_CR13","doi-asserted-by":"crossref","unstructured":"J. P. Serre, Linear Representations of Finite Groups, Springer-Verlag, 1977.","DOI":"10.1007\/978-1-4684-9458-7"},{"key":"34_CR14","doi-asserted-by":"crossref","unstructured":"D. Simon, On the Power of Quantum Computation, Proc. FOCS, 1994, pp. 116\u2013123.","DOI":"10.1109\/SFCS.1994.365701"},{"key":"34_CR15","unstructured":"P. Shor, Algorithms for Quantum Computation, Proc. FOCS, 1994, pp. 124\u2013134."},{"key":"34_CR16","doi-asserted-by":"crossref","unstructured":"L. Washington, Introduction to Cyclotomic Fields, Springer-Verlag, 1982.","DOI":"10.1007\/978-1-4684-0133-2"},{"issue":"2","key":"34_CR17","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF02351719","volume":"1","author":"J. Buchmann","year":"1988","unstructured":"J. Buchmann and H. Williams, A Key Exchange System Based on Imaginary Quadratic Fields, Journal of Cryptology, vol. 1, no. 2, pp. 107\u2013118, 1988.","journal-title":"Journal of Cryptology"},{"key":"34_CR18","unstructured":"A. Yao, Quantum Circuit Complexity, Proc. 34th IEEE Symp. on Foundations of Computer Science, 1993, pp. 352\u2013360."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPT0\u2019 95"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44750-4_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T00:18:54Z","timestamp":1556756334000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44750-4_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602217","9783540447504"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-44750-4_34","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1995]]}}}