You are looking at a specific version 20080610:130525 of this paper.
See the latest version.
Paper 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.
Metadata
- Available format(s)
-
PDF
PS
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. Unknown where it was published
- Contact author(s)
- frederik vercauteren @ esat kuleuven be
- History
- 2008-06-10: received
- Short URL
- https://ia.cr/2008/261
- License
-
CC BY
