Recovering Decimation-Based Cryptographic Sequences by Means of Linear CAs-Reference-Cited by-同舟云学术

Recovering Decimation-Based Cryptographic Sequences by Means of Linear CAs

Published:2019-12-10 Issue:4 Volume:28 Page:430-448
ISSN:1367-0751
Container-title:Logic Journal of the IGPL
language:en
Short-container-title:

Author:

Cardell Sara D¹,Aranha Diego F²,Fúster-Sabater Amparo³

Affiliation:

1. IMECC, University of Campinas, Campinas, Brazil

2. Aarhus University, Denmark; University of Campinas, Campinas, Brazil

3. ITEFI, Consejo Superior de Investigaciones Científicas, Madrid, Spain

Abstract

Abstract The sequences produced by the cryptographic sequence generator known as the shrinking generator can be modelled as the output sequences of linear elementary cellular automata (CA). These sequences are composed of interleaved m-sequences produced by linear structures based on feedback shifts. This profitable characteristic can be used in the cryptanalysis of this generator. In this work we propose an algorithm that takes advantage of the inherent linearity of these CA and the interleaved m-sequences. Although irregularly decimated generators have been conceived and designed as non-linear ones, in practice they can be easily analysed in terms of simple linear structures.

Funder

Fundação de Amparo à Pesquisa do Estado de São Paulo

Ministerio de Economía, Industria y Competitividad, Gobierno de España

Albert Ellis Institute

European Regional Development Fund

Publisher

Oxford University Press (OUP)

Subject

Logic

Link

http://academic.oup.com/jigpal/article-pdf/28/4/430/33554826/jzz051.pdf

Reference24 articles.

1. A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic;Barbulescu,2014

2. Linear models for the self-shrinking generator based on CA;Cardell;Journal of Cellular Automata,2016

3. Modelling the shrinking generator in terms of linear CA;Cardell;Advances in Mathematics of Communications,2016

4. Linearity in decimation-based generators: an improved cryptanalysis on the shrinking generator;Cardell;Open Mathematics,2018

5. The shrinking generator;Coppersmith,1993

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On binary linear codes and binary pseudo-random sequences;Journal of Algebra and Its Applications;2023-10-11

2. Randomness study of the concatenation of generalized sequences;Logic Journal of the IGPL;2022-02-18

3. Interleaving Shifted Versions of a PN-Sequence;Mathematics;2021-03-23

4. Preliminary Analysis of Interleaving PN-Sequences;Computational Science and Its Applications – ICCSA 2021;2021

5. Recovering Decimation-Based Cryptographic Sequences by Means of Linear CAs;Logic Journal of the IGPL;2020-04-14