I want to use Number Field Sieve algorithm for Integer factorization. My numbers are of the form 2n−1.
Also I want to use Number Field Sieve algorithm for discrete log finding in GF(p), for prime p. Are these available in Sagemath?
![]() | 1 | initial version | |
I want to use Number Field Sieve algorithm for Integer factorization. My numbers are of the form 2n−1.
Also I want to use Number Field Sieve algorithm for discrete log finding in GF(p), for prime p. Are these available in Sagemath?