Text

Permutation polynomials and their applications in cryptography: permutation polynomials and multivariate public key cryptography

---

A polynomial over a finite ring R is called permutation polynomial if it induces a bijection from R to R. Permutation polynomials have been a subject of study for many years and have applications in many areas of science and engineering. This monograph contains some results related to permutation polynomials over finite rings and finite fields. A survey of known results and detailed bibliography is provided. A special feature is the applications of permutation polynomials in multivariate public key cryptography. Multivariate public key cryptography is a branch of public key cryptography in which the cryptosystems are based on the problem of solving nonlinear equations over finite fields. This monograph contains design and analysis of some efficient multivariate public key cryptosystems using permutation polynomials over finite fields.

---

Availability

Detail Information

Series Title

--

Call Number

512.2 SIN p

Publisher

Saarbrucken : Lambert Academic Publishing., 2012

Collation

vi, 79 hlm.; 22 cm.

Language

English

ISBN/ISSN

9783848406111

Classification

512.2

Content Type

-

Media Type

-

Carrier Type

-

Edition

--

Subject(s)

Cryptography
Combinatorics
Discrete mathematics

Specific Detail Info

--

Statement of Responsibility

Rajesh Pratap Singh

Other version/related

File Attachment

Comments

---

You must be logged in to post a comment