Number Field Sieve algorithm for Integer factorization and Discrete log problem

factoring

asked 2023-02-05 18:57:48 +0200

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?

edit retag flag offensive close merge delete

add a comment

1 Answer

Sort by » oldest newest most voted

answered 2023-02-05 19:32:11 +0200

Max Alekseyev

5701 ●5 ●36 ●122

updated 2023-02-05 19:34:58 +0200

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.

edit flag offensive delete 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: 2023-02-05 18:57:48 +0200

Seen: 3,278 times

Last updated: Feb 05 '23

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

1 Answer