Multivariate Public Key Cryptography

Jintai Ding () and Bo-Yin Yang ()
Additional contact information
Bo-Yin Yang: Academia Sinica and Taiwan InfoSecurity Center

A chapter in Post-Quantum Cryptography, 2009, pp 193-241 from Springer

Abstract: A multivariate public key cryptosystem (MPKCs for short) have a set of (usually) quadratic polynomials over a finite field as its public map. Its main security assumption is backed by the NP-hardness of the problem to solve nonlinear equations over a finite field. This family is considered as one of the major families of PKCs that could resist potentially even the powerful quantum computers of the future. There has been fast and intensive development in Multivariate Public Key Cryptography in the last two decades. Some constructions are not as secure as was claimed initially, but others are still viable. The paper gives an overview of multivariate public key cryptography and discusses the current status of the research in this area.

Keywords: Gröbner basis; multivariate public key cryptosystem; linear algebra; differential attack (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-540-88702-7_6

Ordering information: This item can be ordered from
http://www.springer.com/9783540887027

DOI: 10.1007/978-3-540-88702-7_6

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().