Open AccessThe Hidden Root Problem
Lecture Notes In Computer SciencePeer ReviewedFréderik Vercauteren2008Book series
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 ecient pairing inversion. We present an algorithm to solve this problem over extension elds and investigate for which parameters the algorithm becomes practical. 1
The content you want is available to Zendy users.
Already have an account? Sign inHaving issues? Contact support