Linear complexity of periodic sequences: A general theory

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1109, Issue , 1996, Pages 358-371

  Massey, James L ^a   Serconek, Shirlei ^b  

^a ETH ZURICH   (Switzerland)

^b FEDERAL UNIVERSITY OF GOIÁS   (Brazil)

Author keywords

Chan algorithm; DFT games; Discrete fourier transform; Hadamard product; Hasse derivative; Hyperderivative; Linear complexity; Stream ciphers

Indexed keywords

CRYPTOGRAPHY; DISCRETE FOURIER TRANSFORMS; HADAMARD TRANSFORMS;

CHAN ALGORITHM; DFT GAMES; HADAMARD PRODUCTS; HYPERDERIVATIVE; LINEAR COMPLEXITY; STREAM CIPHERS;

BINARY SEQUENCES;

EID: 84955614319     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68697-5_27     Document Type: Conference Paper

References (16)

1. E. R. Berlekainp, Algebraic Coding Theory. New York: McGraw-Hill, 1968.
2. S. R. Blackburn, ''A Generalisation of the Discrete Fourier Transform: Determining the Minimal Polynomial oI a Periodic Sequence," IEEE Trans. Inform. Theory, vol. IT-40, pp. 1702-1704, Nov. 1994.
3. G. Castagnoli, J. L. Massey, P. A. Schoeller, and N. Seemann, "On Repeated-Root, Cyclic Codes," IEEE Trans. Inform. Theory, vol. IT-37, pp. 337-342, March 1991.
4. R. A. Games and A. H. Chan, "A Fast Algorithm for Determining the Complexity of a Binary Sequence with Period 2'\" IEEE Trans. Inform. Theory, vol. IT-29, pp. 144-146, Jan. 1983.
5. C. G. Günther, ''A Finite Field Fourier Transform for Vectors of Arbitrary Length," pp. 141-153 in Communications and Cryptography: Two Sides of One Tapestry (Eds. R. E. Blalint, D..1. Costello, Jr., U. Maurer and T. Mittelholzer). Norweü, MA, and Dordrecht, NL: Kluver Academic, 1994.
6. R. Göttfert and H. Niederreiter, "Ilasse-Teichmüller Derivatives and Products of Linear Recurring Sequences," Comtemparary Mathematics, vol. 168, pp.117-125, 1994.
7. H. Hasse, " Iheorie der höheren Differentiate in einem algebraischen Funktio- neukõrpor rnit vollkommenen Konstantenkörpcr bei beliebiger Charakteristik," J. Retric n. Aug. Math., vol. 175, pp. 50-54, 1936.
8. E. L. Key, "An analysis of the Structure and Complexity of Nonlinear Binary Sequence Generators," IEEE Trans. Inform. Th., vol. IT-22, pp. 732- 736, Nov. 1976.
9. R. Lidl and H. Niederreiter, Finite Fields, Encyclopedia of Mathematics and its Applications, vol. 20. Englewood Cliffs, NJ: Addison-Wesley, 1983.
10. M. E. Lucas, "Sur les congruences des nombres euleriennos et des coefficients diffénticls des functions Irigonométriquos, suivant un-module premier," Bull. Soc. Math. France, vol. 6, pp. 49-54, 1878.
11. J. L. Massey and S. Serconek, "A Fourier Transform Approach to the Linear Complexity of Nonlinearly Filtered Sequences," Advances in Cryptology-CRYPTO '94 (Ed. Y. G. Desinedt), Lecture Notes in Computer Science No. 839. New York: Springer, pp.322-340, 1994.
12. P. Mathys, "A Generalization of the Discrete Fourier Transform in Finite Fields," Proc. IEEE Symp. inform. Theory, San Diego (CA), pp. 14-19, 1990.
13. K. Paterson, "On the Linear Complexity of Nonlinearly Filtered m-sequences," preliminary manuscript, Feb. 2, 1996.
14. M. Robshaw, "On Evaluating the Linear Complexity of a Sequence of Least Period 2"," Designs, Codes and Cryptography, vol. 4, pp. 263-269, 1994.
15. R. A. Riicppel, Analysis and Design of Stream Ciphers. Heidelberg and New York: Springer, 1986.
16. O. Teichmũuer, "Difderentialrechnung bei Charackteristik p" J. Reint: u. Ang. Math vol. 175, pp. 89-99, 1936.