Computability in Europe 2008
Logic and Theory of Algorithms

Print current page  Print this page

Regular Talk:
Modelling Linear Cellular Automata with the minimum stage corresponding to CCSG based on LFSR

Edit abstract data

Author(s): Yoon-Hee Hwang, Sung-Jin Cho, Un-Sook Choi and Han-Doo Kim
Slot: Tue, 11:40-12:00, Room 19 (col. 5)

Abstract

Cellular Automata(CA) with simple, regular, modular and
cascadable structures, which the VLSI design community prefer, was
made an alternative proposal of LFSRs. Pseudorandom sequences were
produced by generators which accompany several LFSRs joined by nonlinear
functions or irregular clocking techniques. Clock-Controlled Shrinking
Generators(CCSGs) are a class of clock-controlled sequence generators.
Clock-controlled LFSRs have become important building blocks
for keystream generators in stream cipher applications, because they are
known to produce sequences of long period and high linear complexity.
In this paper, we propose a method of modelling linear CA with the
minimum stage corresponding to CCSGs based on LFSR using the Cho
et al.'s synthesis algorithm.

websites: Arnold Beckmann 2008-05-19 Valid HTML 4.01! Valid CSS!