A matrix approach for FCSR automata - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Cryptography and Communications - Discrete Structures, Boolean Functions and Sequences Année : 2011

A matrix approach for FCSR automata

François Arnault
  • Fonction : Auteur
  • PersonId : 916355
DMI
Thierry Pierre Berger
DMI
Benjamin Pousse
  • Fonction : Auteur

Résumé

LFSRs are primitives widely used in information theory, coding theory and cryptography. However since 2002, they have faced algebraic attacks. To avoid this kind of attacks, FCSRs have been proposed as an alternative in [2-4]. In this paper, we first give a general representation of 2-adic automata using a traditional matrix representation. We then explore the special case of binary and ternary automata. We also study the complexity in terms of memory to implement such automata. Finally, we expose some proposed FCSR constructions for hardware and software oriented stream ciphers.
Fichier non déposé

Dates et versions

hal-00683637 , version 1 (29-03-2012)

Identifiants

  • HAL Id : hal-00683637 , version 1

Citer

François Arnault, Thierry Pierre Berger, Benjamin Pousse. A matrix approach for FCSR automata. Cryptography and Communications - Discrete Structures, Boolean Functions and Sequences , 2011, 3 (2), pp.109-139. ⟨hal-00683637⟩

Collections

UNILIM CNRS XLIM
44 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More