搜索结果: 1-7 共查到“知识库 军事学 period”相关记录7条 . 查询时间(0.111 秒)
The internal state of RC4 stream cipher is a permutation over ZNZN and its state transition is effectively a transposition or swapping of two elements. How the randomness of RC4 state evolves due to i...
Low Linear Complexity Estimates for Coordinate Sequences of Linear Recurrences of Maximal Period over Galois Ring
linear recurrent sequence linear complexity/rank estimations pseudo-random sequences
2016/3/1
In this work we provide low rank estimations for coordinate sequences of linear recurrent sequences (LRS) of maximal period (MP) over Galois ring R=GR(pn,r), p≥5, r≥2, with numbers s such that s=kr+2,...
CRITERION OF MAXIMAL PERIOD OF A TRINOMIAL OVER NONTRIVIAL GALOIS RING OF ODD CHARACTERISTIC
Secret-key cryptography Stream ciphers Pseudo-randomness
2015/12/22
In earlier eighties of XX century A.A.Nechaev has obtained the criterion of full period of a Galois polynomial over primary residue ring modulo power of 2. Also he has obtained necessary conditions of...
A Scalable Method for Constructing Galois NLFSRs with Period $2^n-1$ using Cross-Join Pairs
foundations / NLFSR LFSR cross-join pair stream cipher
2012/6/14
This paper presents a method for constructing $n$-stage Galois NLFSRs with period $2^n-1$ from $n$-stage maximum length LFSRs. We introduce nonlinearity into state cycles by adding a nonlinear Boolean...
A Scalable Method for Constructing Galois NLFSRs with Period $2^n-1$ using Cross-Join Pairs
foundations / NLFSR LFSR cross-join pair stream cipher
2012/3/22
This paper presents a method for constructing $n$-stage Galois NLFSRs with period $2^n-1$ from $n$-stage maximum length LFSRs. We introduce nonlinearity into state cycles by adding a nonlinear Boolean...
A Scalable Method for Constructing Galois NLFSRs with Period $2^n-1$ using Cross-Join Pairs
foundations / NLFSR LFSR cross-join pair stream cipher
2012/3/21
This paper presents a method for constructing $n$-stage Galois NLFSRs with period $2^n-1$ from $n$-stage maximum length LFSRs. We introduce nonlinearity into state cycles by adding a nonlinear Boolean...
2-Adic Complexity of a Sequence Obtained from a Periodic Binary Sequence by Either Inserting or Deleting Symbols within One Period k
Periodic Binary Sequence 2-Adic Complexity k-symbol deletion
2009/6/5
In this paper, we propose a method to get the lower bounds of the 2-adic complexity of a sequence obtained from a periodic sequence over by either inserting or deleting symbols within one period. The ...