Cryptography with cellular automata
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Theory and Applications of Cellular Automata in Cryptography
IEEE Transactions on Computers
Analysis of One-Dimensional Linear Hybrid Cellular Automata over GF(q)
IEEE Transactions on Computers
AAECC-12 Proceedings of the 12th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
A Probabilistic Correlation Attack on the Shrinking Generator
ACISP '98 Proceedings of the Third Australasian Conference on Information Security and Privacy
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
A Cryptanalysis of Clock-Controlled Shift Registers with Multiple Steps
Proceedings of the International Conference on Cryptography: Policy and Algorithms
Cellular automata computations and secret key cryptography
Parallel Computing - Special issue: Parallel and nature-inspired computational paradigms and applications
Analysis of pseudo random sequences generated by cellular automata
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Predicting the shrinking generator with fixed connections
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Hi-index | 0.00 |
This work proposes an efficient attack on the Shrinking Generator based on its characterization by means of Linear Hybrid Cellular Automata. The algorithm uses the computation of the characteristic polynomials of specific sub-automata and the generation of the Galois field associated to one of the Linear Feedback Shift Registers components of the generator. Both theoretical and empirical evidences for the effectiveness of the attack are given. The two main advantages of the described cryptanalysis are the determinism of bits prediction and the possible application of the obtained results to different generators.