Non-triangular self-synchronizing stream ciphers - Archive ouverte HAL Access content directly
Journal Articles IEEE Transactions on Computers Year : 2022

Non-triangular self-synchronizing stream ciphers

Abstract

In this paper, we propose an instantiation, called \textsf{Stanislas}, of a dedicated Self-Synchronizing Stream Cipher (SSSC) involving an automaton with finite input memory using non-triangular state transition functions. Previous existing SSSC are based on automata with shifts or triangular functions (T-functions) as state transition functions. Our algorithm Stanislas admits a matrix representation deduced from a general and systematic methodology called Linear Parameter Varying (LPV). This particular representation comes from the automatic theory and from a special property of dynamical systems called flatness.
Fichier principal
Vignette du fichier
stanislas.pdf (1.49 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03081725 , version 1 (20-07-2021)

Identifiers

Cite

Julien Francq, Loic Besson, Paul Huynh, Philippe Guillot, Gilles Millérioux, et al.. Non-triangular self-synchronizing stream ciphers. IEEE Transactions on Computers, 2022, 71 (1), pp.134-145. ⟨10.1109/TC.2020.3043714⟩. ⟨hal-03081725⟩
594 View
106 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More