Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
Pseudo random properties of cascade connections of clock controlled shift registers
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
On the linear complexity of cascaded sequences
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
Reduced Complexity Correlation Attacks on Two Clock-Controlled Generators
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Encryption System with Variable Number of Registers
Computers and Electrical Engineering
On Physical Obfuscation of Cryptographic Algorithms
INDOCRYPT '09 Proceedings of the 10th International Conference on Cryptology in India: Progress in Cryptology
Some attacks on the bit-search generator
FSE'05 Proceedings of the 12th international conference on Fast Software Encryption
Distinguishing stream ciphers with convolutional filters
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
Algebraic attacks on clock-controlled stream ciphers
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
| Hi-index | 0.00 |
The alternating step generator (ASG) is a new generator of pseudo-random sequences which is closely related t o the stop-and-go generator. It shares all the good properties of this latter generator without Posessing its weaknesses. The ASG consists of three subgenerators K, M, and M. The main characteristic of its structure is that the output of one of the subgenerators, K, controls the clock of the two others, M and M. In the present contribution, we determine the period, the distribution of short patterns and a lower bound for the linear complexity of the sequences generated by an ASG. The proof of the lower bound is greatly simplified by assuming that K generates a de Bruijn sequence. Under this and other not very restrictive assumptions the period and the linear complexity are found to be proportional to the period of the de Bruijn sequence. Furthermore the frequency of all short patterns as well as the autocorrelations turn out to be ideal. This means that the sequences generated by the ASG are provably secure against the standard attacks.