Analysis and design of stream ciphers
Analysis and design of stream ciphers
Reconstructing truncated integer variables satisfying linear congruences
SIAM Journal on Computing - Special issue on cryptography
Linear Codes and Polylinear Recurrences over Finite Rings and Modules
AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Expansion and linear complexity of the coordinate sequences over Galois rings
Journal of Complexity
Expansion and linear complexity of the coordinate sequences over Galois rings
Journal of Complexity
On binary sequences from recursions "modulo 2e" made non-linear by the bit-by-bit "XOR" function
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Distribution properties of compressing sequences derived from primitive sequences over Z/(pe)
IEEE Transactions on Information Theory
The nonlinear complexity of level sequences over Z/(4)
Finite Fields and Their Applications
Uniqueness of the distribution of zeroes of primitive level sequences over Z/(pe) (II)
Finite Fields and Their Applications
A new result on the distinctness of primitive sequences over Z/ (pq) modulo 2
Finite Fields and Their Applications
Periods of termwise exclusive ors of maximal length FCSR sequences
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
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.06 |
Linear feedback shift registers over the ring Z2e can be implemented efficiently on standard microprocessors. The most significant bits of the elements of a sequence in Z2e驴 constitute a binary pseudo-random sequence. We derive lower bounds for the linear complexity over F2 of these binary sequences.