Cryptanalysis of a public-key cryptosystem based on Dickson-polynomials

Rupert Nöbauer

Mathematica Slovaca (1988)

  • Volume: 38, Issue: 4, page 309-323
  • ISSN: 0232-0525

How to cite

top

Nöbauer, Rupert. "Cryptanalysis of a public-key cryptosystem based on Dickson-polynomials." Mathematica Slovaca 38.4 (1988): 309-323. <http://eudml.org/doc/31732>.

@article{Nöbauer1988,
author = {Nöbauer, Rupert},
journal = {Mathematica Slovaca},
keywords = {public-key cryptosystem; Dickson-polynomials; polynomial equations of ciphertexts; enciphering functions; superencryption procedures},
language = {eng},
number = {4},
pages = {309-323},
publisher = {Mathematical Institute of the Slovak Academy of Sciences},
title = {Cryptanalysis of a public-key cryptosystem based on Dickson-polynomials},
url = {http://eudml.org/doc/31732},
volume = {38},
year = {1988},
}

TY - JOUR
AU - Nöbauer, Rupert
TI - Cryptanalysis of a public-key cryptosystem based on Dickson-polynomials
JO - Mathematica Slovaca
PY - 1988
PB - Mathematical Institute of the Slovak Academy of Sciences
VL - 38
IS - 4
SP - 309
EP - 323
LA - eng
KW - public-key cryptosystem; Dickson-polynomials; polynomial equations of ciphertexts; enciphering functions; superencryption procedures
UR - http://eudml.org/doc/31732
ER -

References

top
  1. BERKOWITZ S., Factoring via superencryption, Cгyptologia. 6, 1982, 229-237. (1982) MR0664299
  2. HERLESTAM T., Critical remaгks on some public-key cryptosystems, BIT. 18, 1978, 493-496. (1978) MR0520758
  3. LIDL R., MÜLLER W. B., Permutation polynomials in RSA-cгyptosystems, Proc. Crypto 83. Univ. Calif. St. Barbara, 1984, 293-301. (1984) 
  4. MÜLLER W. B., Über eine Klasse von durch Dikson-Polynome dargestellten Gruppen, Proc. of the Colloq. on rings, modules and radicals. Keszthely 1971, 1973, 361-376. (1971) MR0352059
  5. MÜLLER W. B., NÖBAUER R., Cryptanalysis of the Dickson-scheme, Proc. Eurocrypt 85, Lecture Notes in Computer Science, Vol. 219, 1986, 50-61. (1986) Zbl0591.94018MR0851582
  6. MÜLLER W. B., NÖBAUER W., Some remarks on public-key cryptosystems, Studia Sci. Math. Hungar. 16, 1981, 71-76. (1981) Zbl0476.94016MR0703643
  7. NÖBAUER R., Über die Fixpunkte von durch Dicksonpolynome dargestellten Permutationen, Acta Arith. 45, 1985, 91-99. (1985) Zbl0544.12012MR0797261
  8. NÖBAUER R., Cryptanalysis of the Rédei-scheme, Proc. Vienna Conf. 84. Contributions to General Algebra. 3, 1985, 255-164. (1985) Zbl0602.94012MR0815132
  9. NÖBAUER R., Key distribution systems based on polynomial functions and on Rédei-functions, Problems of Control and Information Theory. 15, 1986, 91-100. (1986) Zbl0607.94007MR0845013
  10. NÖBAUER R., Rédei-Funktionen und ihre Anwendung in der Kryptographie, To appear in Acta Sci. Math. Szeged. Zbl0618.12015MR0882041
  11. NÖBAUER W., Über Permutationspolynome und Permutationsfunktionen für Primzahlpotenzen, Nonatsh. Math. 69, 1965, 230-238. (1965) Zbl0131.04201MR0180519
  12. NÖBAUER W., Über eine Klasse von Permutationspolynomen und die dadurch dargestellten Gruppen, J. reine angew. Math. 231, 1968, 215-219. (1968) Zbl0159.05402MR0228470
  13. RÉDEI L., Über eindeutig umkehrbare polynome in endlichen Körpern, Acta Sci. Math. Szeged. 11, 1946, 85-92. (1946) Zbl0061.01607MR0017323
  14. RIVEST R. L., Remarks on a proposed cryptanalytic attack on the M.I.T. public-key cryptosystem, Cryptologia. 2, 1978, 62-65. (1978) 
  15. RIVEST R. L., SHAMIR A., ADLEMAN L., A method for obtaining digital signatures and public-key cryptosystems, Commun. ACM. 21, 1978, 120-126. (1978) Zbl0368.94005MR0700103
  16. SCHNORR C. P., Is the RSA-scheme safe?, Lecture Notes m Computer Science. Vol. 149, 1983, 325-329. (1983) Zbl0506.68036
  17. SIMMONS G. J., NORRIS N. J., Preliminary comments on the M.I.T. public-key cryptosystem, Cryptologia. 1, 1977, 406-414. (1977) 

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.