|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 110 - Issue 12 |
| Published: January 2015 |
| Authors: K. J. Jegadish Kumar, V. Karthick |
10.5120/19371-1085
|
K. J. Jegadish Kumar, V. Karthick . AES S-Box Construction using One Dimensional Cellular Automata Rules. International Journal of Computer Applications. 110, 12 (January 2015), 35-39. DOI=10.5120/19371-1085
@article{ 10.5120/19371-1085,
author = { K. J. Jegadish Kumar,V. Karthick },
title = { AES S-Box Construction using One Dimensional Cellular Automata Rules },
journal = { International Journal of Computer Applications },
year = { 2015 },
volume = { 110 },
number = { 12 },
pages = { 35-39 },
doi = { 10.5120/19371-1085 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2015
%A K. J. Jegadish Kumar
%A V. Karthick
%T AES S-Box Construction using One Dimensional Cellular Automata Rules%T
%J International Journal of Computer Applications
%V 110
%N 12
%P 35-39
%R 10.5120/19371-1085
%I Foundation of Computer Science (FCS), NY, USA
S-Box is the only non-linear component in Advanced Encryption Standard(AES) which determine its strength. The Look-Up Table based S-Box of conventional AES occupies large storage space, reduced throughput and consumes more power. This article presents the design of an S-Box based on Reversible Cellular Automata function that reduces the implementation cost. Further, Cellular Automata functions are derived from various rules that are non-linear and S-Box properties are discussed briefly in this paper. With this approach, the time consumption for the AES S-Box is considerably decreased without compromising the non-linearity of conventional S-Box.