Cryptology ePrint Archive: Report 2008/261

The Hidden Root Problem

F. Vercauteren

Abstract: In this paper we study a novel computational problem called the Hidden Root Problem, which appears naturally when considering fault attacks on pairing based cryptosystems. Furthermore, a variant of this problem is one of the main obstacles for efficient pairing inversion. We present an algorithm to solve this problem over extension fields and investigate for which parameters the algorithm becomes practical.

Category / Keywords: public-key cryptography /

Date: received 8 Jun 2008

Contact author: frederik vercauteren at esat kuleuven be

Available formats: Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20080610:130525 (All versions of this report)

Discussion forum: Show discussion | Start new discussion