Cryptology ePrint Archive: Report 2017/1135

On the Complexity of the Hybrid Approach on HFEv-

Albrecht Petzoldt

Abstract: The HFEv- signature scheme is one of the most promising candidates for post-quantum digital signatures. Most notably here is the short signature size of the scheme. It has long been known that direct attacks against HFEv- systems work more efficiently than against random systems. The reason for this was found by Jintai Ding et al., who proved an upper bound on the degree of regularity of these systems. However, not much is known about the efficiency of the hybrid approach against the HFEv- scheme. In order to find suitable parameter sets for HFEv- for higher levels of security, this topic has to be studied in more detail. In this article we consider this question by performing a large number of computer experiments. As our experiments show, guessing variables does not help to speed up direct attacks against HFEv- systems. Therefore, in the parameter selection of these schemes, we do not have to consider the hybrid approach. Furthermore, we develop in this article a simple formula to estimate the degree of regularity of a determined HFEv- system. Together with our results on the behavior of the hybrid approach, this formula gives us an easy way to estimate the complexity of direct attacks against HFEv- systems.

Category / Keywords: public-key cryptography / Multivariate Cryptography, HFEv-, Direct Attack, Hybrid Approach

Date: received 23 Nov 2017

Contact author: albrecht petzoldt at googlemail com

Available format(s): PDF | BibTeX Citation

Version: 20171127:131651 (All versions of this report)

Short URL: ia.cr/2017/1135

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]