On the Use of Cellular Automata in Symmetric Cryptography
Copyright policy )On the Use of Cellular Automata in Symmetric Cryptography
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.
25 pages, 0 figures
FOS: Computer and information sciences, Computer Science - Cryptography and Security, H.2.3, Discrete Mathematics (cs.DM), Cryptography and Security (cs.CR), Computer Science - Discrete Mathematics
FOS: Computer and information sciences, Computer Science - Cryptography and Security, H.2.3, Discrete Mathematics (cs.DM), Cryptography and Security (cs.CR), Computer Science - Discrete Mathematics
citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).28 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!