Synthesis of cryptographic interleaved sequences by means of linear cellular automata

被引:20
作者
Fuster-Sabater, Amparo [1 ]
Caballero-Gil, P. [2 ]
机构
[1] CSIC, Inst Fis Aplicada, E-28006 Madrid, Spain
[2] Univ La Laguna, DEIOC, Tenerife 38271, Spain
关键词
Interleaved sequence; Cellular automata; Linearization; Difference equation; Cryptography;
D O I
10.1016/j.aml.2009.03.018
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
This work shows that a class of pseudorandom binary sequences, the so-called interleaved sequences, can be generated by means of linear multiplicative polynomial cellular automata. In fact, these linear automata generate all the solutions of a type of linear difference equations with binary coefficients. Interleaved sequences are just particular solutions of such equations. In this way, popular nonlinear sequence generators with cryptographic application can be linearized in terms of simple cellular automata. (C) 2009 Elsevier Ltd. All rights reserved.
引用
收藏
页码:1518 / 1524
页数:7
相关论文
共 15 条
[1]  
[Anonymous], 2016, HDB APPL CRYPTOGRAPH
[2]  
BETH T, 1985, LECT NOTES COMPUT SC, V209, P88
[3]   Synthesis of one-dimensional linear hybrid cellular automata [J].
Cattell, K ;
Muzio, JC .
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1996, 15 (03) :325-335
[4]  
Cho SJ, 2004, LECT NOTES COMPUT SC, V3305, P31
[5]  
Coppersmith D., 1994, Advances in Cryptology - CRYPTO '93. 13th Annual International Cryptology Conference Proceedings, P22
[6]  
Fúster-Sabater A, 2006, LECT NOTES COMPUT SC, V4173, P611
[7]   Run distribution in nonlinear binary generators [J].
Fúster-Sabater, A .
APPLIED MATHEMATICS LETTERS, 2004, 17 (12) :1427-1432
[8]  
FUSTERSABATER A, NEURAL NETW UNPUB
[9]   CLOCK-CONTROLLED SHIFT REGISTERS - A REVIEW [J].
GOLLMANN, D ;
CHAMBERS, WG .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1989, 7 (04) :525-533
[10]  
Golomb S.W., 1982, Shift Register Sequences