1.1k citations · 1.9k across the 43 of their papers we have counts for
Showing 2015 · cs.CRShow all
2 papers · 2 filters
cs.CR2015
Algorithm for Solving Massively Underdefined Systems of Multivariate Quadratic Equations over Finite Fields
Heliang Huang, Wansu Bao
Solving systems of m multivariate quadratic equations in n variables (MQ-problem) over finite fields is NP-hard. The security of many cryptographic systems is based on this problem…
cs.CR2015
Middle-Solving Grobner bases algorithm for cryptanalysis over finite fields
Wansu Bao, Heliang Huang
Algebraic cryptanalysis usually requires to recover the secret key by solving polynomial equations. Grobner bases algorithm is a well-known method to solve this problem. However, a…