AbstractIn this work, a simple constructive method is developed for enlarging known families of filtered sequences with given period and large linear complexity. The procedure does not impose any constraint on the number of maximum-order terms in the filter, the order of the filter nor the number of stages in the linear feedback shift register
An efficient algorithm is presented for computing the k-error linear complexity of a binary sequence...
Pseudo random sequences have many applications in code division multiple access (CDMA) communication...
Two constructions of binary sequences with optimal autocorrelation of period N ≡ 0 (mod 4) are inves...
AbstractA large Linear Complexity (LC) is a fundamental requirement for a binary sequence to be used...
AbstractA large Linear Complexity (LC) is a fundamental requirement for a binary sequence to be used...
13th International Conference on Computational Intelligence in Security for Information Systems (CIS...
An efficient algorithm is presented for computing the k-error linear complexity of a binary sequence...
Abstract. Security of cryptographic symmetric primitives is studied in this thesis. Pseudorandomness...
Abstract. Nonlinear n-stage feedback shift-register sequences over the finite field Fq of period q n...
Binary sequences are algebraic structures currently used as security elements in Internet of Things ...
Binary sequences with high linear complexity are of interest in cryptography. The linear complexity ...
Binary and q-ary sequences have always been used in communication channel as the carrier or the vess...
AbstractIn this work the use of nonlinear filtering functions applied to Linear Feedback Shift Regis...
In this paper we show that the output sequences of the generalized self-shrinking generator are part...
In the present work, it is shown that the sequences obtained from cryptographic generators based on ...
An efficient algorithm is presented for computing the k-error linear complexity of a binary sequence...
Pseudo random sequences have many applications in code division multiple access (CDMA) communication...
Two constructions of binary sequences with optimal autocorrelation of period N ≡ 0 (mod 4) are inves...
AbstractA large Linear Complexity (LC) is a fundamental requirement for a binary sequence to be used...
AbstractA large Linear Complexity (LC) is a fundamental requirement for a binary sequence to be used...
13th International Conference on Computational Intelligence in Security for Information Systems (CIS...
An efficient algorithm is presented for computing the k-error linear complexity of a binary sequence...
Abstract. Security of cryptographic symmetric primitives is studied in this thesis. Pseudorandomness...
Abstract. Nonlinear n-stage feedback shift-register sequences over the finite field Fq of period q n...
Binary sequences are algebraic structures currently used as security elements in Internet of Things ...
Binary sequences with high linear complexity are of interest in cryptography. The linear complexity ...
Binary and q-ary sequences have always been used in communication channel as the carrier or the vess...
AbstractIn this work the use of nonlinear filtering functions applied to Linear Feedback Shift Regis...
In this paper we show that the output sequences of the generalized self-shrinking generator are part...
In the present work, it is shown that the sequences obtained from cryptographic generators based on ...
An efficient algorithm is presented for computing the k-error linear complexity of a binary sequence...
Pseudo random sequences have many applications in code division multiple access (CDMA) communication...
Two constructions of binary sequences with optimal autocorrelation of period N ≡ 0 (mod 4) are inves...
DOI
Add to ORKG