Analysis and design of stream ciphers
Analysis and design of stream ciphers
Pseudo random properties of cascade connections of clock controlled shift registers
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
Shift Register Sequences
Fast Software Encryption, Cambridge Security Workshop
Periodicity, complementarity and complexity of 2-adic FCSR combiner generators
ASIACCS '06 Proceedings of the 2006 ACM Symposium on Information, computer and communications security
On the 2-adic complexity and the k-error 2-adic complexity of periodic binary sequences
SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
Computing the k-error N-adic complexity of a sequence of period pn
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
On the expected value of the joint 2-adic complexity of periodic binary multisequences
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
On the distinctness of decimations of generalized l-sequences
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
On the distinctness of modular reductions of primitive sequences modulo square-free odd integers
Information Processing Letters
| Hi-index | 0.00 |
Recently, a new class of feedback shift registers (FCSRs) was introduced, based on algebra over the 2-adic numbers. The sequences generated by these registers have many algebraic properties similar to those generated by linear feedback shift registers. However, it appears to be significantly more difficult to find maximal period FCSR sequences. In this paper we exhibit a technique for easily finding FCSRs that generate nearly maximal period sequences. We further show that these sequence have excellent distributional properties. They are balanced, and nearly have the deBruijn property for distributions of subsequences.