Linear ciphers and random sequence generators with multiple clocks
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
On the necessity of cryptanalytic exhaustive search
ACM SIGACT News - A special issue on cryptography
Linear Models for Keystream Generators
IEEE Transactions on Computers
Modified clock-controlled alternating step generators
Computer Communications
| Hi-index | 0.00 |
In this paper, we give at first a precise estimation for the consistency probability of a system of linear algebraic equutions Ax = b with random m脳n coefficient matrix A, m n, and fixed non-zero right side b. A new test in cryptanalysis is then formulated on the basis of the estimation and applied to attack the multiplexing generator of Jennings (1980) and the multiple-speed generator of Massey-Rueppel (1984). Some security remark concerning the perfect linear cipher of the latter authors are also made.