Multivariate Public Key Cryptosystems / by Jintai Ding, Albrecht Petzoldt, Dieter S. Schmidt

By:

Ding, Jintai [VerfasserIn]

Contributor(s):

Resource type: Ressourcentyp: Buch (Online)Book (Online)Language: English Series: Advances in Information Security ; 80 | Springer eBook CollectionPublisher: New York, NY : Springer US, 2020Publisher: New York, NY : Imprint: Springer, 2020Edition: 2nd ed. 2020Description: 1 Online-Ressource(XXV, 253 p. 30 illus.)ISBN:

9781071609873

Subject(s):

Additional physical formats: 9781071609859 | 9781071609866 | Erscheint auch als: 9781071609859 Druck-Ausgabe | Erscheint auch als: 9781071609866 Druck-AusgabeDOI: DOI: 10.1007/978-1-0716-0987-3Online resources:

Summary: Introduction -- Multivariate Cryptography -- The Matsumoto-Imai Cryptosystem -- Hidden Field Equations -- Oil and Vinegar -- MQDSS -- The SimpleMatrix Encryption Scheme -- Solving Polynomial Systems.Summary: This book discusses the current research concerning public key cryptosystems. It begins with an introduction to the basic concepts of multivariate cryptography and the history of this field. The authors provide a detailed description and security analysis of the most important multivariate public key schemes, including the four multivariate signature schemes participating as second round candidates in the NIST standardization process for post-quantum cryptosystems. Furthermore, this book covers the Simple Matrix encryption scheme, which is currently the most promising multivariate public key encryption scheme. This book also covers the current state of security analysis methods for Multivariate Public Key Cryptosystems including the algorithms and theory of solving systems of multivariate polynomial equations over finite fields. Through the book’s website, interested readers can find source code to the algorithms handled in this book. In 1994, Dr. Peter Shor from Bell Laboratories proposed a quantum algorithm solving the Integer Factorization and the Discrete Logarithm problem in polynomial time, thus making all of the currently used public key cryptosystems, such as RSA and ECC insecure. Therefore, there is an urgent need for alternative public key schemes which are resistant against quantum computer attacks. Researchers worldwide, as well as companies and governmental organizations have put a tremendous effort into the development of post-quantum public key cryptosystems to meet this challenge. One of the most promising candidates for this are Multivariate Public Key Cryptosystems (MPKCs). The public key of an MPKC is a set of multivariate polynomials over a small finite field. Especially for digital signatures, numerous well-studied multivariate schemes offering very short signatures and high efficiency exist. The fact that these schemes work over small finite fields, makes them suitable not only for interconnected computer systems, but also for small devices with limited resources, which are used in ubiquitous computing. This book gives a systematic introduction into the field of Multivariate Public Key Cryptosystems (MPKC), and presents the most promising multivariate schemes for digital signatures and encryption. Although, this book was written more from a computational perspective, the authors try to provide the necessary mathematical background. Therefore, this book is suitable for a broad audience. This would include researchers working in either computer science or mathematics interested in this exciting new field, or as a secondary textbook for a course in MPKC suitable for beginning graduate students in mathematics or computer science. Information security experts in industry, computer scientists and mathematicians would also find this book valuable as a guide for understanding the basic mathematical structures necessary to implement multivariate cryptosystems for practical applications.PPN: PPN: 1734621818Package identifier: Produktsigel: ZDB-2-SCS | ZDB-2-SEB | ZDB-2-SXCS

Holdings ( 0 )

No physical items for this record