论文信息 - Structural Properties of Cryptographic Sequences

Structural Properties of Cryptographic Sequences

In the present work, it is shown that the binary sequences obtained from a cryptographic generator, the so-called generalized self-shrinking generator, are just particular solutions of a type of linear difference equations. Cryptographic parameters e.g. period, linear complexity or balancedness of the previous sequences can be analyzed in terms of linear equation solutions. In brief, computing the solutions of linear difference equations is an easy method of generating new sequences with guaranteed cryptographic parameters.

Amparo Fúster-Sabater

[1] L. Dickson. Linear Groups, with an Exposition of the Galois Field Theory , 1958 .

[2] Alfredo De Santis,et al. Advances in Cryptology — EUROCRYPT'94 , 1994, Lecture Notes in Computer Science.

[3] Matthew J. B. Robshaw,et al. New Stream Cipher Designs: The eSTREAM Finalists , 2008 .

[4] Douglas R. Stinson,et al. Advances in Cryptology — CRYPTO’ 93 , 2001, Lecture Notes in Computer Science.

[5] Guozhen Xiao,et al. Generalized self-shrinking generator , 2004, IEEE Trans. Inf. Theory.

[6] Pino Caballero-Gil,et al. Strategic attack on the shrinking generator , 2008, Theor. Comput. Sci..

[7] Hugo Krawczyk,et al. The Shrinking Generator , 1994, CRYPTO.

[8] Pino Caballero-Gil,et al. Deterministic Computation of Pseudorandomness in Sequences of Cryptographic Application , 2009, ICCS.

[9] Alfred Menezes,et al. Handbook of Applied Cryptography , 2018 .

[10] Willi Meier,et al. The Self-Shrinking Generator , 1994, EUROCRYPT.

[11] Solomon W. Golomb,et al. Shift Register Sequences , 1981 .

[12] Harald Niederreiter,et al. Introduction to finite fields and their applications: List of Symbols , 1986 .

[13] Jack Dongarra,et al. Computational Science – ICCS 2009: 9th International Conference Baton Rouge, LA, USA, May 25-27, 2009 Proceedings, Part I , 2009, ICCS.