Analysis and design of stream ciphers
Analysis and design of stream ciphers
Linear ciphers and random sequence generators with multiple clocks
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
Finite field for scientists and engineers
Finite field for scientists and engineers
Windmill generators: A generalization and an observation of how many there are
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Bounds to Complexities of Networks for Sorting and for Switching
Journal of the ACM (JACM)
Shift Register Sequences
Decimation Attack of Stream Ciphers
INDOCRYPT '00 Proceedings of the First International Conference on Progress in Cryptology
Fast Software Encryption, Cambridge Security Workshop
On Decimations of $\ell$-Sequences
SIAM Journal on Discrete Mathematics
Design and Properties of a New Pseudorandom Generator Based on a Filtered FCSR Automaton
IEEE Transactions on Computers
Efficient Generation of Statistically Good Pseudonoise by Linearly Interconnected Shift Registers
IEEE Transactions on Computers
High Speed Generation of Maximal Length Sequences
IEEE Transactions on Computers
Algebraic attacks on stream ciphers with linear feedback
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
F-FCSR: design of a new class of stream ciphers
FSE'05 Proceedings of the 12th international conference on Fast Software Encryption
Two algebraic attacks against the F-FCSRs using the IV mode
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
Arithmetic crosscorrelations of feedback with carry shift register sequences
IEEE Transactions on Information Theory
Fibonacci and Galois representations of feedback-with-carry shift registers
IEEE Transactions on Information Theory
Feedback with carry shift registers synthesis with the Euclidean algorithm
IEEE Transactions on Information Theory
Further Results on the Distinctness of Decimations of -Sequences
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
The generation of pseudo-random sequences at a high rate is animportant issue in modern communication schemes. The representationof a sequence can be scaled by decimation to obtain parallelism andmore precisely a sub-sequences generator. Sub-sequences generatorsand therefore decimation have been extensively used in the past forlinear feedback shift registers (LFSRs). However, the case ofautomata with a non linear feedback is still in suspend. In thispaper, we have studied how to transform of a feedback with carryshit register (FCSR) into a sub-sequences generator. We examine twosolutions for this transformation, one based on the decimationproperties of l-sequences, i.e.FCSR sequenceswith maximal period, and the other one based on multiple stepsimplementation. We show that the solution based on the decimationproperties leads to much more costly results than in the case ofLFSRs. For the multiple steps implementation, we show how thepropagation of carries affects the design.