Non-Triangular Self-Synchronizing Stream Ciphers

doi:10.1109/TC.2020.3043714

Non-Triangular Self-Synchronizing Stream Ciphers

2022-01-01

4

OA

AI

DOI：10.1109/TC.2020.3043714

Original

Original request for help

Save

Abstract

En 中文

In this article, we propose an instantiation, called 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. Hardware implementations and comparisons with some state-of-the-art stream ciphers on Xilinx FPGAs are presented. It turns out that Stanislas provides bigger throughput than the considered stream ciphers (synchronous and self-synchronizing) when straightforward implementations are considered. Moreover, its synchronization delay is much smaller than the SSSC Moustique (40 clock cycles instead of 105) and the standard approach CFB1-AES128 (40 clock cycles instead of 128).

Keywords:

Self-synchronizing stream ciphers

automata with finite input memory

flatness

hardware implementations

Non-Triangular Self-Synchronizing Stream Ciphers

Abstract

Journal

Organization