{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:21:14Z","timestamp":1743009674649,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030694791"},{"type":"electronic","value":"9783030694807"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-69480-7_8","type":"book-chapter","created":{"date-parts":[[2021,2,12]],"date-time":"2021-02-12T07:04:03Z","timestamp":1613113443000},"page":"67-79","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["EnCash: an Authenticated Encryption scheme using Cellular Automata"],"prefix":"10.1007","author":[{"given":"Tapadyoti","family":"Banerjee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dipanwita","family":"Roy Chowdhury","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,13]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","unstructured":"Banerjee, T., Das, B., Mehta, D., RoyChowdhury, D.: RACE: randomized counter mode of authenticated encryption using cellular automata. In: Obaidat, M.S., Samarati, P. (eds.) Proceedings of the 16th International Joint Conference on e-Business and Telecommunications, ICETE 2019 - Volume 2: SECRYPT, Prague, Czech Republic, 26\u201328 July 2019, pp. 504\u2013509. SciTePress (2019). https:\/\/doi.org\/10.5220\/0007971505040509","DOI":"10.5220\/0007971505040509"},{"key":"8_CR2","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-981-15-0871-4_21","volume-title":"Applications and Techniques in Information Security","author":"T Banerjee","year":"2019","unstructured":"Banerjee, T., Chowdhury, D.R.: On the security of the double-block-length hash function NCASH. In: Shankar Sriram, V.S., Subramaniyaswamy, V., Sasikaladevi, N., Zhang, L., Batten, L., Li, G. (eds.) ATIS 2019. CCIS, vol. 1116, pp. 266\u2013278. Springer, Singapore (2019). https:\/\/doi.org\/10.1007\/978-981-15-0871-4_21"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/3-540-44448-3_24","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2000","author":"M Bellare","year":"2000","unstructured":"Bellare, M., Rogaway, P.: Encode-then-encipher encryption: how to exploit nonces or redundancy in plaintexts for efficient cryptography. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 317\u2013330. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44448-3_24"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Dworkin, M.J.: Recommendation for block cipher modes of operation: Galois\/Counter Mode (GCM) and GMAC. Technical report (2007)","DOI":"10.6028\/NIST.SP.800-38d"},{"issue":"5","key":"8_CR5","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1038\/scientificamerican0573-15","volume":"228","author":"H Feistel","year":"1973","unstructured":"Feistel, H.: Cryptography and computer privacy. Sci. Am. 228(5), 15\u201323 (1973)","journal-title":"Sci. Am."},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/0-387-34799-2_31","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 88","author":"R Forri\u00e9","year":"1990","unstructured":"Forri\u00e9, R.: The strict avalanche criterion: spectral properties of boolean functions and an extended definition. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 450\u2013468. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34799-2_31"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-319-11520-7_8","volume-title":"Cellular Automata","author":"S Ghosh","year":"2014","unstructured":"Ghosh, S., Sengupta, A., Saha, D., Chowdhury, D.R.: A scalable method for constructing non-linear cellular automata with period $$2^n-1$$. In: W\u0105s, J., Sirakoulis, G.C., Bandini, S. (eds.) ACRI 2014. LNCS, vol. 8751, pp. 65\u201374. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11520-7_8"},{"issue":"3","key":"8_CR8","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1080\/0161-110291890885","volume":"26","author":"HM Heys","year":"2002","unstructured":"Heys, H.M.: A tutorial on linear and differential cryptanalysis. Cryptologia 26(3), 189\u2013221 (2002)","journal-title":"Cryptologia"},{"issue":"8","key":"8_CR9","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1109\/43.31545","volume":"8","author":"PD Hortensius","year":"1989","unstructured":"Hortensius, P.D., McLeod, R.D., Pries, W., Miller, D.M., Card, H.C.: Cellular automata-based pseudorandom number generators for built-in self-test. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 8(8), 842\u2013859 (1989)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"8_CR10","unstructured":"McGrew, D., Viega, J.: The Galois\/Counter Mode of operation (GCM). Submission to NIST Modes of Operation Process, vol. 20 (2004)"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/3-540-45830-1_25","volume-title":"Cellular Automata","author":"M Mukherjee","year":"2002","unstructured":"Mukherjee, M., Ganguly, N., Chaudhuri, P.P.: Cellular automata based authentication (CAA). In: Bandini, S., Chopard, B., Tomassini, M. (eds.) ACRI 2002. LNCS, vol. 2493, pp. 259\u2013269. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45830-1_25"},{"key":"8_CR12","unstructured":"NIST: Information Technology Laboratory: CSRC, Block Cipher Techniques: Current Modes (2020). https:\/\/csrc.nist.gov\/projects\/block-cipher-techniques\/bcm\/current-modes. (Created 04 January 2017, Updated 22 June 2020)"},{"key":"8_CR13","volume-title":"Additive Cellular Automata: Theory and Applications","author":"PP Chaudhuri","year":"1997","unstructured":"Chaudhuri, P.P., Chowdhury, D.R., Nandi, S., Chattopadhyay, S.: Additive Cellular Automata: Theory and Applications, vol. 1. Wiley, Hoboken (1997)"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Rukhin, A., Soto, J., Nechvatal, J., Smid, M., Barker, E.: A statistical test suite for random and pseudorandom number generators for cryptographic applications, NIST Special Publication 800\u201322. Technical report, Booz-Allen and Hamilton Inc Mclean Va (2001)","DOI":"10.6028\/NIST.SP.800-22"},{"key":"8_CR15","unstructured":"Saarinen, M.O.: GCM, GHASH and weak keys. IACR Cryptology ePrint Archive. 2011, 202 (2011). http:\/\/eprint.iacr.org\/2011\/202"},{"key":"8_CR16","doi-asserted-by":"publisher","DOI":"10.1201\/9781420057133","volume-title":"Cryptography: Theory and Practice","author":"DR Stinson","year":"2005","unstructured":"Stinson, D.R.: Cryptography: Theory and Practice. CRC Press, Boca Raton (2005)"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/3-540-39799-X_41","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201985 Proceedings","author":"AF Webster","year":"1986","unstructured":"Webster, A.F., Tavares, S.E.: On the design of S-boxes. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 523\u2013534. Springer, Heidelberg (1986). https:\/\/doi.org\/10.1007\/3-540-39799-X_41"},{"key":"8_CR18","unstructured":"Wu, H.: ACORN: a lightweight authenticated cipher (v3). Candidate for the CAESAR Competition (2016). https:\/\/competitions.cr.yp.to\/round3\/acornv3.pdf"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-662-43414-7_10","volume-title":"Selected Areas in Cryptography \u2013 SAC 2013","author":"H Wu","year":"2014","unstructured":"Wu, H., Preneel, B.: AEGIS: a fast authenticated encryption algorithm. In: Lange, T., Lauter, K., Lison\u011bk, P. (eds.) SAC 2013. LNCS, vol. 8282, pp. 185\u2013201. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43414-7_10"}],"container-title":["Lecture Notes in Computer Science","Cellular Automata"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-69480-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,12]],"date-time":"2021-02-12T07:12:19Z","timestamp":1613113939000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-69480-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030694791","9783030694807"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-69480-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"13 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACRI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cellular Automata for Research and Industry","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lodz","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acri2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/acri2020.uni.lodz.pl\/#main","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}