19 research outputs found
Towards a spectral approach for the design of self-synchronizing stream ciphers
International audienceThis paper addresses the problem of characterizing the func- tions that can be used in the design of self-synchronizing stream ciphers. We propose a general framework based on a spectral characterization through correlation matrices or equivalently through Walsh matrices. Two modes of self-synchronization are discussed: the finite time one and the statistical one
A Novel Design Method of Stream Ciphers Based on Table-Element Permutation
In this paper, a new stream ciphers design method (named TEP) is proposed to base on the table-element nonlinear permutation. A number of words are generated by n-LFSRs(linear feedback shift register) input to a table. In the table, every word is dealt with by the nonlinear transforms and the several words are combined with nonlinear function to produce keystream words. The algorithm is simplicity and the secret key is generated rapidly. The result of many simulation experiments show that the keystream by TEP method generating can meet DIEHARD statistics tests. The approach is efficient to design stream ciphers
T-functions revisited: New criteria for bijectivity/transitivity
The paper presents new criteria for bijectivity/transitivity of T-functions
and fast knapsack-like algorithm of evaluation of a T-function. Our approach is
based on non-Archimedean ergodic theory: Both the criteria and algorithm use
van der Put series to represent 1-Lipschitz -adic functions and to study
measure-preservation/ergodicity of these
New construction of single-cycle T-function families
The single cycle T-function is a particular permutation function with complex algebraic structures, maximum period and efficient implementation in software and hardware. In this paper, on the basis of existing methods, we present a new construction using a class of single cycle T-functions meeting certain conditions to construct a family of new single cycle T-functions, and we also give the numeration lower bound for the newly constructed single cycle T- functions
New construction of single cycle T-function families
The single cycle T-function is a particular permutation function with complex algebraic structures, maximum period and efficient implementation in software and hardware. In this paper, on the basis of existing methods, by using a class of single cycle T-functions that satisfy some certain conditions, we first present a new construction of single cycle T-function families. Unlike the previous approaches, this method can construct multiple single cycle T-functions at once. Then the mathematical proof of the feasibility is given. Next the numeration for the newly constructed single cycle T-functions is also investigated. Finally, this paper is end up with a discussion of the properties which these newly constructed functions preserve, such as linear complexity and stability (k-error complexity), as well as a comparison with previous construction methods