By Topic

A fast and secure stream cipher based on cellular automata over GF(q)

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
M. Mihaljevic ; Acad. of Sci. & Arts, Belgrade, Yugoslavia ; Yuliang Zheng ; H. Imai

The problem of designing a family of pseudorandom number generators for cryptographic applications, called key stream generators, is considered for word-oriented CPU platforms. A novel key stream generator, together with a new application of linear cellular automata over GF(q), is proposed. Construction of the generator is based on the use of previously published results on cellular automata theory and its applications in cryptography, as well as on core principles employed in a number of existing key stream generators. Analysis indicates that the proposed generator satisfies standard minimal security requirements including a large period and good statistical properties, and that it is secure against all known attacks. An important feature of the proposed generator is that it, is compact and suitable for high speed applications

Published in:

Global Telecommunications Conference, 1998. GLOBECOM 1998. The Bridge to Global Integration. IEEE  (Volume:6 )

Date of Conference: