Analysis and design of stream ciphers
correlation immunitycryptographyknapsacklinear feedback shift registersmultiple clockingrandom sequencesstream ciphers
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)
This book is concerned with stream ciphers. The introduction gives a survey on cryptographic systems and an outline of the rest of the book. Chapter 2 defines the notion of stream cipher system. Moreover the main problem (i.e. to find suitable key stream generators) is stated. In chapter 3 basic concepts of algebra (e.g. finite fields) are discussed. This provides us with the tools needed to tackle the problem mentioned in chapter 2. Also Linear Feedback Shift Registers (LFSRs) are introduced. Chapter 4 treats the notion of random sequences and linear complexity (profile). It appears that the randomness postulates of Solomon Golomb do not give the right criteria; the linear complexity profile turns out to be a more useful concept (cf. p. 53). Chapter 5 is devoted to the analysis of nonlinear functions which when applied to one or more LFSR-sequences may produce new sequences satisfying the criteria obtained in the previous chapter. In particular, in section 5.1 the author analyses what happens when distinct stages of one LFSR are combined in a nonlinear way and in section 5.2 he describes what happens when sequences of distinct LFSRs are combined in a nonlinear way. Furthermore, the concept of correlation immunity is introduced. It appears that the involved nonlinear functions must satisfy conflicting conditions in order to produce a wanted new sequence. By allowing memory in the nonlinear combining functions these conflicts can be avoided (cf. p. 140). This idea is exploited in chapter 9. In chapter 6 the effects of multiple clocking are studied. The remaining two chapters (7 and 8) discuss ways to apply the classical knapsack problem in the connexion with stream cipher systems. I think this book is basically a good book for two reasons. Firstly, since there are not so many publications handling the subject of nonlinear combinations of LFSRs, and secondly because the devices and concepts are described in a very transparant way. However, sometimes the proofs are too long and detailed. The concept of quintessential element is non-standard and one should consider twice the introduction of a new notion in a well developed area as field theory. The Berlekamp-Massey algorithm is important enough to be included in this book. I was disappointed that it was not presented. Typographically I do not like the presentation. The reason for this is that sometimes two formulas interfere because of lines being too close to each other. Sometimes indices are not appended in the right place. Formula (6.28) is not in accordance with the text (cf. p. 157 line eight from top). The conclusion must be that we can learn a lot from this book, it is nicely and transparently written, but there could be improved a lot when typing errors and typographical flaws are corrected.
- Reducing the calculation of the linear complexity of \(u_2^v\)-periodic binary sequences to Games-Chan algorithm
- Cryptanalysis of an E0-like combiner with memory
- Joint linear complexity of multisequences consisting of linear recurring sequences
- Factorization of determinants over finite fields and application in stream ciphers
- Characterization of \(2^{n}\)-periodic binary sequences with fixed 2-error or 3-error linear complexity
- The minimal polynomial over \(\mathbb F_q\) of linear recurring sequence over \(\mathbb F_{q^m}\)
- Fast correlation attacks on certain stream ciphers
- Correlation properties of combiners with memory in stream ciphers
- The stability theory of stream ciphers
- Binary sequences derived from ML-sequences over rings. I: Periods and minimal polynomials
- On evaluating the linear complexity of a sequence of least period \(2^ n\)
- An analysis of a class of algorithms for S-box construction
- Algebraic nonlinearity and its applications to cryptography
- Feedback shift registers, 2-adic span, and combiners with memory
- On the linear complexity of FCSR sequences
- Counting functions and expected values for the \(k\)-error linear complexity
- Boolean functions: degree and support
- Linearity in decimation-based generators: an improved cryptanalysis on the shrinking generator
- Nonlinear vectorial primitive recursive sequences
- Estimating the number of solutions of systems of nonlinear equations with linear recurring arguments by the spectral method
- On ideal t-tuple distribution of filtering de Bruijn sequence generators
- Characteristic digit-sum sequences
- Occurrence numbers for vectors in cycles of output sequences of binary combining generators
- Three characterizations of non-binary correlation-immune and resilient functions
- On the confusion and diffusion properties of Maiorana-McFarland's and extended Maiorana-McFarland's functions
- Statistical weakness of multiplexed sequences
- Correlation properties of a general binary combiner with memory
- A simple stream cipher with proven properties
- On the security of the Feng-Liao-Yang Boolean functions with optimal algebraic immunity against fast algebraic attacks
- Modes of operations for encryption and authentication using stream ciphers supporting an initialisation vector
- Decimation and interleaving operations in one-sided symbolic dynamics
- Oblivious DFA evaluation on joint input and its applications
- On the constructions of resilient Boolean functions with five-valued Walsh spectra and resilient semi-bent functions
- Several classes of even-variable 1-resilient rotation symmetric Boolean functions with high algebraic degree and nonlinearity
- Analysis of periodic linear systems over finite fields with and without Floquet transform
- Rational complexity of binary sequences, F\(\mathbb{Q}\)SRs, and pseudo-ultrametric continued fractions in \(\mathbb{R}\)
- Jump and hop randomness tests for binary sequences
- On ideal \(t\)-tuple distribution of orthogonal functions in filtering de Bruijn generators
- A kind of quaternary sequences of period \(2 p^m q^n\) and their linear complexity
- The Fourier spectral characterization for the correlation-immune functions over \(\mathbb{F}_p \)
- Further results on the distinctness of modulo 2 reductions of primitive sequences over \(\mathbb{Z}/(2^{32}-1)\)
- A linear code based on resilient Boolean maps whose dual is a platform for a robust secret sharing scheme
- On the \(k\)-error linear complexity of binary sequences derived from the discrete logarithm in finite fields
- Remarks on the k-error linear complexity of p^n-periodic sequences
- Classification and counting on multi-continued fractions and its application to multi-sequences
- Complete characterization of the first descent point distribution for the \(k\)-error linear complexity of \(2^n\)-periodic binary sequences
- Structure analysis on the \(k\)-error linear complexity for \(2^n\)-periodic binary sequences
- On algebraic immunity of trace inverse functions on finite fields of characteristic two
- Parameterized hash functions
- Continued fraction for formal Laurent series and the lattice structure of sequences
- The \(k\)-error linear complexity distribution for \(2^n\)-periodic binary sequences
- A family of elliptic curve pseudorandom binary sequences
- Counting functions and expected values for the lattice profile at \(n\)
- Authentication codes based on resilient Boolean maps
- On the \(k\)-error linear complexity for \(p^n\)-periodic binary sequences via hypercube theory
- On the distinctness of primitive sequences over \({\mathbb Z}/(p^{e}q)\) modulo 2
- Characterization of the third descent points for the k-error linear complexity of 2ⁿ-periodic binary sequences
- On distribution properties of sequences with perfect linear complexity profile
- Integrity Analysis of Authenticated Encryption Based on Stream Ciphers
- Cryptanalysis of the knapsack generator
- Cryptanalysis of a chaotic stream cipher and its improved scheme
- A Lower Bound on the Expected Complexity in the Set of n-Tuples of Given Weight
- Binary Pseudo-Random Sequences Theory
- Dangerous Functions for Feedforward Pseudo-Noise Generators with Memory
- scientific article; zbMATH DE number 5005270 (Why is no real title available?)
- Equidistant filters based on skew ML-sequences over fields
- Параметры одного класса функций, заданных на конечном поле
- Properties of the output sequences of a combination generators over finite fields
- AN INTELLIGENT SECURITY AGENT FOR A RELIABLE CIPHER SYSTEM USING PINGPONG
- The sum of modules of Walsh coefficients of Boolean functions
- Improved differential attacks on RC5
- Linear complexity of periodic sequences: a general theory
- Generalization of Siegenthaler inequality and Schnorr-Vaudenay multipermutations
- From Bi-ideals to Periodicity
- Nonlinear equivalence of stream ciphers
- How to Strengthen Pseudo-random Generators by Using Compression
- scientific article; zbMATH DE number 5501368 (Why is no real title available?)
- Improved Bounds on the Linear Complexity of Keystreams Obtained by Filter Generators
- Sequences, DFT and Resistance against Fast Algebraic Attacks
- 2 n -Periodic Binary Sequences with Fixed k-Error Linear Complexity for k = 2 or 3
- Generalized Joint Linear Complexity of Linear Recurring Multisequences
- A Fast Jump Ahead Algorithm for Linear Recurrences in a Polynomial Space
- Parallel Generation of ℓ-Sequences
- An Analysis of the Hermes8 Stream Ciphers
- Spectral characteristics of the best affine approach of multi-output m-valued logical functions
- Counting Functions for the k-Error Linear Complexity of 2 n -Periodic Binary Sequences
- Stream Ciphering Techniques Based on n-Tuples Juxtaposition Sequences
- Distribution of one-error linear complexity of binary sequences for arbitrary prime period
- scientific article; zbMATH DE number 1196713 (Why is no real title available?)
- Refined convergents to the associated continued fractions for binary sequences
- Determining periodicity: a case study of a functional specification
- Improved results on the probabilistic theory of the joint linear complexity of multisequences
- scientific article; zbMATH DE number 1951613 (Why is no real title available?)
- scientific article; zbMATH DE number 1996484 (Why is no real title available?)
- On the multidimensional distribution of the subset sum generator of pseudorandom numbers
- On the linear complexity of product sequences of linear recurring sequences
- Image processing based techniques for securing documents
- Linear span analysis of a set of periodic sequence generators
- Attacks against filter generators exploiting monomial mappings
- Cryptographic transformations of non-Shannon sources of information
This page was built for publication: Analysis and design of stream ciphers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1089307)