Balanced shrinking generators

Authors:
Se Ah Choi;Kyeongcheol Yang
Affiliations:
Dept. of Electronic and Electrical Engineering, Pohang University of Science and Technology, Pohang, Gyungbuk, Korea;Dept. of Electronic and Electrical Engineering, Pohang University of Science and Technology, Pohang, Gyungbuk, Korea
Venue:
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
Year:
2002

Citing 8
Cited 1

Analysis and design of stream ciphers

Analysis and design of stream ciphers
Learning decision trees using the Fourier spectrum

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
The shrinking generator

CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
On Some Properties of the Shrinking Generator

Designs, Codes and Cryptography
Handbook of Applied Cryptography

Handbook of Applied Cryptography
Shift Register Sequences

Shift Register Sequences
Simple construction of almost k-wise independent random variables

SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
The linear complexity of the self-shrinking generator

IEEE Transactions on Information Theory

An efficient cryptosystem Delta for stream cipher applications

Computers and Electrical Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

The shrinking generator is a keystream generator which is good for stream ciphers in wireless mobile communications, because it has simple structure and generates a keystream faster than other generators. Nevertheless, it has a serious disadvantage that its keystream is not balanced if they use primitive polynomials as their feedback polynomials. In this paper, we present a method to construct balanced shrinking generators by modifying the structure of the shrinking generator and analyze their cryptographical properties including period, balancedness, linear complexity, and probability distribution. Experimental results show that the keystreams of these generators have larger linear complexity than that of the shrinking generator, provided that the sizes of LFSRs are fixed.