Towards algebraic cryptanalysis of HFE challenge 2

Mohamed Saied Emam Mohamed; Jintai Ding; Johannes Buchmann

doi:10.1007/978-3-642-23141-4_12

Towards algebraic cryptanalysis of HFE challenge 2

Mohamed Saied Emam Mohamed^*, Jintai Ding, Johannes Buchmann

^*Corresponding author for this work

Research output: Chapter in Book or Report/Conference proceeding › Conference Proceeding › peer-review

4 Citations (Scopus)

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
Title of host publication	Information Security and Assurance - International Conference, ISA 2011, Proceedings
Pages	123-131
Number of pages	9
DOIs	https://doi.org/10.1007/978-3-642-23141-4_12
Publication status	Published - 2011
Externally published	Yes
Event	2011 International Conference on Information Security and Assurance, ISA 2011 - Brno, Czech Republic Duration: 15 Aug 2011 → 17 Aug 2011

Publication series

Name	Communications in Computer and Information Science
Volume	200 CCIS
ISSN (Print)	1865-0929

Conference

Conference	2011 International Conference on Information Security and Assurance, ISA 2011
Country/Territory	Czech Republic
City	Brno
Period	15/08/11 → 17/08/11

Access to Document

10.1007/978-3-642-23141-4_12

Cite this

Mohamed, M. S. E., Ding, J., & Buchmann, J. (2011). Towards algebraic cryptanalysis of HFE challenge 2. In Information Security and Assurance - International Conference, ISA 2011, Proceedings (pp. 123-131). (Communications in Computer and Information Science; Vol. 200 CCIS). https://doi.org/10.1007/978-3-642-23141-4_12

@inproceedings{694cd77156f44dfbb42c75fb0b350904,

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 MXL3 algorithm, an efficient algorithm for computing Gr{\"o}bner basis, to solve these scaled versions. We review the MXL3 strategy and introduce our experimental results.",

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

year = "2011",

doi = "10.1007/978-3-642-23141-4_12",

language = "English",

isbn = "9783642231407",

series = "Communications in Computer and Information Science",

pages = "123--131",

booktitle = "Information Security and Assurance - International Conference, ISA 2011, Proceedings",

note = "2011 International Conference on Information Security and Assurance, ISA 2011 ; Conference date: 15-08-2011 Through 17-08-2011",

}

Mohamed, MSE, Ding, J & Buchmann, J 2011, Towards algebraic cryptanalysis of HFE challenge 2. in Information Security and Assurance - International Conference, ISA 2011, Proceedings. Communications in Computer and Information Science, vol. 200 CCIS, pp. 123-131, 2011 International Conference on Information Security and Assurance, ISA 2011, Brno, Czech Republic, 15/08/11. https://doi.org/10.1007/978-3-642-23141-4_12

Towards algebraic cryptanalysis of HFE challenge 2. / Mohamed, Mohamed Saied Emam; Ding, Jintai; Buchmann, Johannes.
Information Security and Assurance - International Conference, ISA 2011, Proceedings. 2011. p. 123-131 (Communications in Computer and Information Science; Vol. 200 CCIS).

Research output: Chapter in Book or Report/Conference proceeding › Conference Proceeding › peer-review

TY - GEN

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

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

U2 - 10.1007/978-3-642-23141-4_12

DO - 10.1007/978-3-642-23141-4_12

M3 - Conference Proceeding

AN - SCOPUS:80052320348

SN - 9783642231407

T3 - Communications in Computer and Information Science

SP - 123

EP - 131

BT - Information Security and Assurance - International Conference, ISA 2011, Proceedings

T2 - 2011 International Conference on Information Security and Assurance, ISA 2011

Y2 - 15 August 2011 through 17 August 2011

ER -

Towards algebraic cryptanalysis of HFE challenge 2

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this