Generating Cryptographically Suitable Non-linear Maximum Length Cellular Automata

2010 ◽  
pp. 241-250 ◽  
Author(s):  
Sourav Das ◽  
Dipanwita Roy Chowdhury
Keyword(s):  
Cellular Automata ◽  
Maximum Length ◽  
Non Linear

Computing Phase Shifts of Maximum-Length 90/150 Cellular Automata Sequences

2004 ◽  
pp. 31-39 ◽  
Author(s):  
Sung-Jin Cho ◽  
Un-Sook Choi ◽  
Yoon-Hee Hwang ◽  
Han-Doo Kim ◽  
Yong-Soo Pyo ◽  
...  
Keyword(s):  
Cellular Automata ◽  
Phase Shifts ◽  
Maximum Length

Maximum-length sequences, cellular automata, and random numbers

1987 ◽  
Vol 71 (2) ◽  
pp. 391-428 ◽  
Author(s):  
A Compagner ◽  
A Hoogland
Keyword(s):  
Cellular Automata ◽  
Maximum Length ◽  
Random Numbers

Characterization of Non-linear Cellular Automata Model for Pattern Recognition

2002 ◽  
pp. 214-220 ◽  
Author(s):  
Niloy Ganguly ◽  
Pradipta Maji ◽  
Arijit Das ◽  
Biplab K. Sikdar ◽  
P. Pal Chaudhuri
Keyword(s):  
Pattern Recognition ◽  
Cellular Automata ◽  
Cellular Automata Model ◽  
Non Linear

scholarly journals Recovering Decimation-Based Cryptographic Sequences by Means of Linear CAs

2019 ◽  
Vol 28 (4) ◽  
pp. 430-448
Author(s):  
Sara D Cardell ◽  
Diego F Aranha ◽  
Amparo Fúster-Sabater
Keyword(s):  
Cellular Automata ◽  
Linear Structures ◽  
Elementary Cellular Automata ◽  
Non Linear ◽  
Sequence Generator ◽  
M Sequences

Abstract The sequences produced by the cryptographic sequence generator known as the shrinking generator can be modelled as the output sequences of linear elementary cellular automata (CA). These sequences are composed of interleaved m-sequences produced by linear structures based on feedback shifts. This profitable characteristic can be used in the cryptanalysis of this generator. In this work we propose an algorithm that takes advantage of the inherent linearity of these CA and the interleaved m-sequences. Although irregularly decimated generators have been conceived and designed as non-linear ones, in practice they can be easily analysed in terms of simple linear structures.

scholarly journals CellTCS:A Secure Threshold Cryptography Scheme based on Non-linear Hybrid Cellular Automata

2012 ◽  
Vol 6 ◽  
pp. 947-953 ◽  
Author(s):  
Jyoti Jakhar ◽  
Pami Dey ◽  
M. Dutta ◽  
D.K. Bhattacharyya
Keyword(s):  
Cellular Automata ◽  
Threshold Cryptography ◽  
Hybrid Cellular Automata ◽  
Non Linear ◽  
Linear Hybrid Cellular Automata

scholarly journals Encryption and Decryption algorithm using two dimensional cellular automata rules in Cryptography

2011 ◽  
pp. 18-23
Author(s):  
Sambhu Prasad Panda ◽  
Madhusmita Sahu ◽  
Umesh Prasad Rout ◽  
Surendra Kumar Nanda
Keyword(s):  
Cellular Automata ◽  
Periodic Boundary ◽  
Block Cipher ◽  
Two Dimensional ◽  
Substitution Box ◽  
Plain Text ◽  
Cipher Text ◽  
Xor Operation ◽  
Encryption And Decryption ◽  
Non Linear

In this paper we present a new encryption and decryption algorithm for block cipher based on the linear (periodic boundary-PB) and nonlinear cellular automata rules. First we apply non linear CA rules (complements) to both plain text and key. Then PB CA rule is applied to the above results separately followed by the XOR operation of above results. After that the result of XOR operation is fed to substitution box(S-box) and again PB CA rules are applied followed by SBox. The decryption process is carried out just similar to that of encryption but in the reverse way. Both the process of encryption and decryption is performed for 8 number of rounds in order to avoid the dependency between the plain text and cipher text so that the our proposed algorithm is more secure than that of AES and DES algorithms.

Sign in / Sign up

Export Citation Format

Share Document