## CryptoDB

### Paper: The Hidden Root Problem

Authors: F. Vercauteren URL: http://eprint.iacr.org/2008/261 Search ePrint Search Google 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.
##### BibTeX
@misc{eprint-2008-17938,
title={The Hidden Root Problem},
booktitle={IACR Eprint archive},
keywords={public-key cryptography /},
url={http://eprint.iacr.org/2008/261},
note={ frederik.vercauteren@esat.kuleuven.be 14038 received 8 Jun 2008},
author={F. Vercauteren},
year=2008
}