Multivariate Public Key Cryptosystems

Hashimoto, Yasuhiko

doi:10.1007/978-981-10-5065-7_2

Cited by 7 publications

(2 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Their complexities are then O(n 2 m) for most MPKCs under naive implementations. Furthermore, it is known (Hashimoto 2017) that the complexities of encrypting n plaintexts and of verifying n signatures simultaneously are O(n w m), where 2 ≤ w < 3 is a linear algebra constant. The complexities of decryption and signature generation depend mainly on how to invert G. We will discuss them in the individual schemes.…”

Section: Basic Constructions Of Multivariate Public Key Cryptosystemsmentioning

confidence: 99%

See 1 more Smart Citation

Recent Developments in Multivariate Public Key Cryptosystems

Hashimoto

2020

Mathematics for Industry

Self Cite

View full text Add to dashboard Cite

The multivariate signature schemes UOV, Rainbow, and HFEv- have been considered to be secure and efficient enough under suitable parameter selections. In fact, several second round candidates of NIST’s standardization project of Post-Quantum Cryptography are based on these schemes. On the other hand, there are few multivariate encryption schemes expected to be practical and despite that, various new schemes have been proposed recently. In the present paper, we summarize multivariate schemes UOV, Rainbow, and (variants of) HFE generating the second round candidates and study the practicalities of several multivariate encryption schemes proposed recently.

show abstract

Section: Basic Constructions Of Multivariate Public Key Cryptosystemsmentioning

confidence: 99%

“…The aim of this paper is to describe recent developments of multivariate public key cryptosystems, not yet presented in the previous paper (Hashimoto 2017). We first summarize in Sect.…”

Section: Introductionmentioning

confidence: 99%