539 search results - page 6 / 108 » Linear complexity of transformed sequences |
ICISC
2007
13 years 8 months ago
2007
This paper reports on an improvement of Matsui’s linear cryptanalysis that reduces the complexity of an attack with algorithm 2, by taking advantage of the Fast Fourier Transform...
WCC
2005
Springer
14 years 26 days ago
2005
Springer
Nonlinear n-stage feedback shift-register sequences over the finite field Fq of period qn − 1 are investigated under linear operations on sequences. We prove that all members o...
SIGGRAPH
1997
ACM
13 years 11 months ago
1997
ACM
In this paper, we introduce the progressive simplicial complex (PSC) representation, a new format for storing and transmitting triangulated geometric models. Like the earlier prog...
PLDI
2003
ACM
14 years 20 days ago
2003
ACM
As more complex DSP algorithms are realized in practice, an increasing need for high-level stream abstractions that can be compiled without sacrificing efficiency. Toward this en...
AAECC
2002
Springer
13 years 7 months ago
2002
Springer
It is shown that a q-periodic sequence over the finite field Fq passes an extended version of Marsaglia's lattice test for high dimensions if and only if its linear complexity...