How to construct random functions
Journal of the ACM (JACM)
Analysis and design of stream ciphers
Analysis and design of stream ciphers
A self-synchronizing cascaded cipher system with dynamic control of error propagation
Proceedings of CRYPTO 84 on Advances in cryptology
How to construct pseudorandom permutations from pseudorandom functions
SIAM Journal on Computing - Special issue on cryptography
Differential Cryptanalysis of DES-like Cryptosystems
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Cryptanalysis of the CFB Mode of the DES with a Reduced Number of Rounds
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
A New Class of Stream Ciphers Combining LFSR and FCSR Architectures
INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology
Constructions of cryptographically significant boolean functions using primitive polynomials
IEEE Transactions on Information Theory
Synchronization of boolean dynamical systems: a spectral characterization
SETA'10 Proceedings of the 6th international conference on Sequences and their applications
Two attacks against the HBB stream cipher
FSE'05 Proceedings of the 12th international conference on Fast Software Encryption
Chosen-Ciphertext attacks against MOSQUITO
FSE'06 Proceedings of the 13th international conference on Fast Software Encryption
On the higher order nonlinearities of algebraic immune functions
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
| Hi-index | 0.06 |
Self-synchronizing stream ciphers (SSSC) are a commonly used encryption technique for channels with low bit error rate but for which bit synchronization can present a problem. Most presently used such ciphers are based on a block cipher (e.g. DES) in 1-bit cipher feedback mode. In this paper, several alternative design approaches for SSSCs are proposed that are superior to the design based on a block cipher with respect to encryption speed and potentially also with respect to security. A method for combining several SSSCs is presented that allows to prove that the combined SSSC is at least as secure as any of the component ciphers. The problem of designing SSSCs is contrasted with the problem of designing conventional synchronous additive stream ciphers and it is shown that different security criteria must be applied. Furthermore, an efficient algorithm is presented for finding a function of low degree that approximates a given Boolean function, if such an approximation exists. Its significance for the cryptographic security of SSSCs and its applications in coding theory are discussed.