Abstract
This paper investigates the role of permutation polynomials in the design of public key cryptosystems and public key distribution systems. Several permutation polynomials for which the computation of the inverse is easy are examined and their suitability to constructing secure public key systems are discussed. A method of designing highly secure public key systems using permutation polynomials under the law of composition is also considered.
Original language | English |
---|---|
Pages (from-to) | 237-250 |
Number of pages | 14 |
Journal | International Journal of Computer Mathematics |
Volume | 23 |
Issue number | 3-4 |
DOIs | |
Publication status | Published - 1988 |
Externally published | Yes |
Keywords
- computation in finite fields
- cryptography
- data encryption
- Dlckson polynomials
- factorization
- permutation polynomials
- prime numbers
- privacy
- Public key cryptosystems
- public key distribution
- Riidei functions
- security
- trapdoor systems