作者: Luk Bettale , Jean-Charles Faugère , Ludovic Perret
DOI: 10.1007/978-3-642-01440-6_11
关键词:
摘要: In this paper, we investigate the security of a hash function based on evaluation multivariate polynomials [17]. The such is related to difficulty solving (under-defined) systems algebraic equations. To solve these systems, have used general hybrid approach [8] mixing exhaustive search and Grobner bases solving. This shows that can be in several contexts. For sparse construction, refined strategy. From practical point view, been able break challenges proposed by Ding Yang [17] real time.