Abstract
AbstractThe 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.
Reference60 articles.
1. M.L. Akkar, N. Courtois, L. Goubin, R. Duteuil, A fast and secure implementation of Sflash, in PKC’03. LNCS, vol. 2567 (2003), pp. 267–278
2. M. Bardet, J.C. Faugère, B. Salvy, B.Y. Yang, Asymptotic expansion of the degree of regularity for semi-regular systems of equations, in MEGA’05 (2005)
3. E.R. Berlekamp, Factoring polynomials over finite fields. Bell Syst. Tech. J. 46, 1853–1859 (1967)
4. E.R. Berlekamp, Factoring polynomials over large finite fields. Math. Comput. 24, 713–735 (1970)
5. L. Bettale, J.C. Faugère, L. Perret, Solving polynomial systems over finite fields: improved analysis of the hybrid approach. ISSAC 2012, 67–74 (2012)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. QKD Protocol for Securing the Communication With Real-Life Application Scenarios;Advances in Systems Analysis, Software Engineering, and High Performance Computing;2024-07-26