Recovering Decimation-Based Cryptographic Sequences by Means of Linear CAs

Autor(es)

Cardell, Sara D. ^[1] ; Aranha, Diego F. ^{[2, 3]} ; Fuster-Sabater, Amparo ^[4]

Afiliação do(s) autor(es)

^[1] Univ Estadual Campinas, IMECC, Campinas, SP - Brazil

^[2] Univ Estadual Campinas, Campinas - Brazil

^[3] Aarhus Univ, Aarhus - Denmark

^[4] CSIC, ITEFI, Madrid - Spain

• Tipo de documento: Artigo Científico
• Fonte: LOGIC JOURNAL OF THE IGPL; v. 28, n. 4, p. 430-448, AUG 2020.
• Citações Web of Science: 0

Resumo

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. (AU)

• Processo FAPESP: 16/50476-0 - Efficiency and security of pre and post quantum cryptographic methods: theory and applications
• Beneficiário: Ricardo Dahab
• Modalidade de apoio: Auxílio à Pesquisa - Regular
• Processo FAPESP: 15/07246-0 - Construção, decodificação e implementação de códigos F_q lineares. Performance de códigos SPC produto e criptoanalise de contração de geradores.
• Beneficiário: Sara Díaz Cardell
• Modalidade de apoio: Bolsas no Brasil - Pós-Doutorado