B109 Cellular Automata Model for Cryptosystem(Session : Logics and Algorithms (2))

概要

論文の詳細を見る
This paper introduces a Cellular Automata (CA) based symmetric key cryptosystem for block cipher. The scheme is named as CAC (Cellular Automata based Cryptosystem). The CAC employs GF (2^P) CA. The state transition behavior of such a CA is characterized by the theory of Extension Field GF (2^P). Two different classes of group CA marked as Major and Minor CA are utilized to build the cryptosystem. Cryptanalysis of the proposed scheme is reported along with similar analysis for two popular systems-DES and AES. Experimental results confirm that the security of the system is much better than DES and comparable to that of AES. The throughput of encryption/decryption is higher than that of both AES and DES. Moreover, the regular, modular, cascadable structure of CA with local interconnection makes it ideally suitable for VLSI implementation. Such inherent strength of the scheme makes it an ideal candidate to maintain security during online transactions in E-Commerce and digital library.
一般社団法人日本機械学会の論文
2001-11-14