zbMATH — the first resource for mathematics

A public-key cryptosystem based upon equations over a finite field. (English) Zbl 0537.94014
Summary: The present paper describes a public-key cryptological method based upon a relation like \(c=m^ e\) modulo r where e and r are not known by anyone but the intended receiver of the messages. This is in contrast to the well known method denoted RSA after the introducers Rivest, Shamir and Adleman. Instead of working with very large natural numbers the method as described here works with polynomials over finite fields. How to compute c from m without knowing e and r is described and a very simple case is worked out in some detail.

94A60 Cryptography
11T06 Polynomials over finite fields
Full Text: DOI