Nonlinear Pseudorandom Sequences Based on 90/150 LHGCA

Authors:
Un-Sook Choi;Sung-Jin Cho;Han-Doo Kim;Yoon-Hee Hwang;Seoktae Kim
Affiliations:
Department of Multimedia Engineering, Tongmyong University, Busan, Korea 626-847;Division of Mathematical Sciences, Pukyong National University, Busan, Korea 608-737;School of Computer Aided Science, Institute of Basic Science, Inje University, Gimhae, Korea 621-749;Department of Information Security, Graduate School, Pukyong National University, Busan, Korea 608-737;Division of Electronic, Computer and Telecommunication Engineering, Pukyong National University, Busan, Korea 608-737
Venue:
ACRI '08 Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry
Year:
2008

Citing 3
Cited 0

The shrinking generator

CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Vector Space Theoretic Analysis of Additive Cellular Automata and its Application for Pseudoexhaustive Test Pattern Generation

IEEE Transactions on Computers
New Synthesis of One-Dimensional 90/150 Linear Hybrid Group Cellular Automata

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a stream cipher the plaintext digits are encrypted one at a time, and the transformation of successive digits varies during the encryption. LFSRs produce sequences having large periods and good statistical properties, and are readily analyzed using algebraic techniques. But the output sequences of LFSRs are also easily predictable, if we know proper successive output sequences in output sequences. In this paper, we give a new method which generates nonlinear sequences using maximum-length cellular automata.