Number Field Sieve algorithm for Integer factorization and Discrete log problem

Processing math: 100%

factoring

Anonymous

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?

add a comment

1 Answer

Sort by » oldest newest most voted

answered 2 years ago

Max Alekseyev

6932 ●9 ●52 ●162

updated 2 years ago

Unless you are into setting new records in factoring Cunningham numbers, I recommend to use http://factordb.com which report all known factors for such numbers effortlessly. There is a module factordb-python to access those factors from Python/Sage.

link

add a comment

Your Answer

Please start posting anonymously - your entry will be published after you log in or create a new account.

Add Answer

Question Tools

1 follower

Stats

Asked: 2 years ago

Seen: 3,683 times

Last updated: Feb 05 '23

Number Field Sieve algorithm for Integer factorization and Discrete log problem savecancel

1 Answer