Abstract
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.
Research supported in part by NSF grant DCR-8403350 and by a Research Scholar award from Drexel University.
Chapter PDF
Similar content being viewed by others
References
A. V. Aho, J. E. Hopcroft, and J. D. Ullman, “Design and Analysis of Computer Algorithms,” Addison-Wesley, 1974.
C. G. Asmuth, and G. R. Blakley, “An efficient algorithm for constructing a cryptosystem which is harder to crack than two other cryptosystems,” Comps. and Maths. with Applications 7 (1981), pp. 447–450.
G. R. Blakley, “Safeguarding cryptographic keys,” Proc. NCC, Vol. 48, AFIPS Press, 1979, pp. 313–317.
G. R. Blakley, and L. Swanson, “Security proofs for information protection systems,” Proceedings of the 1981 Symposium on Security and Privacy, IEEE Computer Society, 1982, pp. 75–88.
G. R. Blakley, and C. Meadows, “Security of ramp schemes,” Proceedings of Crypto 84, Springer-Verlag, New York (1984).
M. Blum, and S. Micali, “How to generate cryptographically strong sequences of pseudo-random bits,” SIAM J. Computing 13,4 (Nov. 1984), pp. 850–864.
G. J. Chaitin, “On the length of programs for computing finite binary sequences,” Journal of the ACM 13 (1966), pp. 547–569.
G. J. Chaitin, “On the length of programs for computing finite binary sequences: statistical considerations,” Journal of the ACM 16 (1969), pp. 145–159.
G. J. Chaitin, “A theory of program size formally identical to information theory,” Journal of the ACM 22 (1975), pp. 329–340.
S. Even, and O. Goldreich, “ON the power of cascade ciphers,” ACM Transactions on Computer Systems 3,2 (1985), pp. 108–116.
R. Kannan, A. K. Lenstra, and L. Lovasz, “Polynomial factorization and nonrandomness of bits of algebraic and some transcendental numbers,” ACM Symposium on the Theory of Computing, 1984, pp. 191–200.
D. Knuth, The Art of Computer Programming: Seminumerical Algorithms, 2nd Edition, Addison-Wesley, 1981.
K. Ko, “A definition of infinite pseudo-random sequences,” manuscript.
A. N. Kolmogorov, “Three approaches to the quantitative definition of information,” Prob. of Inform. Transmission 1,1 (1965), pp. 1–7.
E. Kranakis, “Theoretical aspects of the security of public key cryptography,” Technical Report 331, Dept of Computer Science, Yale Univ., Sept. 1984.
P. Martin-Löf, “On the definition of random sequences,” Inform. and Control 9 (1966), pp. 602–619.
J. L. Massey, and I. Ingemarson, “Toward a practical, computationally-secure cipher,” presentation at Eurocrypt 85.
R. L. Rivest, and A. T. Sherman, “Randomized encryption techniques,” Advances in Cryptology: Proceedings of Crypto 82, ed. by D. Chaum, et al., Plenum, 1983, pp. 145–163.
A. Shamir, “How to share a secret,” Communications of the ACM 22, 11 (Nov. 1979), pp. 612–613.
A. Shamir, “On the generation of cryptographically strong pseudo-random sequences,” ACM Transactions on Computer Systems 1,1 (Feb. 1983), pp. 38–44.
A. C. Yao, “Theory and applications of trapdoor functions,” Proc. 23rd IEEE Symp. on Found. of Computer Science, 1982, pp. 80–91.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wagner, N.R., Putter, P.S., Cain, M.R. (1986). Using Algorithms as Keys in Stream Ciphers. In: Pichler, F. (eds) Advances in Cryptology — EUROCRYPT’ 85. EUROCRYPT 1985. Lecture Notes in Computer Science, vol 219. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39805-8_18
Download citation
DOI: https://doi.org/10.1007/3-540-39805-8_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16468-5
Online ISBN: 978-3-540-39805-9
eBook Packages: Springer Book Archive