Home | Quick Search | Advanced Search | Bibliography submission | Bibliography submission using bibtex | Bibliography submission using bibtex file | Links | Help | Internal


TitleKipnis-Shamir attack on HFE revisited.
Author(s) Jintai Ding, Lei Hu, Xin Jiang
TypeBook, Chapter in Book, Conference Proceeding
AbstractIn this paper, we show the claims in the original Kipnis-Shamir attack on the HFE cryptosystems and the improved attack by Courtois that the complexity of the attacks is polynomial in terms of the number of variables are invalid. We present computer experiments and a theoretical argument using basic algebraic geometry to explain why it is so. Furthermore we show that even with the help of the powerful new Gröbner basis algorithm like F 4, the Kipnis-Shamir attack still should be exponential but not polynomial. This again is supported by our theoretical argument.
KeywordsHFE, MinRank XL, algorithm
URL http://link.springer.com/chapter/10.1007%2F978-3-540-79499-8_31
PublisherBerlin: Springer
Translation No
Refereed No