Applications of linearised and sub-linearised polynomials to information security
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.
- M. Giesbrecht, Factoring in skew-polynomial rings over finite fields, J. Symbolic Computation (to appear).Google Scholar
- M. Henderson and R. Matthews, Composition behaviour of linearised and sub-linearised polynomials over a finite field, preprint.Google Scholar
- N. Koblitz, A Course in Number Theory and Cryptography, Springer-Verlag, New York, Berlin, 1987.Google Scholar
- 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
- R. Lidl and H. Niederreiter, Finite Fields, Encyclopedia Math. Appl., vol. 20, Addison-Wesley, Reading, 1983, (now distributed by Cambridge University Press).Google Scholar
- 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