Permutation Polynomials and their Applications in Cryptography | Permutation polynomials and multivariate public key cryptography

Rajesh Pratap Singh

ISBN 10: 384840611X / ISBN 13: 9783848406111

Published by LAP Lambert Academic Publishing, 2012

About this Item

Permutation Polynomials and their Applications in Cryptography | Permutation polynomials and multivariate public key cryptography | Rajesh Pratap Singh | Taschenbuch | Englisch | LAP Lambert Academic Publishing | EAN 9783848406111 | Verantwortliche Person für die EU: LAP Lambert Academic Publishing, Brivibas Gatve 197, 1039 RIGA, LETTLAND, customerservice[at]vdm-vsg[dot]de | Anbieter: preigu.

Seller Inventory # 106490242

Bibliographic Details

• Title: Permutation Polynomials and their Applications in Cryptography | Permutation polynomials and multivariate public key cryptography
• Publisher: LAP Lambert Academic Publishing
• Publication Date: 2012
• Language: English
• ISBN 10: 384840611X
• ISBN 13: 9783848406111
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 6W x 150H x 220D millimeters 6 millimeters width by 150 millimeters height by 220 millimeters depth
• Weight: 139 grams
• Seller catalogs:
  • Bücher

About this title

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.

About the Author

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.