Linear complexity and random sequences
Proc. of a workshop on the theory and application of cryptographic techniques on Advances in cryptology---EUROCRYPT '85
Correlation immunity and the summation generator
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Cryptoanalysis Based on 2-Adic Rational Approximation
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
A New Class of Stream Ciphers Combining LFSR and FCSR Architectures
INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology
Cryptanalytic Time/Memory/Data Tradeoffs for Stream Ciphers
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Fast Software Encryption, Cambridge Security Workshop
CARDIS '98 Proceedings of the The International Conference on Smart Card Research and Applications
A new efficient algorithm for computing Gröbner bases without reduction to zero (F5)
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Algebraic attacks on stream ciphers with linear feedback
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
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
Periodicity, complementarity and complexity of 2-adic FCSR combiner generators
ASIACCS '06 Proceedings of the 2006 ACM Symposium on Information, computer and communications security
New Stream Cipher Designs
Entropy of the Internal State of an FCSR in Galois Representation
Fast Software Encryption
Parallel Generation of l-Sequences
SETA '08 Proceedings of the 5th international conference on Sequences and Their Applications
Breaking the F-FCSR-H Stream Cipher in Real Time
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Linearity properties of binary FCSR sequences
Designs, Codes and Cryptography
Software Oriented Stream Ciphers Based upon FCSRs in Diversified Mode
INDOCRYPT '09 Proceedings of the 10th International Conference on Cryptology in India: Progress in Cryptology
X-FCSR: a new software oriented stream cipher based upon FCSRs
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
Clock-controlled FCSR sequence with large linear complexity
SETA'10 Proceedings of the 6th international conference on Sequences and their applications
A matrix approach for FCSR automata
Cryptography and Communications
Two algebraic attacks against the F-FCSRs using the IV mode
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
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 distinctness of decimations of generalized l-sequences
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
Cryptanalysis of the F-FCSR stream cipher family
SAC'05 Proceedings of the 12th international conference on Selected Areas in Cryptography
The GLUON family: a lightweight hash function family based on FCSRs
AFRICACRYPT'12 Proceedings of the 5th international conference on Cryptology in Africa
| Hi-index | 0.00 |
In this paper we present a new class of stream ciphers based on a very simple mechanism. The heart of our method is a Feedback with Carry Shift Registers (FCSR) automaton. This automaton is very similar to the classical LFSR generators, except the fact that it performs operations with carries. Its properties are well mastered: proved period, non-degenerated states, good statistical properties, high non-linearity. The only problem to use such an automaton directly is the fact that the mathematical structure (2-adic fraction) can be retrieved from few bits of its output using an analog of the Berlekamp-Massey algorithm. To mask this structure, we propose to use a filter on the cells of the FCSR automaton. Due to the high non-linearity of this automaton, the best filter is simply a linear filter, that is a XOR on some internal states. We call such a generator a Filtered FCSR (F-FCSR) generator. We propose four versions of our generator: the first uses a static filter with a single output at each iteration of the generator (F-FCSR-SF1). A second with an 8 bit output (F-FCSR-SF8). The third and the fourth are similar, but use a dynamic filter depending on the key (F-FCSR-DF1 and F-FCSR-DF8). We give limitations on the use of the static filter versions, in scope of the time/memory/data tradeoff attack. These stream ciphers are very fast and efficient, especially for hardware implementations.