16 search results - page 1 / 4 » Sequences With Almost Perfect Linear Complexity Profile |
EUROCRYPT
1987
Springer
13 years 10 months ago
1987
Springer
Sequences with almost perfect linear complexity profile are defined by H. Niederreiter[4]. C.P. Xing and K.Y. Lam[5, 6] extended this concept from the case of single sequences to ...
AAECC
2006
Springer
13 years 7 months ago
2006
Springer
Abstract Besides equidistribution properties and statistical independence the lattice profile, a generalized version of Marsaglia's lattice test, provides another quality meas...
DCC
2006
IEEE
14 years 7 months ago
2006
IEEE
We continue the study of the linear complexity of binary sequences, independently introduced by Sidel'nikov and Lempel, Cohn, and Eastman. These investigations were originated...
CTRSA
2006
Springer
13 years 11 months ago
2006
Springer
For years, the cryptographic community has searched for good nonlinear functions. Bent functions, almost perfect nonlinear functions, and similar constructions have been suggested ...
CRYPTO
2004
Springer
14 years 22 days ago
2004
Springer
In this paper we study the long standing problem of information extraction from multiple linear approximations. We develop a formal statistical framework for block cipher attacks b...