# Small Public Keys and Fast Verification for $\mathcal{M}$ ultivariate $\mathcal{Q}$ uadratic Public Key Systems

@inproceedings{Petzoldt2011SmallPK,
title={Small Public Keys and Fast Verification for \$\mathcal\{M\}\$ ultivariate \$\mathcal\{Q\}\$ uadratic Public Key Systems},
author={Albrecht Petzoldt and Enrico Thomae and Stanislav Bulygin and Christopher Wolf},
booktitle={CHES},
year={2011}
}
Security of public key schemes in a post-quantum world is a challenging task—as both RSA and ECC will be broken then. In this paper, we show how post-quantum signature systems based on $$\mathcal{M}$$ultivariate $$\mathcal{Q}$$uadratic ($$\mathcal{MQ}$$) polynomials can be improved up by about 9/10, and 3/5, respectively, in terms of public key size and verification time. The exact figures are 88% and 59%. This is particularly important for small-scale devices with restricted energy, memory, or… CONTINUE READING

#### Citations

##### Publications citing this paper.
SHOWING 1-4 OF 4 CITATIONS

## Solving Underdetermined Systems of Multivariate Quadratic Equations Revisited

• Public Key Cryptography
• 2012
VIEW 10 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

• Sensors
• 2014
VIEW 1 EXCERPT
CITES METHODS

## A Generalization of the Rainbow Band Separation Attack and its Applications to Multivariate Schemes

• IACR Cryptology ePrint Archive
• 2012

## Quo Vadis Quaternion? Cryptanalysis of Rainbow over Non-Commutative Rings

• IACR Cryptology ePrint Archive
• 2012
VIEW 1 EXCERPT
CITES METHODS