Theory of Composing Non-linear Machines with Predictable Cyclic Structures

Authors:
Debdeep Mukhopadhyay;Dipanwita Roychowdhury;Chester Rebeiro
Affiliations:
Assistant Professor, Department of Computer Science and Engg., Indian Institute of Technology, Kharagpur, India;Professor, Department of Computer Science and Engg., Indian Institute of Technology, Kharagpur, India;MS Student, Department of Computer Sc and Engg., Indian Institute of Technology, Madras, India
Venue:
ACRI '08 Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry
Year:
2008

Citing 6
Cited 2

Systematic generation of cryptographically robust S-boxes

CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Theory and Applications of Cellular Automata in Cryptography

IEEE Transactions on Computers
Predicting nonlinear cellular automata quickly by decomposing them into linear ones

Physica D
Comments on "Theory and Applications of Cellular Automata in Cryptography"

IEEE Transactions on Computers
Efficient Implementation of Cryptographically Useful 'Large' Boolean Functions

IEEE Transactions on Computers
Design and Analysis of a Robust and Efficient Block Cipher using Cellular Automata

AINA '06 Proceedings of the 20th International Conference on Advanced Information Networking and Applications - Volume 02

Cellular Automata-Based S-Boxes vs. DES S-Boxes

PaCT '09 Proceedings of the 10th International Conference on Parallel Computing Technologies
Properties of safe cellular automata-based S-boxes

PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper proposes construction techniques for group non-linear Cellular Automata (CA) composing smaller non-linear invertible CA with linear group CA. We prove that such a scheme generates machines with state transitions having predictable cyclic properties. We show that with appropriate choice of the rules of the linear CA we may obtain invertible, balanced Boolean mappings with strong non-linearity. Extensive experimental results are provided to support the claims made.