earticle

논문검색

Towards Algebraic Cryptanalysis of HFE Challenge 2

원문정보

Mohamed Saied Emam Mohamed, Jintai Ding, Johannes Buchmann

보안공학연구지원센터(IJMUE) International Journal of Multimedia and Ubiquitous Engineering Vol.6 No.4 2011.10 pp.67-76
피인용수 : 0건 (자료제공 : 네이버학술정보)

초록

영어

In this paper, we present an experimental analysis of HFE Challenge 2 (144 bit) type systems. We generate scaled versions of the full challenge xing and guessing some unknowns. We use the MXL3 algorithm, an ecient algorithm for computing Grobner basis, to solve these scaled versions. We review the MXL3 strategy and introduce our experimental results.

목차

Abstract.
 1 Introduction
  1.1 Notation
 2 HFE Cryptosystem
 3 MXL3 Algorithm
 4 Attack Description
 5 Experimental results
 References

저자정보

  • 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

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.