Lower bounds for the linear complexity of sequences over residue rings
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Binary sequences derived from ML-sequences over rings I: periods and minimal polynomials
Journal of Cryptology
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Distribution properties of compressing sequences derived from primitive sequences over Z/(pe)
IEEE Transactions on Information Theory
On the distinctness of maximal length sequences over Z/(pq) modulo 2
Finite Fields and Their Applications
The nonlinear complexity of level sequences over Z/(4)
Finite Fields and Their Applications
A new result on the distinctness of primitive sequences over Z/ (pq) modulo 2
Finite Fields and Their Applications
Uniqueness of the distribution of zeroes of primitive level sequences over Z/(pe)
Finite Fields and Their Applications
On the distinctness of modular reductions of primitive sequences over Z/(232-1)
Designs, Codes and Cryptography
| Hi-index | 0.06 |
Let f(x) be a strongly primitive polynomial of degree n over Z/(2^e), @h(x"0,x"1,...,x"e"-"2) a Boolean function of e-1 variables and @f(x"0,x"1,...,x"e"-"1)=x"e"-"1+@h(x"0,x"1,...,x"e"-"2)G (f(x),Z/(2^e)) denotes the set of all sequences over Z/(2^e) generated by f(x), F"2^~ the set of all sequences over the binary field F"2, then the compressing mapping @F : G(f(x),Z/(2^e))-F"2^~,a=a"0+a"12+...+a"e"-"12^e^-^1@?@f(a"0,a"1,...,a"e"-"1) mod 2 is injective, that is, for a,b@?G(f(x),Z/(2^e)), a=b if and only if @F(a)=@F(b), i.e., @f(a"0,...,a"e"-"1)=@f(b"0,...,b"e"-"1) mod 2. In the second part of the paper, we generalize the above result over the Galois rings.