Authors:
Tapadyoti Banerjee
1
;
Bijoy Das
1
;
Deval Mehta
2
and
Dipanwita Roy Chowdhury
1
Affiliations:
1
Indian Institute of Technology Kharagpur and India
;
2
Indian Space Research Organization, SAC Ahmedabad and India
Keyword(s):
Cellular Automata, Authenticated Encryption, AES-GCM, Counter Mode of Operation.
Related
Ontology
Subjects/Areas/Topics:
Applied Cryptography
;
Cryptographic Techniques and Key Management
;
Data and Application Security and Privacy
;
Data Engineering
;
Databases and Data Security
;
Information and Systems Security
;
Privacy
Abstract:
In this paper, we propose a new Randomized Counter mode of Authenticated Encryption using Cellular Automata, named as RACE. AES-GCM, the NIST standard Authenticated Encryption scheme is efficient but it is vulnerable against some of the known attacks. In our design, we try to overcome the limitations of AES-GCM by exploiting the random evolution of Cellular Automata (CA). Here, the CA is used to make counter values randomized instead of sequential values used in AES-GCM. In addition, to produce the Message Authentication Code (MAC), a non-linear CA-based hash-primitive (NASH) is introduced which avoids the complex Galois field multiplication operations of GHASH of AES-GCM. We show that NASH provides more security over GHASH against Cycling Attack. Thus, NASH together with AES makes RACE more secure than AES-GCM with respect to this attack.