{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:45:56Z","timestamp":1725471956918},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540409298"},{"type":"electronic","value":"9783540409328"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11861201_74","type":"book-chapter","created":{"date-parts":[[2006,10,18]],"date-time":"2006-10-18T02:00:39Z","timestamp":1161136839000},"page":"636-645","source":"Crossref","is-referenced-by-count":0,"title":["Generation of Expander Graphs Using Cellular Automata and Its Applications to Cryptography"],"prefix":"10.1007","author":[{"given":"Debdeep","family":"Mukhopadhyay","sequence":"first","affiliation":[]},{"given":"Dipanwita","family":"RoyChowdhury","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"74_CR1","unstructured":"Goldreich, O.: Candidate One-Way Functions Based on Expander Graphs. Cryptology ePrint Archive, Report 2000\/063 (2000)"},{"key":"74_CR2","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.: New Directions in Cryptography. IEEE Transactions on Information Theory\u00a0(22), 644\u2013654 (1976)","journal-title":"IEEE Transactions on Information Theory"},{"key":"74_CR3","unstructured":"Chaudhuri, P.P., Chowdhury, D.R., Nandi, S., Chattopadhyay, S.: Additive Cellular Automata Theory and its Application, ch. 4, vol.\u00a01. IEEE Computer Society Press, Los Alamitos (1997)"},{"key":"74_CR4","unstructured":"Linial, N., Wigderson, A.: Expander graphs and their applications (2003)"},{"key":"74_CR5","doi-asserted-by":"crossref","unstructured":"Nielsen, M.A.: Introduction to expander graphs (2005)","DOI":"10.1007\/978-3-540-27680-7_1"},{"issue":"3","key":"74_CR6","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF02126799","volume":"8","author":"A. Lubotzky","year":"1988","unstructured":"Lubotzky, A., Phillips, R., Sarnak, P.: Ramanujan graphs. Combinatorica\u00a08(3), 261\u2013277 (1988)","journal-title":"Combinatorica"},{"issue":"4","key":"74_CR7","first-page":"71","volume":"9","author":"G.A. Margulis","year":"1973","unstructured":"Margulis, G.A.: Explicit constructions of expanders. Problemy Pereda\u010di Informacii\u00a09(4), 71\u201380 (1973)","journal-title":"Problemy Pereda\u010di Informacii"},{"issue":"1","key":"74_CR8","first-page":"51","volume":"24","author":"G.A. Margulis","year":"1988","unstructured":"Margulis, G.A.: Explicit group-theoretic constructions of combinatorial schemes and their applications in the construction of expanders and concentrators. Problemy Peredachi Informatsii\u00a024(1), 51\u201360 (1988)","journal-title":"Problemy Peredachi Informatsii"}],"container-title":["Lecture Notes in Computer Science","Cellular Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11861201_74","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,9]],"date-time":"2023-05-09T07:55:33Z","timestamp":1683618933000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11861201_74"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540409298","9783540409328"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/11861201_74","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}