Cryptanalysis of the Dickson-Scheme
- 894 Downloads
In Müller and W . Nöbauer (1981) a new public-key cryptosystem was introduced. Similar to the well-known RSA-scheme, the plaintext alphabet and the code alphabet of this cryptosystem are given by Z/(n), the ring of residue classes of the integers Z modulo a natural number n. In contrast to the RSA-scheme, however, n need not be square free, but can be an arbitrary positive integer. The encryption polynomials xk of the RSA-scheme are replaced by another class of polynomials, namely by the so-called Dickson-polynomials. We call this cryptosystem the Dickson-scheme.
- Nöbauer, R. (1985): Über die Fixpunkte von durch Dicksonpolynome dargestellten Permutationen. Acta Arithmetica 45, 91–99.Google Scholar
- Nöbauer, R. (1985/86): Key distribution systems based on polynomial functions and on Rédei-functions. To appear in Problems of Control and Information Theory.Google Scholar
- Nöbauer, W. (1985): On the length of cycles of polynomial permutations. To appear in Contributions to General Algebra 3, Verlag B.G. Teubner, Stuttgart.Google Scholar
- Schnorr, C.P. (1981): Zur Analyse des RSA-Schemas. Preprint. Fachbereich Mathematik, Universität Frankfurt.Google Scholar