|Authors:||Mihaljević, Miodrag J.
|Affiliations:||Mathematical Institute of the Serbian Academy of Sciences and Arts||Title:||A family of fast keystream generators based on programmable linear cellular automata over GF (q) and time-variant table||Journal:||IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences||Volume:||E82-A||Issue:||1||First page:||32||Last page:||39||Issue Date:||1-Jan-1999||Rank:||M22||ISSN:||0916-8508||Abstract:||
A novel family of keystream generators is proposed employing a linear cellular automata over GF (q) with timevarying transition rule. The analysis indicates that the generator, which is the general member of the family, reaches standard minimal security conditions (large period and good statistical properties) and that it is secure" against all known attacks. An important feature of the proposed generators is that they are compact and suitable for high speed applications.
|Keywords:||Cellular automata | Data encryption | Keystream generators | Stream ciphers||Publisher:||Institute of Electronics, Information and Communication, Engineers, IEICE|
Show full item record
checked on Dec 8, 2023
checked on Dec 7, 2023
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.