A matrix approach for FCSR automata

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 autom...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Cryptography and communications 2011, Vol.3 (2), p.109-139
Hauptverfasser: Arnault, François, Berger, Thierry P., Pousse, Benjamin
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!