Similar Keys of Multivariate Quadratic Public Key Cryptosystems

Hu, Yuh-Hua; Wang, Lih-Chung; Chou, Cheng‐Ying; Lai, Feipei

doi:10.1007/11599371_18

Cited by 8 publications

(1 citation statement)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…F 16 instead of F 256 ), [4]. In addition, we want to mention the so-called similar keys which exploit linear relations between public and private key [9]. However, they are not applicable to schemes like UOV.…”

Section: Introductionmentioning

confidence: 99%

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

Petzoldt

Thomae

Bulygin

et al. 2011

Cryptographic Hardware and Embedded Systems – CHES 2011

View full text Add to dashboard Cite

Abstract. 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 Multivariate Quadratic (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 smallscale devices with restricted energy, memory, or computational power. In addition, we provide evidence that this reduction does not affect security and that it is also optimal in terms of possible attacks. We do so by combining the previously unrelated concepts of reduced and equivalent keys. Our new scheme is based on the so-called Unbalanced Oil and Vinegar class of MQ-schemes. We have derived our results mathematically and verified the speed-ups through a C++ implementation.

show abstract

Section: Introductionmentioning

confidence: 99%