The Hidden Root Problem

F.  Vercauteren

Paper 2008/261 Original: eprint.iacr.org/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
Category: Public-key cryptography
Publication info: Preprint.
History: 2008-06-10: last updated; 2008-06-10: published
Short URL: https://ia.cr/2008/261
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2008/261,
      author = {F.  Vercauteren},
      title = {The Hidden Root Problem},
      howpublished = {Cryptology {ePrint} Archive, Paper 2008/261},
      year = {2008},
      url = {https://eprint.iacr.org/2008/261}
}