NO DOC
#include <iostream>
#include <stdlib.h>
#include <givaro/givintsqrootmod.h>
#include <givaro/givtimer.h>
#include <givaro/givpoly1factor.h>
#include <givaro/modular-integer.h>
int main(
int argc,
char** argv)
{
{
std::cerr << "a: " << a << std::endl;
std::cerr << "n: " << n << std::endl;
std::cout << r << std::endl;
std::cerr << chrono << std::endl;
std::cerr << "Check, (" << r << ")^2 mod " << n << " = " << ( (r*r)%n) << std::endl;
}
std::cout << "Using polynomial factorization : " << std::endl;
typedef Polys::Element Polynomial;
Field F(n); Polys Pol(F,
"X");
F.
init(quad[0],a); F.
negin(quad[0]);
if (Pol.is_irreducible(quad)) {
std::cerr << a << " is not a quadratic residue mod " << n << std::endl;
std::cerr << chrono << std::endl;
return 0;
}
Pol.write(std::cout,
root) << std::endl;
std::cerr << chrono << std::endl;
std::cerr <<
"Check, (" <<
root[0] <<
")^2 mod " << n <<
" = " << ( (
root[0]*
root[0])%n) << std::endl;
}
return 0;
}