Towards algebraic cryptanalysis of HFE challenge 2

Mohamed Saied Emam Mohamed; Jintai Ding; Johannes Buchmann

Towards algebraic cryptanalysis of HFE challenge 2

Mohamed Saied Emam Mohamed, Jintai Ding, Johannes Buchmann

Research output: Contribution to journal › Review article › peer-review

Abstract

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 ₃ algorithm, an efficient algorithm for computing Gröbner basis, to solve these scaled versions. We review the MXL ₃ strategy and introduce our experimental results.

Original language	English
Pages (from-to)	67-76
Number of pages	10
Journal	International Journal of Multimedia and Ubiquitous Engineering
Volume	6
Issue number	4
Publication status	Published - 2011
Externally published	Yes

Cite this

@article{076e751ab10d47a98483f731cf270caa,

title = "Towards algebraic cryptanalysis of HFE challenge 2",

abstract = "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{\"o}bner basis, to solve these scaled versions. We review the MXL 3 strategy and introduce our experimental results.",

author = "Mohamed, {Mohamed Saied Emam} and Jintai Ding and Johannes Buchmann",

year = "2011",

language = "English",

volume = "6",

pages = "67--76",

journal = "International Journal of Multimedia and Ubiquitous Engineering",

issn = "1975-0080",

number = "4",

}

TY - JOUR

T1 - Towards algebraic cryptanalysis of HFE challenge 2

AU - Mohamed, Mohamed Saied Emam

AU - Ding, Jintai

AU - Buchmann, Johannes

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84856809128&partnerID=8YFLogxK

M3 - Review article

AN - SCOPUS:84856809128

SN - 1975-0080

VL - 6

SP - 67

EP - 76

JO - International Journal of Multimedia and Ubiquitous Engineering

JF - International Journal of Multimedia and Ubiquitous Engineering

IS - 4

ER -

Towards algebraic cryptanalysis of HFE challenge 2

Abstract

Other files and links

Fingerprint

Cite this