Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Linear complexity and related complexity measures
A Winterhof - Selected topics in information and coding theory, 2010 - World Scientific
The linear complexity of a sequence is not only a measure for the unpredictability and thus
suitability for cryptography but also of interest in information theory because of its close …
suitability for cryptography but also of interest in information theory because of its close …
Pseudorandom sequences
Chapter 4 PSEUDORANDOM SEQUENCES Page 1 Chapter 4 PSEUDORANDOM
SEQUENCES Alev Topuzoglu and Arne Winterhof 1. Introduction Sequences, which are …
SEQUENCES Alev Topuzoglu and Arne Winterhof 1. Introduction Sequences, which are …
How many bits have to be changed to decrease the linear complexity?
W Meidl - Designs, Codes and Cryptography, 2004 - Springer
The k-error linear complexity of periodic binary sequences is defined to be the smallest
linear complexity that can be obtained by changing k or fewer bits of the sequence per …
linear complexity that can be obtained by changing k or fewer bits of the sequence per …
A fast algorithm for determining the minimal polynomial where of a sequence with period 2p/sup n/over GF (q)
S Wei, G ** (FH)/spreadspectrum (SS) sequence is of great
importance to high-security multiple-access communication systems, for it makes FH/SS …
importance to high-security multiple-access communication systems, for it makes FH/SS …
Quadratic functions with prescribed spectra
W Meidl, A Topuzoğlu - Designs, codes and cryptography, 2013 - Springer
We study a class of quadratic p-ary functions F _ p, n from F _ p^ n to F _p, p ≧ 2, which are
well-known to have plateaued Walsh spectrum; ie, for each b ∈ F _ p^ n the Walsh …
well-known to have plateaued Walsh spectrum; ie, for each b ∈ F _ p^ n the Walsh …
Fast algorithms for determining the linear complexity of sequences over GF (p/sup m/) with period 2/sup t/n
H Chen - IEEE transactions on information theory, 2005 - ieeexplore.ieee.org
We prove a result which reduces the computation of the linear complexity of a sequence
over GF (pm)(p is an odd prime) with period 2n (n is a positive integer such that there exists …
over GF (pm)(p is an odd prime) with period 2n (n is a positive integer such that there exists …
Secure proxy signature scheme with fast revocation in the standard model
Z LIU, Y HU, X ZHANG, MA Hua - The Journal of China Universities of …, 2009 - Elsevier
Proxy signature is an important cryptographic primitive and has been suggested in
numerous applications. The revocation of delegated rights is an essential issue of the proxy …
numerous applications. The revocation of delegated rights is an essential issue of the proxy …