Applications of linearised and sub-linearised polynomials to information security

  • Marie Henderson
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1438)


Polynomials have been used in various security systems. We direct our attention to the polynomials that can be used in a Massey-Omura type cryptosystem. For the benefit of the reader we introduce the original Massey-Omura cryptosystem. We then introduce other classes of polynomials which satisfy the conditions required for this system to function. In particular, we focus on the classes of linearised and sub-linearised polynomials. These polynomials exhibit special compositional behaviour under certain conditions, allowing us to construct Massey-Omura type cryptosystems.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    S.D. Cohen, Exceptional polynomials and the reducibility of substitution polynomials, L'Enseignement Math. 36 (1990), 53–65.MATHGoogle Scholar
  2. [2]
    M. Giesbrecht, Factoring in skew-polynomial rings over finite fields, J. Symbolic Computation (to appear).Google Scholar
  3. [3]
    M. Henderson and R. Matthews, Composition behaviour of linearised and sub-linearised polynomials over a finite field, preprint.Google Scholar
  4. [4]
    N. Koblitz, A Course in Number Theory and Cryptography, Springer-Verlag, New York, Berlin, 1987.Google Scholar
  5. [5]
    R. Lidl, G.L. Mullen, and G. Turnwald, Dickson Polynomials, Pitman Monographs and Surveys in Pure and Appl. Math., vol. 65, Longman Scientific and Technical, Essex, England, 1993.Google Scholar
  6. [6]
    R. Lidl and H. Niederreiter, Finite Fields, Encyclopedia Math. Appl., vol. 20, Addison-Wesley, Reading, 1983, (now distributed by Cambridge University Press).Google Scholar
  7. [7]
    G.L. Mullen and T.P. Vaughan, Cycles of linear permutation over a finite field, Linear Algebra Appl. 108 (1988), 63–82.MATHMathSciNetCrossRefGoogle Scholar
  8. [8]
    W.B. Müller and R. Nöbauer, Some remarks on public-key cryptosystems, Studia Sci. Math. Hungar. 16 (1981), 71–76.MATHMathSciNetGoogle Scholar
  9. [9]
    H. Niederreiter, Some new cryptosystems based on feedback shift register sequences, Math. J. Okayama Univ. 30 (1988), 121–149.MATHMathSciNetGoogle Scholar
  10. [10]
    O. Ore, On a special class of polynomials, Trans. Amer. Math. Soc. 35 (1933), 559–584, Errata, ibid. 36, 275 (1934).MATHMathSciNetCrossRefGoogle Scholar
  11. [11]
    P.K.S. Wah and M.Z. Wang, Realization and Application of the Massey-Omura Lock, Proc. Internat. Zurich Seminar, March 6–8 1984, pp. 175–182.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Marie Henderson
    • 1
  1. 1.Centre for Discrete Mathematics and Computing, Department of Computer Science and Electrical EngineeringUniversity of QueenslandAustralia

Personalised recommendations