Fast Software Encryption, Cambridge Security Workshop
Autocorrelations of Maximum Period FCSR Sequences
SIAM Journal on Discrete Mathematics
Arithmetic crosscorrelations of feedback with carry shift register sequences
IEEE Transactions on Information Theory
Fourier transforms and the 2-adic span of periodic binary sequences
IEEE Transactions on Information Theory
A lower bound on the linear span of an FCSR
IEEE Transactions on Information Theory
Partial period distribution of FCSR sequences
IEEE Transactions on Information Theory
Compression mappings on primitive sequences over Z/(pe)
IEEE Transactions on Information Theory
Further Results on the Distinctness of Decimations of -Sequences
IEEE Transactions on Information Theory
Injectivity of Compressing Maps on Primitive Sequences Over Z/(pe)
IEEE Transactions on Information Theory
Further Result of Compressing Maps on Primitive Sequences Modulo Odd Prime Powers
IEEE Transactions on Information Theory
Uniqueness of the distribution of zeroes of primitive level sequences over Z/(pe) (II)
Finite Fields and Their Applications
Uniqueness of the distribution of zeroes of primitive level sequences over Z/(pe)
Finite Fields and Their Applications
Compressing Mappings on Primitive Sequences over Z/(2e) and Its Galois Extension
Finite Fields and Their Applications
Typical primitive polynomials over integer residue rings
Finite Fields and Their Applications
A new result on the distinctness of primitive sequences over Z/ (pq) modulo 2
Finite Fields and Their Applications
On the distinctness of modular reductions of primitive sequences modulo square-free odd integers
Information Processing Letters
On the distinctness of modular reductions of primitive sequences over Z/(232-1)
Designs, Codes and Cryptography
| Hi-index | 0.00 |
This paper studies the distinctness problem of the reductions modulo 2 of maximal length sequences over Z/(pq), where p and q are two different odd primes with p1, it is proved that if there exist a nonnegative integer S and a primitive element @x in Z/(pq) such that x^S-@x=0(modf(x),pq), and either (q-1) is not divisible by (p-1) or 2(p-1) divides (q-1), then a@?=b@?(mod2) if and only if a@?=b@?. The existence of S and @x is completely determined by p, q and degf(x). Secondly, for the case of degf(x)=1, it is proved that if gcd(p-1,q-1)=2 and (p-1)/ord"p(2) is congruent to (q-1)/ord"q(2) modulo 2, then a@?=b@?(mod2) if and only if a@?=b@?.