Towards Algebraic Cryptanalysis of HFE Challenge 2

Mohamed Saied Emam Mohamed TU Darmstadt, FB Informatik Hochschulstrasse 10, 64289 Darmstadt, Germany Jintai Ding Department of Mathematical Sciences, University of Cincinnati, South China University of Technology Johannes Buchmann TU Darmstadt, FB Informatik Hochschulstrasse 10, 64289 Darmstadt, Germany

TBD mathscidoc:2207.43052

ISA 2011, 123–131, 2011.8
In this paper, we present an experimental analysis of HFE Challenge 2 (144 bit) type systems. We generate scaled versions of the full challenge fixing and guessing some unknowns. We use the MXL_3 algorithm, an efficient algorithm for computing Gröbner basis, to solve these scaled versions. We review the MXL_3 strategy and introduce our experimental results.
No keywords uploaded!
[ Download ] [ 2022-07-14 13:32:34 uploaded by dingjt ] [ 263 downloads ] [ 0 comments ]
@inproceedings{mohamed2011towards,
  title={Towards Algebraic Cryptanalysis of HFE Challenge 2},
  author={Mohamed Saied Emam Mohamed, Jintai Ding, and Johannes Buchmann},
  url={http://archive.ymsc.tsinghua.edu.cn/pacm_paperurl/20220714133234161683629},
  booktitle={ISA 2011},
  pages={123–131},
  year={2011},
}
Mohamed Saied Emam Mohamed, Jintai Ding, and Johannes Buchmann. Towards Algebraic Cryptanalysis of HFE Challenge 2. 2011. In ISA 2011. pp.123–131. http://archive.ymsc.tsinghua.edu.cn/pacm_paperurl/20220714133234161683629.
Please log in for comment!
 
 
Contact us: office-iccm@tsinghua.edu.cn | Copyright Reserved