Abstract
We propose a variant of the self-shrinking generator, which is constructed using an extended selection rule. This new generator is called SSG-XOR since the selection rule is determined by the XORed value of a couple of bits. It is shown that the period and the linear complexity of an output sequence of SSG-XOR are better than those of the self-shrinking generator. It is also shown that the SSG-XOR generator has meaningful advantages from the viewpoint of practical cryptanalysis. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Chang, K. Y., Kang, J. S., Lee, M. K., Lee, H., & Hong, D. (2006). New variant of the self-shrinking generator and its cryptographic properties. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4296 LNCS, pp. 41–50). Springer Verlag. https://doi.org/10.1007/11927587_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
