ch.epfl.dedis.lib.crypto

Class TonelliShanks

java.lang.Object

ch.epfl.dedis.lib.crypto.TonelliShanks

public class TonelliShanks
extends Object

Constructor Summary

Constructors

Constructor and Description
TonelliShanks()

Method Summary

Modifier and Type	Method and Description
static BigInteger	modSqrt(BigInteger n, BigInteger p) Computes the square root of n mod p if it exists, otherwise null is returned.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

TonelliShanks

public TonelliShanks()

Method Detail

modSqrt

public static BigInteger modSqrt(BigInteger n,
                                 BigInteger p)

Computes the square root of n mod p if it exists, otherwise null is returned. In other words, find x such that x^2 = n mod p, where p must be an odd prime. The implementation is adapted from https://rosettacode.org/wiki/Tonelli-Shanks_algorithm#Java