Non-linear and non-group cellular automata chaining technique for cryptographic applications

Authors:
Jun-Cheol Jeon
Affiliations:
Department of Information Security at Woosuk University, Jeonbuk 565-701, Republic of Korea
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
2010

Citing 4
Cited 0

Role-based access control on the web

ACM Transactions on Information and System Security (TISSEC)
Cellular automata transforms: theory and applications in multimedia compression, encryption, and modeling

Cellular automata transforms: theory and applications in multimedia compression, encryption, and modeling
Role-Based Access Control

Role-Based Access Control
Theory of Self-Reproducing Automata

Theory of Self-Reproducing Automata

Quantified Score

Hi-index	0.98

Visualization

Abstract

The current study outlines the behavior of non-linear and non-group cellular automata having periodic boundary conditions. We find a CA having enough unique states which is called a length, and extract particular states from the CA based on some properties, i.e., Hamming distance, frequency, and run-up and run-down. The extracted states can be alternatively used for cryptographic applications which demand integrity and authentication of identities such as a one-time password scheme.