Paper 2005/396

Design and Analysis of a Robust and Efficient Block Cipher using Cellular Automata

Pallavi Joshi, Debdeep Mukhopadhyay, and Dipanwita RoyChowdhury

Abstract

Cellular Automaton (CA) has been shown to be capable of generating complex and random patterns out of simple rules. There has been constant efforts of applying CA to develop ciphers, but the attempts have not been successful. This paper describes how repeated application of simple CA transforms may be used to achieve confusion and diffusion, needed in block ciphers. The components have been evaluated for their robustness against conventional cryptanalysis and the results have been found to be comparable to standards. Finally, the parts are assembled in an unconventional way to construct a self-invertibe CA based round, which is resistant against linear and differential cryptanalysis and yet can be efficiently implemented.

Metadata
Available format(s)
PDF PS
Category
Secret-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Keywords
block cipherscryptanalysisboolean functions
Contact author(s)
debdeep @ vlsi iitkgp ernet in
History
2005-11-05: received
Short URL
https://ia.cr/2005/396
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2005/396,
      author = {Pallavi Joshi and Debdeep Mukhopadhyay and Dipanwita RoyChowdhury},
      title = {Design and Analysis of a Robust and Efficient Block Cipher using Cellular Automata},
      howpublished = {Cryptology ePrint Archive, Paper 2005/396},
      year = {2005},
      note = {\url{https://eprint.iacr.org/2005/396}},
      url = {https://eprint.iacr.org/2005/396}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.