On the Use of Cellular Automata in Symmetric Cryptography

Details On the Use of Cellular Automata in Symmetric Cryptography On the Use of Cellular Automata in Symmetric Cryptography

2010-05-11

arxiv.org/abs/1005.1771v1

Acta Applicandae Mathematicae. Volume 93, Numbers 1-3, pp. 215-236. Sept 2006. Springer.

Computer Science

Cryptography and Security

25 pages, 0 figures

Scientific paper

10.1007/s10440-006-9041-6

In this work, pseudorandom sequence generators based on finite fields have been analyzed from the point of view of their cryptographic application. In fact, a class of nonlinear sequence generators has been modelled in terms of linear cellular automata. The algorithm that converts the given generator into a linear model based on automata is very simple and is based on the concatenation of a basic structure. Once the generator has been linearized, a cryptanalytic attack that exploits the weaknesses of such a model has been developed. Linear cellular structures easily model sequence generators with application in stream cipher cryptography.

Affiliated with

Also associated with

No associations

Rating

On the Use of Cellular Automata in Symmetric Cryptography does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Use of Cellular Automata in Symmetric Cryptography, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Use of Cellular Automata in Symmetric Cryptography will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-384131