A simple and fast probabilistic algorithm for computing square roots modulo a prime number

Authors:
R C Peralta
Affiliations:
-
Venue:
IEEE Transactions on Information Theory
Year:
1986

Citing 0
Cited 8

Zero-knowledge simulation of Boolean circuits

Proceedings on Advances in cryptology---CRYPTO '86
The Diffie–Hellman Protocol

Designs, Codes and Cryptography - Special issue on towards a quarter-century of public key cryptography
Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Algorithms

CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
On the complexity of the discrete logarithm and Diffie-Hellman problems

Journal of Complexity - Special issue on coding and cryptography
Improvement of authenaticated multiple-key agreement protocol

ACM SIGOPS Operating Systems Review
Anonymous Fair Transaction Protocols Based on Electronic Cash

International Journal of Electronic Commerce
Encryption schemes

Algorithms and theory of computation handbook
On relationship of computational Diffie-Hellman problem and computational square-root exponent problem

IWCC'11 Proceedings of the Third international conference on Coding and cryptology

Quantified Score

Hi-index	754.84

Visualization

Abstract

A probabilistic polynomial-time algorithm for computing the square root of a numberx in {bf Z}/P{bf Z}, whereP = 2^{S}Q + 1(Qodd,s > 0)is a prime number, is described. In contrast to the Adleman, Manders, and Miller algorithm, this algorithm gets faster as s grows. As with the Berlekamp-Rabin algorithm, the expected running time of the algorithm is independent ofx. However, the algorithm presented here is considerably faster for values ofsgreater than2.