Paper 2011/263 Original: eprint.iacr.org/2011/263 ↗
The Computational Square-Root Exponent Problem- Revisited
Abstract
In this paper, we revisit the Computational Square-Root Exponent Problem (CSREP), and give a more generic condition such that CSREP is polynomial-time equivalent to the Computational Diffie-Hellman Problem (CDHP) in the group with prime order. The results obtained in this paper contain Zhang \textit{et al.}'s results at IWCC2011. We also analyze the existence of such condition. Although primes satisfying such condition are rare (compare to all primes), it can be regarded as an evidence that CSREP may be equivalent to CDHP.
Metadata
- Available format(s)
PDF- Publication info
- Preprint.
- History
- 2011-06-07: last updated
- 2011-05-28: published
- Short URL
- https://ia.cr/2011/263
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2011/263,
author = {Fangguo Zhang},
title = {The Computational Square-Root Exponent Problem- Revisited},
howpublished = {Cryptology {ePrint} Archive, Paper 2011/263},
year = {2011},
url = {https://eprint.iacr.org/2011/263}
}