{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T21:18:47Z","timestamp":1757452727408,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540545088"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-38424-3_37","type":"book-chapter","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T13:05:56Z","timestamp":1196687156000},"page":"531-544","source":"Crossref","is-referenced-by-count":1,"title":["Complexity Theoretic Issues Concerning Block Ciphers Related to D.E.S."],"prefix":"10.1007","author":[{"given":"Richard","family":"Cleve","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"37_CR1","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/0022-0000(89)90037-8","volume":"38","author":"D. A. Barrington","year":"1989","unstructured":"D. A. Barrington, \u201cBounded-Width Polynomial-Size Branching Programs Recognize Exactly Those Languages in NC1,\u201d J. Computer System Sci. Vol. 38, pp. 150\u2013164, 1989.","journal-title":"J. Computer System Sci."},{"key":"37_CR2","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, and R. Cleve, \u201cComputing Algebraic Formulas Using a Constant Number of Registers,\u201d Proc. 20th Ann. ACM Symp. on Theory of Computing, pp. 254\u2013257, 1988.","DOI":"10.1145\/62212.62236"},{"key":"37_CR3","unstructured":"R. Cleve, Methodologies for Designing Block Ciphers and Cryptographic Protocols (Part I), Ph.D. Thesis, University of Toronto, 1989."},{"issue":"4","key":"37_CR4","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1137\/0129051","volume":"29","author":"Don Coppersmith","year":"1975","unstructured":"D. Coppersmith, and E. Grossman, \u201cGenerators for Certain Alternating Groups with Applications to Cryptography,\u201d SIAM J. Appl. Math., pp. 624\u2013627, 1975.","journal-title":"SIAM Journal on Applied Mathematics"},{"issue":"2","key":"37_CR5","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1147\/JRD.1987.5390134","volume":"31","author":"D. Coppersmith","year":"1987","unstructured":"D. Coppersmith, \u201cCryptography,\u201d IBM J. Res. Develop., Vol. 31, No. 2, pp. 244\u2013248, 1987.","journal-title":"IBM J. Res. Develop."},{"key":"37_CR6","doi-asserted-by":"crossref","unstructured":"S. Even, and O. Goldreich, \u201cDES-Like Functions Can Generate the Alternating Group,\u201d IEEE Trans. on Information Theory, pp. 863\u2013865, 1983.","DOI":"10.1109\/TIT.1983.1056752"},{"issue":"2","key":"37_CR7","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1137\/0217022","volume":"17","author":"M. Luby","year":"1988","unstructured":"Luby, M., and C. Rackoff, \u201cHow to Construct Pseudorandom Permutations From Pseudorandom Functions,\u201d SIAM J. Comput., Vol. 17, No. 2, pp. 373\u2013386, 1988.","journal-title":"SIAM J. Comput."},{"key":"37_CR8","doi-asserted-by":"crossref","unstructured":"E. Biham, and A. Shamir, \u201cDifferential Cryptanalysis of DES-like Cryptosystems,\u201d these proceedings, 1990.","DOI":"10.1007\/BF00630563"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology-CRYPT0\u2019 90"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-38424-3_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T05:10:19Z","timestamp":1737609019000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-38424-3_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540545088"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-38424-3_37","relation":{},"subject":[]}}