A Public-Key Cryptosystem Based on Shift Register Sequences

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


Various cryptosystems using finite field arithmetic have been introduced recently, e.g. cryptosystems based on permutations of finite fields (Lidl and Huller [8], Nöbauer [12]), cryptosystems of the knapsack type (Chor and Rivest [4], Niederreiter [11]), and cryptosystems based on discrete exponentiation in finite fields (Odlyzko [13], Wah and Wang [14]). Finite fields also play a role in the construction of stream ciphers (Beker and Piper [1], Beth et al. [2], Lidl and Niederreiter [10]). The security of cryptosystems based on discrete exponentiation has recently been diminished by significant progress on the discrete logarithm problem (Blake et al. [3], Coppersmith [5], Coppersmith et al. [6]). In this paper we propose a public-key cryptosystem that has a more complex structure than the corresponding discrete-exponentiation cryptosystem and is therefore potentially harder to break. This cryptosystem uses feedback shift register (FSR) sequences in finite fields and is thus easy to implement.


Finite Field Discrete Logarithm Minimal Polynomial Stream Cipher Discrete Logarithm Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    H. Beker and F. Piper: Cipher Systems. The Protection of Communications, Northwood Books, London, 1982.Google Scholar
  2. 2.
    T. Beth, P. Heß, and K. Wirl: Kryptographie, Teubner, Stuttgart, 1983.zbMATHGoogle Scholar
  3. 3.
    I._F. Blake, R. Fuji-Hara, R. C. Mullin, and S. A. Vanstone: Computing logarithms in finite fields of characteristic two, SIAM J. Alg. Discr. Methods 5, 276–285 (1984).zbMATHMathSciNetCrossRefGoogle Scholar
  4. 4.
    B. Chor and R. L. Rivest: A knapsack type public key cryptosystem based on arithemtic in finite fields, Proc. CRYPTO’ 84, to appear.Google Scholar
  5. 5.
    D. Coppersmith: Fast evaluation of logarithms in fields of characteristic two, IEEE Trans. Inform. Theory 30, 587–594 (1984).zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    D. Coppersmith, A. M. Odlyzko, and R. Schroeppel: Discrete logarithms in GF(p), preprint.Google Scholar
  7. 7.
    C. M. Fiduccia: An efficient formula for linear recurrences, SIAM J. Comput. 14, 106–112 (1985).zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    R. Lidl and W. B. Müller: A note on polynomials and functions in algebraic cryptography, Ars Combin. 17A, 223–229 (1984).Google Scholar
  9. 9.
    R. Lidl and H. Niederreiter: Finite Fields, Addison-Wesley, Reading, Mass., 1983.zbMATHGoogle Scholar
  10. 10.
    R. Lidl and H. Niederreiter: Introduction to Finite Fields and Their Applications, Cambridge Univ. Press, in press.Google Scholar
  11. 11.
    H. Niederreiter: Knapsack-type cryptosystems and algebraic coding theory, Problems of Control and Information Theory, to appear.Google Scholar
  12. 12.
    R. Nöbauer: Rédei-Funktionen und ihre Anwendung in der Kryptographie, Acta Sci. Math. Szeged, to appear.Google Scholar
  13. 13.
    A. M. Odlyzko: Discrete logarithms in finite fields and their cryptographic significance, Proc. EUROCRYPT’ 84, to appear.Google Scholar
  14. 14.
    P. K. S. Wah and M. Z. Wang: Realization and application of the Massey-Omura lock, Proc. Intern. Sem. on Digital Communications (Zürich, 1984), pp. 175–182.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  1. 1.Mathematical InstítuteAustrian Academy of SciencesViennaAustria

Personalised recommendations