Permutation Polynomials and their Applications in Cryptography: Permutation polynomials and multivariate public key cryptography - Couverture souple

Singh, Rajesh Pratap

 
9783848406111: Permutation Polynomials and their Applications in Cryptography: Permutation polynomials and multivariate public key cryptography
Couverture souple
ISBN 10 : 384840611X ISBN 13 : 9783848406111
Editeur : LAP LAMBERT Academic Publishing, 2012

Synopsis

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.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Présentation de l'éditeur

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.

Biographie de l'auteur

Dr. Rajesh Pratap Singh has obtained his PhD from Department of Mathematics, Indian Institute of Technology Guwahati, India. Currently, he is an assistant professor at the Department of Mathematics, Central University of Bihar, India. His research interests include Finite Fields and Cryptography.

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Éditeur
LAP LAMBERT Academic Publishing
Date d'édition
2012
Langue
anglais
ISBN 10 
384840611X
ISBN 13 
9783848406111
Reliure
Broché
Nombre de pages
92
Coordonnées du fabricant
non disponible
Personne responsable
KreGa Onlinehandel GmbH
4950000000000
info@krega-onlinehandel.de

Birkenweg 31
Brakel
33034
Allemagne