Fast correlation attacks on certain stream ciphers
Journal of Cryptology
AUSCRYPT '90 Proceedings of the international conference on cryptology on Advances in cryptology
On the linear syndrome method in cryptoanalysis
CRYPTO '88 Proceedings on Advances in cryptology
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Fundamentals of Convolutional Coding
Fundamentals of Convolutional Coding
AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Fast Correlation Attacks Based on Turbo Code Techniques
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
An Improved Linear Syndrome Algorithm in Cryptanalysis With Applications
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
A Comparison of Fast Correlation Attacks
Proceedings of the Third International Workshop on Fast Software Encryption
Proceedings of the Third International Workshop on Fast Software Encryption
Decrypting a Class of Stream Ciphers Using Ciphertext Only
IEEE Transactions on Computers
On a fast correlation attack on certain stream ciphers
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
A comparison of cryptanalytic principles based on iterative error-correction
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Improved fast correlation attacks on stream ciphers via convolutional codes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
A method for convergence analysis of iterative probabilistic decoding
IEEE Transactions on Information Theory
A New Cryptanalytic Attack for PN-generators Filtered by a Boolean Function
SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
Two Alerts for Design of Certain Stream Ciphers: Trapped LFSR and Weak Resilient Function over GF(q)
SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
A Generalized Birthday Problem
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Fast Correlation Attacks: An Algorithmic Point of View
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Fast Correlation Attack Algorithm with List Decoding and an Application
FSE '01 Revised Papers from the 8th International Workshop on Fast Software Encryption
New Stream Cipher Designs
New guess-and-determine attack on the self-shrinking generator
ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
A fast correlation attack on the shrinking generator
CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
On immunity profile of boolean functions
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
A survey on fast correlation attacks
Cryptography and Communications
| Hi-index | 0.00 |
An algorithm for cryptanalysis of certain keystream generators is proposed. The developed algorithm has the following two advantages over other reported ones: (i) it is more powerful and (ii) it provides a high-speed software implementation, as well as a simple hard-ware one, suitable for high parallel architectures. The novel algorithm is a method for the fast correlation attack with significantly better performance than other reported methods, assuming a lower complexity and the same inputs. The algorithm is based on decoding procedures of the corresponding binary block code with novel constructions of the parity-checks, and the following two decoding approaches are employed: the a posterior probability based threshold decoding and the belief propagation based bit-flipping iterative decoding. These decoding procedures offer good trade-offs between the required sample length, overall complexity and performance. The novel algorithm is compared with recently proposed improved fast correlation attacks based on convolutional codes and turbo decoding. The underlying principles, performance and complexity are compared, and the gain obtained with the novel approach is pointed out.