.png){kind=icon}
返回
Non-Triangular Self-Synchronizing Stream Ciphers
.png){kind=icon}
OA
AI
DOI：10.1109/TC.2020.3043714.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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).
Keyword:
Self-synchronizing stream ciphers
automata with finite input memory
flatness
hardware implementations
期刊
IF:
3.8
论文数:
5.3K
被引数:
9.8K
机构
引用论文
.png){kind=icon}
Designing Anion‐Type Water‐Free Zn2+ Solvation Structure for Robust Zn Metal Anode设计用于坚固Zn金属阳极的阴离子型无水Zn2 溶剂化结构
PREAI
分享收藏分享收藏
查看更多内容