Paper 2003/101

Cryptanalysis of HFE

Ilia Toli

Abstract

Out of the public key ($\mathcal{PK}$) we recover a polynomial of the same shape as the private polynomial. Then we give an algorithm for solving such a special-form polynomial. This fact puts an eavesdropper in the same position with a legitimate user in decryption. An upper bound for the complexity of that all is $\mathcal{O}(n^6)$ bit operations for $n$ the degree of the field extension.

Note: Minor changes expected.

Metadata
Available format(s)
-- withdrawn --
Category
Public-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Contact author(s)
toli @ posso dm unipi it
History
2003-05-27: withdrawn
2003-05-23: received
See all versions
Short URL
https://ia.cr/2003/101
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.