{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:25:04Z","timestamp":1725488704312},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540546207"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-46416-6_37","type":"book-chapter","created":{"date-parts":[[2007,8,6]],"date-time":"2007-08-06T18:02:07Z","timestamp":1186423327000},"page":"431-445","source":"Crossref","is-referenced-by-count":1,"title":["A Construction for One Way Hash Functions and Pseudorandom Bit Generators"],"prefix":"10.1007","author":[{"given":"Babak","family":"Sadeghiyan","sequence":"first","affiliation":[]},{"given":"Josef","family":"Pieprzyk","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"37_CR1","doi-asserted-by":"crossref","unstructured":"Selim G. Akl. On the security of compressed encoding. In Advances in Cryptology-CRYPTO\u2019 83, pages 209\u2013230. Plenum Publishing Corporation, 1983.","DOI":"10.1007\/978-1-4684-4730-9_18"},{"issue":"2","key":"37_CR2","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1137\/0217013","volume":"17","author":"W. Alexi","year":"1988","unstructured":"W. Alexi, B. Chor, O. Goldreich, and C. P. Schnorr. RSA and Rabin functions: Certain parts are as hard as the whole. SIAM Journal on Computing, 17(2):194\u2013209, 1988.","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"37_CR3","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudo-random bits. SIAM Journal on Computing, 13(4):850\u2013864, 1984.","journal-title":"SIAM Journal on Computing"},{"key":"37_CR4","unstructured":"L. Brown. A proposed design for an extended DES. In Computer Security in the Age of Information. North-Holland, 1989. Proceedings of the Fifth IFIP International Conference on computer Security, IFIP\/Sec\u2019 88."},{"key":"37_CR5","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"J. L. Carter","year":"1979","unstructured":"J. L. Carter and M. N. Wegman. Universal classes of hash functions. Journal of Computer and System Sciences, 18:143\u2013154, 1979.","journal-title":"Journal of Computer and System Sciences"},{"key":"37_CR6","unstructured":"D. Coppersmith. Analysis of ISO\/CCITT Document X.509 Annex D, 1989."},{"key":"37_CR7","series-title":"Lect Notes Comput Sci","first-page":"203","volume-title":"Advances in Cryptology-EUROCRYPT\u2019 87","author":"I. B. Damgard","year":"1987","unstructured":"I. B. Damgard. Collision free hash functions and public key signature schemes. In Advances in Cryptology-EUROCRYPT\u2019 87, volume 304 of Lecture Notes in Computer Science, pages 203\u2013216. Springer-Verlag, 1987."},{"key":"37_CR8","series-title":"Lect Notes Comput Sci","first-page":"416","volume-title":"Advances in Cryptology-CRYPTO\u2019 89","author":"I. B. Damgard","year":"1989","unstructured":"I. B. Damgard. A design principle for hash functions. In Advances in Cryptology-CRYPTO\u2019 89, volume 435 of Lecture Notes in Computer Science, pages 416\u2013427. Springer-Verlag, 1989."},{"issue":"4","key":"37_CR9","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1145\/358027.358052","volume":"27","author":"D. E. Denning","year":"1984","unstructured":"D. E. Denning. Digital signatures with RSA and other public-key cryptosystems. Communications of the ACM, 27(4):388\u2013392, 1984.","journal-title":"Communications of the ACM"},{"key":"37_CR10","series-title":"Lect Notes Comput Sci","first-page":"218","volume-title":"Advances in Cryptology-EUROCRYPT\u2019 87","author":"M. Girault","year":"1987","unstructured":"M. Girault. Hash-functions using modulo-n operations. In Advances in Cryptology-EUROCRYPT\u2019 87, volume 304 of Lecture Notes in Computer Science, pages 218\u2013226. Springer-Verlag, 1987."},{"issue":"4","key":"37_CR11","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions. Journal of the ACM, 33(4):792\u2013807, 1986.","journal-title":"Journal of the ACM"},{"key":"37_CR12","doi-asserted-by":"crossref","unstructured":"O. Goldreich and L. A. Levin. A hard-core predicate for all one-way functions. In the 21st ACM Symposium on Theory of Computing, pages 25\u201332, 1989.","DOI":"10.1145\/73007.73010"},{"key":"37_CR13","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo, L. A. Levin, and M. Luby. Pseudo-random generation from one-way functions. In the 21st ACM Symposium on Theory of Computing, pages 12\u201324, 1989.","DOI":"10.1145\/73007.73009"},{"key":"37_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/3-540-39799-X_3","volume-title":"Advances in Cryptology-CRYPTO\u2019 85","author":"W. Jonge De","year":"1985","unstructured":"W. De Jonge and D. Chaum. Attacks on some RSA signatures. In Advances in Cryptology-CRYPTO\u2019 85, volume 218 of Lecture Notes in Computer Science, pages 18\u201327. Springer-Verlag, 1985."},{"key":"37_CR15","series-title":"Lect Notes Comput Sci","first-page":"49","volume-title":"Advances in Cryptology-CRYPTO\u2019 86","author":"W. Jonge De","year":"1986","unstructured":"W. De Jonge and D. Chaum. Some variations on RSA signatures and their security. In Advances in Cryptology-CRYPTO\u2019 86, volume 263 of Lecture Notes in Computer Science, pages 49\u201359. Springer-Verlag, 1986."},{"issue":"2","key":"37_CR16","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1109\/MNET.1987.6434187","volume":"1","author":"R. R. Jueneman","year":"1987","unstructured":"R. R. Jueneman. Electronic document authentication. IEEE Network Magazine, 1(2):17\u201323, 1987.","journal-title":"IEEE Network Magazine"},{"issue":"10","key":"37_CR17","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1109\/TC.1979.1675242","volume":"28","author":"J. B. Kam","year":"1979","unstructured":"J. B. Kam and G. I. Davida. Structured design of substitution-permutation encryption networks. IEEE Transactions on Computers, 28(10):747\u2013753, 1979.","journal-title":"IEEE Transactions on Computers"},{"issue":"10A","key":"37_CR18","first-page":"5658","volume":"27","author":"S. M. Matyas","year":"1985","unstructured":"S. M. Matyas, C. H. Meyer, and J. Oseas. Generating strong one-way functions with cryptographic algorithm. IBM Technical Disclosure Bulletin, 27(10A):5658\u20135659, 1985.","journal-title":"IBM Technical Disclosure Bulletin"},{"key":"37_CR19","series-title":"Lect Notes Comput Sci","first-page":"428","volume-title":"Advances in Cryptology-CRYPTO\u2019 89","author":"R. C. Merkle","year":"1989","unstructured":"R. C. Merkle. One way hash functions and DES. In Advances in Cryptology-CRYPTO\u2019 89, volume 435 of Lecture Notes in Computer Science, pages 428\u2013446. Springer-Verlag, 1989."},{"key":"37_CR20","doi-asserted-by":"crossref","unstructured":"S. Miyaguchi, K. Ohta, and M. Iwata. Confirmation that some hash functions are not collision free. In Abstracts of EUROCRYPT\u2019 90, pages 293\u2013308, 1990.","DOI":"10.1007\/3-540-46877-3_30"},{"issue":"5","key":"37_CR21","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1109\/5.4444","volume":"76","author":"J. H. Moore","year":"1988","unstructured":"J. H. Moore. Protocol failures in cryptosystems. Proceedings of the IEEE, 76(5):594\u2013601, 1988.","journal-title":"Proceedings of the IEEE"},{"key":"37_CR22","doi-asserted-by":"crossref","unstructured":"Moni Naor and Moti Yung. Universal one-way hash functions and their cryptographic applications. In the 21st ACM Symposium on Theory of Computing, pages 33\u201343, 1989.","DOI":"10.1145\/73007.73011"},{"key":"37_CR23","unstructured":"J. Quisquater and M. Girault. 2n-bit hash functions using n-bit symmetric block cipher algorithms. In Abstracts of EUROCRYPT\u2019 89, 1989."},{"key":"37_CR24","doi-asserted-by":"crossref","unstructured":"J. Rompel. One-way functions are necessary and sufficient for secure signatures. In the 22nd ACM Symposium on Theory of Computing, pages 387\u2013394, 1990.","DOI":"10.1145\/100216.100269"},{"key":"37_CR25","doi-asserted-by":"crossref","unstructured":"A. De Santis and M. Yung. On the design of provably-secure cryptographic hash functions. In Abstracts of EUROCRYPT\u2019 90, pages 377\u2013397, 1990.","DOI":"10.1007\/3-540-46877-3_37"},{"key":"37_CR26","series-title":"Lect Notes Comput Sci","first-page":"523","volume-title":"Advances in Cryptology-CRYPTO\u2019 85","author":"A. F. Webster","year":"1985","unstructured":"A. F. Webster and S. E. Tavares. On the design of S-boxes. In Advances in Cryptology-CRYPTO\u2019 85, Lecture Notes in Computer Science, pages 523\u2013534. Springer-Verlag, 1985."},{"key":"37_CR27","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","volume":"22","author":"M. N. Wegman","year":"1981","unstructured":"M. N. Wegman and J. L. Carter. New hash functions and their use in authentication and set equality. Journal of Computer and System Sciences, 22:265\u2013279, 1981.","journal-title":"Journal of Computer and System Sciences"},{"key":"37_CR28","doi-asserted-by":"crossref","unstructured":"R. S. Winternitz. Producing a one-way hash function from DES. In Advances in Cryptology-CRYPTO\u2019 83, pages 203\u2013207. Plenum Publishing Corporation, 1983.","DOI":"10.1007\/978-1-4684-4730-9_17"},{"key":"37_CR29","doi-asserted-by":"crossref","unstructured":"R. S. Winternitz. A secure one-way hash function built from DES. In the 1984 IEEE Symposium on Security and Privacy, 1984.","DOI":"10.1109\/SP.1984.10027"},{"key":"37_CR30","doi-asserted-by":"crossref","unstructured":"A. C. Yao. Theory and applications of trapdoor functions. In the 23rd IEEE Symposium on the Foundations of Computer Science, pages 80\u201391, 1982.","DOI":"10.1109\/SFCS.1982.45"},{"key":"37_CR31","doi-asserted-by":"crossref","unstructured":"Y. Zheng, T. Matsumoto, and H. Imai. Duality between Two Cryptographic Primitives. In the 8th International Conference on Applied Algebra, Algebraic Algorithms and Error Correcting Codes, page 15, 1990.","DOI":"10.1007\/3-540-54195-0_66"},{"key":"37_CR32","unstructured":"Y. Zheng, T. Matsumoto, and H. Imai. Structural properties of one-way hash-functions. In CRYPTO\u2019 90, pages 263\u2013280, 1990."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT \u201991"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46416-6_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:11:30Z","timestamp":1605647490000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46416-6_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540546207"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/3-540-46416-6_37","relation":{},"subject":[]}}