Investigations on nonlinear streamcipher systems: construction and evaluation methods

[1]  Whitfield Diffie.  The first ten years of public-key cryptography , 1988 .

[2]  J. Pieter M. Schalkwijk,et al.  An algorithm for source coding , 1972, IEEE Trans. Inf. Theory.

[3]  Shimon Even,et al.  The Design of Shift Register Generators for Finite Sequences , 1969, IEEE Transactions on Computers.

[4]  Abraham Lempel,et al.  A universal algorithm for sequential data compression , 1977, IEEE Trans. Inf. Theory.

[5]  de Ng Dick Bruijn.  A combinatorial problem , 1946 .

[6]  He Hans Wanders.  On the significance of Golomb's randomness postulates in cryptography , 1988 .

[7]  Rainer A. Rueppel.  New approaches to stream ciphers , 1984 .

[8]  Frank Rubin,et al.  Decrypting a Stream Cipher Based on J-K Flop-Flops , 1979, IEEE Trans. Computers.

[9]  R. Gallager.  Information Theory and Reliable Communication , 1968 .

[10]  James L. Massey,et al.  Shift-register synthesis and BCH decoding , 1969, IEEE Trans. Inf. Theory.

[11]  Irene A. Stegun,et al.  Handbook of Mathematical Functions. , 1966 .

[12]  Cees J. A. Jansen,et al.  Modes of Blockcipher Algorithms and their Protection Against Active Eavesdropping , 1987, EUROCRYPT.

[13]  Andrew J. Viterbi,et al.  Principles of Digital Communication and Coding , 1979 .

[14]  Justo Sancho.  Enumeration of multivariable decipherable Boolean Functions , 1987, Cryptologia.

[15]  S. Golomb.  Run-length encodings. , 1966 .

[16]  C. K. Yuen,et al.  Theory and Application of Digital Signal Processing , 1978, IEEE Transactions on Systems, Man, and Cybernetics.

[17]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[18]  조위덕.  Cryptography , 1987, The Official (ISC)2 SSCP CBK Reference.

[19]  Irving S. Reed,et al.  Galois Switching Functions and Their Applications , 1975, IEEE Transactions on Computers.

[20]  David Haussler,et al.  Linear size finite automata for the set of all subwords of a word - an outline of results , 1983, Bull. EATCS.

[21]  Harold Fredricksen,et al.  A Class of Nonlinear de Bruijn Cycles , 1975, J. Comb. Theory, Ser. A.

[22]  Cees J. A. Jansen.  Protection Against Active Eavesdropping , 1986, EUROCRYPT.

[23]  Vera Pless,et al.  Encryption Schemes for Computer Confidentiality , 1977, IEEE Transactions on Computers.

[24]  Cees J. A. Jansen,et al.  An efficient algorithm for the generation of DeBruijn cycles , 1991, IEEE Trans. Inf. Theory.

[25]  Edward M. McCreight,et al.  A Space-Economical Suffix Tree Construction Algorithm , 1976, JACM.

[26]  N. Sloane.  A Handbook Of Integer Sequences , 1973 .

[27]  Henk C. A. van Tilborg,et al.  An Introduction to Cryptology , 1988 .

[28]  J. L. Massey,et al.  An introduction to contemporary cryptology , 1988, Proc. IEEE.

[29]  Xuejia Lai,et al.  Condition for the nonsingularity of a feedback shift-register over a general finite field , 1987, IEEE Trans. Inf. Theory.

[30]  Abraham Lempel,et al.  On the Complexity of Finite Sequences , 1976, IEEE Trans. Inf. Theory.

[31]  Martin E. Hellman,et al.  An extension of the Shannon theory approach to cryptography , 1977, IEEE Trans. Inf. Theory.

[32]  Solomon W. Golomb.  On the classification of balanced binary sequences of period 2n-1 (Corresp.) , 1980, IEEE Trans. Inf. Theory.

[33]  Michael S. Waterman,et al.  An Erdös-Rényi law with shifts , 1985 .

[34]  Claude E. Shannon,et al.  Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..

[35]  Thomas Siegenthaler,et al.  Decrypting a Class of Stream Ciphers Using Ciphertext Only , 1985, IEEE Transactions on Computers.

[36]  Dick E. Boekee,et al.  Divergence Bounds on Key Equivocation and Error Probability in Cryptanalysis , 1985, CRYPTO.

[37]  Thomas Siegenthaler,et al.  Correlation-Immune Polynomials over Finite Fields , 1986, EUROCRYPT.

[38]  Lours,et al.  An Extreme Value Theory for Sequence Matching , 2022 .

[39]  Thomas K. Gaylord,et al.  Truth-table look-up processing: number representation, multilevel coding, and logical minimization , 1986 .

[40]  J. Bernasconi,et al.  Analysis of a Nonlinear Feedforward Logic for Binary Sequence Generators , 1985, EUROCRYPT.

[41]  H. Fredricksen.  A Survey of Full Length Nonlinear Shift Register Cycle Algorithms , 1982 .

[42]  M. J. Baxter,et al.  The Role of Encipherment Services in Distributed Systems , 1985, EUROCRYPT.

[43]  Thomas M. Cover,et al.  Enumerative source encoding , 1973, IEEE Trans. Inf. Theory.

[44]  Tuvi Etzion,et al.  Algorithms for the generation of full-length shift-register sequences , 1984, IEEE Trans. Inf. Theory.

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

[46]  Michael S. Waterman,et al.  Critical Phenomena in Sequence Matching , 1985 .

[47]  E. McCluskey.  Minimization of Boolean functions , 1956 .

[48]  Don J. Torrieri,et al.  Principles of military communication systems , 1981 .

[49]  Cees J. A. Jansen.  On the key storage requirements for secure terminals , 1986, Comput. Secur..

[50]  Jacobus Hendricus van Lint,et al.  Combinatorial theory seminar, Eindhoven University of Technology , 1974 .