USlNG A!-GO RITHMSAS KFYS IN STREAM CIPHERS

This paper discusses the use of an arbitrary bit-sequence generating algorithm as the cryptographic key for a stream cipher. Emphasis is placed on methods for combining stream generators into more complex ones, with and without randomization. Threshold schemes give a generalization of many combination techniques.

[1]  Gregory J. Chaitin,et al.  A recent technical report , 1974, SIGA.

[2]  Catherine A. Meadows,et al.  Security of Ramp Schemes , 1985, CRYPTO.

[3]  G. R. Blakley,et al.  Security Proofs for Information Protection Systems , 1981, 1981 IEEE Symposium on Security and Privacy.

[4]  A. Kolmogorov Three approaches to the quantitative definition of information , 1968 .

[5]  Gregory J. Chaitin,et al.  On the Length of Programs for Computing Finite Binary Sequences: statistical considerations , 1969, JACM.

[6]  László Lovász,et al.  Polynomial factorization and nonrandomness of bits of algebraic and some transcendental numbers , 1984, STOC '84.

[7]  Ronald L. Rivest,et al.  Randomized Encryption Techniques , 1982, CRYPTO.

[8]  Adi Shamir,et al.  On the generation of cryptographically strong pseudorandom sequences , 1981, TOCS.

[9]  Gregory J. Chaitin,et al.  On the Length of Programs for Computing Finite Binary Sequences , 1966, JACM.

[10]  Per Martin-Löf,et al.  The Definition of Random Sequences , 1966, Inf. Control..

[11]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[12]  G. R. BLAKLEY Safeguarding cryptographic keys , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[13]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[14]  Oded Goldreich,et al.  On the power of cascade ciphers , 1985, TOCS.

[15]  Donald E. Knuth,et al.  The art of computer programming. Vol.2: Seminumerical algorithms , 1981 .

[16]  Manuel Blum,et al.  How to generate cryptographically strong sequences of pseudo random bits , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[17]  Andrew Chi-Chih Yao,et al.  Theory and application of trapdoor functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[18]  G. Blakley,et al.  An efficient algorithm for constructing a cryptosystem which is harder to break than two other cryptosystems , 1981 .