Analysis and design of stream ciphers
Analysis and design of stream ciphers
Correlation immunity and the summation generator
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Fast correlation attacks on certain stream ciphers
Journal of Cryptology
Nonlinearity criteria for cryptographic functions
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Correlation properties of combiners with memory in stream ciphers
Journal of Cryptology - Eurocrypt '90
Cryptographic Significance of the Carry for Ciphers Based on Integer Addition
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Theory and Applications of Cellular Automata in Cryptography
IEEE Transactions on Computers
Correlation VIA linear sequential circuit approximation of combiners with memory
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
A security enhancement of the E0 cipher in Bluetooth system
KES-AMSTA'08 Proceedings of the 2nd KES International conference on Agent and multi-agent systems: technologies and applications
Cryptanalysis of the knapsack generator
FSE'11 Proceedings of the 18th international conference on Fast software encryption
Extending the resynchronization attack
SAC'04 Proceedings of the 11th international conference on Selected Areas in Cryptography
| Hi-index | 0.00 |
In stream cipher design pseudo random generators have been proposed which combine the output of one or several LFSRs in order to produce the key stream. For memoryless combiners it is known that the produced sequence has correlation to sums of certain LFSR-sequences whose correlation coefficients ci satisfy the equation 驴i ci2 = 1. It is proved that a corresponding result also holds for combiners with memory.If correlation probabilities are conditioned on side information, e.g. on known output digits, it is shown that new or stronger correlations may occur. This is exemplified for the summation cipher with two LFSRs where such correlations can be exploited in a known plaintext attack. A cryptanalytic algorithm is given which is shown to be successful for LFSRs of considerable length and with arbitrary feedback connection.