Advertisement

Using Algorithms as Keys in Stream Ciphers

Conference paper
  • 753 Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 219)

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.

References

  1. [Aho74]
    A. V. Aho, J. E. Hopcroft, and J. D. Ullman, “Design and Analysis of Computer Algorithms,” Addison-Wesley, 1974.Google Scholar
  2. [Asm81]
    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.CrossRefMathSciNetGoogle Scholar
  3. [Bla79]
    G. R. Blakley, “Safeguarding cryptographic keys,” Proc. NCC, Vol. 48, AFIPS Press, 1979, pp. 313–317.Google Scholar
  4. [Bla81]
    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.Google Scholar
  5. [Bla84]
    G. R. Blakley, and C. Meadows, “Security of ramp schemes,” Proceedings of Crypto 84, Springer-Verlag, New York (1984).Google Scholar
  6. [Blu84]
    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.zbMATHCrossRefMathSciNetGoogle Scholar
  7. [Cha66]
    G. J. Chaitin, “On the length of programs for computing finite binary sequences,” Journal of the ACM 13 (1966), pp. 547–569.zbMATHCrossRefMathSciNetGoogle Scholar
  8. [Cha69]
    G. J. Chaitin, “On the length of programs for computing finite binary sequences: statistical considerations,” Journal of the ACM 16 (1969), pp. 145–159.zbMATHCrossRefMathSciNetGoogle Scholar
  9. [Cha75]
    G. J. Chaitin, “A theory of program size formally identical to information theory,” Journal of the ACM 22 (1975), pp. 329–340.zbMATHCrossRefMathSciNetGoogle Scholar
  10. [Eve84]
    S. Even, and O. Goldreich, “ON the power of cascade ciphers,” ACM Transactions on Computer Systems 3,2 (1985), pp. 108–116.CrossRefGoogle Scholar
  11. [Kan84]
    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.Google Scholar
  12. [Knu81]
    D. Knuth, The Art of Computer Programming: Seminumerical Algorithms, 2nd Edition, Addison-Wesley, 1981.Google Scholar
  13. [Ko84]
    K. Ko, “A definition of infinite pseudo-random sequences,” manuscript.Google Scholar
  14. [Kol65]
    A. N. Kolmogorov, “Three approaches to the quantitative definition of information,” Prob. of Inform. Transmission 1,1 (1965), pp. 1–7.MathSciNetGoogle Scholar
  15. [Kra84]
    E. Kranakis, “Theoretical aspects of the security of public key cryptography,” Technical Report 331, Dept of Computer Science, Yale Univ., Sept. 1984.Google Scholar
  16. [Mar66]
    P. Martin-Löf, “On the definition of random sequences,” Inform. and Control 9 (1966), pp. 602–619.CrossRefGoogle Scholar
  17. [Mas85]
    J. L. Massey, and I. Ingemarson, “Toward a practical, computationally-secure cipher,” presentation at Eurocrypt 85.Google Scholar
  18. [Riv83]
    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.Google Scholar
  19. [Sha79]
    A. Shamir, “How to share a secret,” Communications of the ACM 22, 11 (Nov. 1979), pp. 612–613.zbMATHCrossRefMathSciNetGoogle Scholar
  20. [Sha83]
    A. Shamir, “On the generation of cryptographically strong pseudo-random sequences,” ACM Transactions on Computer Systems 1,1 (Feb. 1983), pp. 38–44.CrossRefMathSciNetGoogle Scholar
  21. [Yao82]
    A. C. Yao, “Theory and applications of trapdoor functions,” Proc. 23rd IEEE Symp. on Found. of Computer Science, 1982, pp. 80–91.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  1. 1.Mathematics and Computer ScienceDrexel UniversityPhiladelphiaUSA

Personalised recommendations