It is a simple application of the extended GCD algorithm. The modular square root of a modulo a prime p is a number x such that x^2 = a mod ...
確定! 回上一頁