Finite fields
Algebraic feedback shift registers
Theoretical Computer Science - Special issue: cryptography
The expected value of the joint linear complexity of periodic multisequences
Journal of Complexity
Register Synthesis for Algebraic Feedback Shift Registers Based on Non-Primes
Designs, Codes and Cryptography
Distributional properties of d-FCSR sequences
Journal of Complexity - Special issue on coding and cryptography
Periodicity and Correlation Properties of d-FCSR Sequences
Designs, Codes and Cryptography
IEEE Transactions on Information Theory
Fibonacci and Galois representations of feedback-with-carry shift registers
IEEE Transactions on Information Theory
Feedback with carry shift registers synthesis with the Euclidean algorithm
IEEE Transactions on Information Theory
Counting Functions and Expected Values for the k-Error Linear Complexity
Finite Fields and Their Applications
| Hi-index | 754.84 |
Various measures of security of stream ciphers have been studied that are based on the problem of finding a minimum size generator for the keystream in some special class of generators. These include linear and p-adic spans, as well as π-adic span, which is based on a choice of an element π in a finite extension of the integers. The corresponding sequence generators are known as linear feedback shift registers, feedback with carry shift registers, and the more general algebraic feedback shift registers, respectively. In this paper, the average behavior of such security measures when πd = p 0 or π2 = -p n - O(log(n)) for sequences with period n.