Revision history [back]

Number Field Sieve algorithm for Integer factorization and Discrete log problem

I want to use Number Field Sieve algorithm for Integer factorization. My numbers are of the form $2^n-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?

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.

Powered by Askbot version 0.7.59