B108 Cellular Automata Based Cryptosystem Employing Galois Field (2^P) Algebra(Session : Logics and Algorithms (2))
スポンサーリンク
概要
- 論文の詳細を見る
The present paper describes a ciphering scheme, which introduces a random key generator using Cellular Automata (CA) in the Galois Field (28). The scheme develops a two level encryption strategy. The first level utilises the randomness generated by GF (2^8) CA whereas the second level encrypts the data by multiplication under GF (2^8). The two level encryption increases security as well as is very well suited for VLSI design for its cellular structure.
- 一般社団法人日本機械学会の論文
- 2001-11-14
著者
-
Chowdhury D.
Department Of Computer Science And Engineering Indian Institute Of Technology
-
Mukhopadhyay Debdeep
Department of Computer Science and Engineering Indian Institute of Technology
関連論文
- B107 Testing of Embedded Core Based Systems Using Linear CeIIular Automata(Session : Logics and Algorithms (2))
- B108 Cellular Automata Based Cryptosystem Employing Galois Field (2^P) Algebra(Session : Logics and Algorithms (2))