Design of a Novel Pseudo-Random Generator Based on Vectorial FCSRs

Allailou, Boufeldja; Marjane, Abdelaziz; Mokrane, Abdellah

doi:10.1007/978-3-642-17955-6_6

Cited by 4 publications

(4 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [4], we developed the conception of VFCSR in Galois mode, especially the quadratic case called VFCSR-Q (see Fig 2) and we have presented a new stream cipher design based on a filtered quadratic VFCSR automaton and called F-VFCSR-Q. In the following, we briefly describe VFCSR in Galois mode, analyses basic properties.…”

Section: Vectorial Fcsr In Galois Modementioning

confidence: 99%

“…In the following, we briefly describe VFCSR in Galois mode, analyses basic properties. For more details, we refer to [4]. Definition 4.1.…”

Section: Vectorial Fcsr In Galois Modementioning

confidence: 99%

“…Consider a VFCSR in Galois mode over (F 2 , P, B) of length r with connection integer q and connection matrix M. Then for any sequence a generated by this VFCSR, the associated 2-adic vector β is in 2 to design a cryptographic random generator. For more detail see [4].…”

Section: )mentioning

confidence: 99%

See 2 more Smart Citations

Vectorial Feedback with Carry Registers and Memory requirements

Marjane,

Mokrane,

Allailou

2011

Preprint

Self Cite

View full text Add to dashboard Cite

In [3], we have introduced vectorial conception of FCSR's in Fibonacci mode. This conception allows us to easily analyze FCSR's over binary finite fields F2n for n ≥ 2. In [4], we describe and study the corresponding Galois mode and use it to design a new stream cipher. In this paper, we introduce the Ring mode for vectorial FCSR, explain the analysis of such Feedback registers and illustrate with a simple example.

show abstract

Section: Vectorial Fcsr In Galois Modementioning

confidence: 99%

“…In the following, we briefly describe VFCSR in Galois mode, analyses basic properties. For more details, we refer to [4]. Definition 4.1.…”

Section: Vectorial Fcsr In Galois Modementioning

confidence: 99%

See 1 more Smart Citation

Vectorial Feedback with Carry Registers and Memory requirements

Marjane,

Mokrane,

Allailou

2011

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…Under some conditions, the period is maximal, i.e. it is the order of p modulo |N(q)|, where N(q) is the norm of q in Q(π) as a Q-vector space of dimension d. To extend the construction of FCSR to any finite fields F p n , the authors introduced the notion of a vectorial conception in 2010 (see [3,4]). In fact, FCSR and d-FCSR are mainly developped on F p (where p is prime).…”

Section: Introductionmentioning

confidence: 99%

Vectorial FCSR constructed on totally ramified extension of the p-adic numbers

Marjane

2011

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

Cryptanalysis of Pseudo-random Generators Based on Vectorial FCSRs

Berger

Minier

2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

978-3-642-34930-0 (Print)International audienceFeedback with Carry Shift Registers (FCSRs) have been first proposed in 2005 by F. Arnault and T. Berger as a promising alternative to LFSRs for the design of stream ciphers. The original proposal called F-FCSR simply filters the content of a FCSR in Galois mode using a linear function. In 2008, Hell and Johannson attacked this version using a method called LFSRization of F-FCSR. This attack is based on the fact that a single feedback bit controls the values of all the carry cells. Thus, a trail of 0 in the feedback bit annihilates the content of the carry register, leading to transform the FCSR into an LFSR during a sufficient amount of time. Following this attack, a new version of F-FCSR was proposed based on a new ring FCSR representation that guarantees that each carry cell depends on a distinct cell of the main register. This new proposal prevents the LFSRization from happening and remains unbroken since 2009. In parallel, Alaillou, Marjane and Mokrane proposed to replace the FCSR in Galois mode of the original proposal by a Vectorial FCSR (V-FCSR) in Galois mode. In this paper, we first introduce a general theoretical framework to show that Vectorial FCSRs could be seen as a particular case of classical FCSRs. Then, we show that Vectorial FCSRs used in Galois mode stay sensitive to the LFSRization of FCSRs. Finally, we demonstrate that hardware implementations of V-FCSRs in Galois mode are less efficient than those based on FCSRs in ring mode

show abstract

Design of a Novel Pseudo-Random Generator Based on Vectorial FCSRs

Cited by 4 publications

References 8 publications

Vectorial Feedback with Carry Registers and Memory requirements

Vectorial Feedback with Carry Registers and Memory requirements

Vectorial FCSR constructed on totally ramified extension of the p-adic numbers

Cryptanalysis of Pseudo-random Generators Based on Vectorial FCSRs

Contact Info

Product

Resources

About