Results 1 
3 of
3
Feedback shift registers, 2adic span, and combiners with memory
 Journal of Cryptology
, 1997
"... Feedback shift registers with carry operation (FCSR’s) are described, implemented, and analyzed with respect to memory requirements, initial loading, period, and distributional properties of their output sequences. Many parallels with the theory of linear feedback shift registers (LFSR’s) are presen ..."
Abstract

Cited by 50 (7 self)
 Add to MetaCart
Feedback shift registers with carry operation (FCSR’s) are described, implemented, and analyzed with respect to memory requirements, initial loading, period, and distributional properties of their output sequences. Many parallels with the theory of linear feedback shift registers (LFSR’s) are presented, including a synthesis algorithm (analogous to the BerlekampMassey algorithm for LFSR’s) which, for any pseudorandom sequence, constructs the smallest FCSR which will generate the sequence. These techniques are used to attack the summation cipher. This analysis gives a unified approach to the study of pseudorandom sequences, arithmetic codes, combiners with memory, and the MarsagliaZaman random number generator. Possible variations on the FCSR architecture are indicated at the end. Index Terms – Binary sequence, shift register, stream cipher, combiner with memory, cryptanalysis, 2adic numbers, arithmetic code, 1/q sequence, linear span. 1
Cryptanalysis Based on . . .
, 1995
"... This paper presents a new algorithm for cryptanalytically attacking stream ciphers. There is an associated measure of security, the 2adac 8pan. In order for a stream cipher to be secure, its Zadic span must be large. This attack exposes a weakness of Rueppel and Massey's summation combiner. The a ..."
Abstract
 Add to MetaCart
This paper presents a new algorithm for cryptanalytically attacking stream ciphers. There is an associated measure of security, the 2adac 8pan. In order for a stream cipher to be secure, its Zadic span must be large. This attack exposes a weakness of Rueppel and Massey's summation combiner. The algorithm, based on De Weger and Mahler's rational approximation theory for 2adic numbers, synthesizes a shortest feedback with cam shaft qwter that outputs a particular key stream, given a small number of bits of the key stream. It is adaptive in that it does not neeed to know the number of available bits beforehand.
MULTIDIMENSIONAL CONTINUED FRACTION AND RATIONAL APPROXIMATION
, 2004
"... Abstract. The classical continued fraction is generalized for studying the rational approximation problem on multiformal Laurent series in this paper, the construction is called mcontinued fraction. It is proved that the approximants of an mcontinued fraction converge to a multiformal Laurent ser ..."
Abstract
 Add to MetaCart
Abstract. The classical continued fraction is generalized for studying the rational approximation problem on multiformal Laurent series in this paper, the construction is called mcontinued fraction. It is proved that the approximants of an mcontinued fraction converge to a multiformal Laurent series, and are best rational approximations to it; conversely for any multiformal Laurent series an algorithm called mCF transform is introduced to obtain its mcontinued fraction expansions; moreover, strict mcontinued fractions, which are mcontinued fractions imposed with some additional conditions, and multiformal Laurent series are in 11 correspondence. It is shown that mcontinued fractions can be used to study the multisequence synthesis problem.