Research indexJournal article
Low hardware complexity encryption algorithm using order 1-D programmable linear cellular automata
Gangadari, Ahamed
1 Feb 2017
NobleIDark:/48914/w1/20260515/5C59D96EDOI10.1109/spin.2017.8049979
Low hardware complexity encryption algorithm using order 1-D programmable linear cellular automata
Gangadari, Ahamed · 2017 · Subscription
NobleIDark:/48914/w1/20260515/5C59D96EDOI10.1109/spin.2017.8049979
The full text is at the publisher
You can read the abstract here, or open it at the publisher.
Abstract
Cryptography play an most essential role in the field of data security. This paper, we proposed cryptographically secure encryption algorithm architecture using order one dimensional programmable linear cellular automata (1 st LCA). This paper also emphasizes on the comparative analysis of hardware utilization for conventional AES algorithm and encryption algorithm using 1 st LCA in terms of power, area and throughput. Moreover, the cryptographic properties like correlation immunity bias, strict avalanche criteria, non linearity and entropy are used to evaluate the level of security provided by AES algorithm and encryption algorithm architecture using LCA. The synthesis results of FPGA shows that the encryption algorithm architecture using 1 st order one dimensional programmable linear cellular automata (1 st LCA) gives better level of security, low power consumption, high efficiency compared to that of standard AES algorithm. The proposed encryption algorithm attained a throughput of 1.33 Gbps and high operating frequency of 534 MHz compared with existing designs.