issues
search
AdamWhiteHat
/
GNFS
A complete, proof-of-concept, C# implementation of the General Number Field Sieve algorithm for factoring very large semi-prime numbers. The focus was on readability and understandability of the code, not performance.
GNU General Public License v3.0
56
stars
13
forks
source link
issues
Newest
Newest
Most commented
Recently updated
Oldest
Least commented
Least recently updated
BUG: Application crashes with default values
#17
JSchimmelpfennig
opened
2 months ago
3
Inefficient square root
#16
GregoryMorse
opened
1 year ago
5
BUG: Misc Bugs & PR request offer
#15
alexhiggins732
opened
1 year ago
7
Bump Newtonsoft.Json from 13.0.1 to 13.0.2 in /GNFSCore
#14
dependabot[bot]
closed
1 year ago
1
#12 - Replace for loop in ModularMultiplicativeInverse with extended euclidean gcd.
#13
AdamWhiteHat
closed
2 years ago
0
Replace for loop in ModularMultiplicativeInverse
#12
an31146
closed
2 years ago
2
Question: I need just function Factorization(n) for get prime numbers. Is it possible?
#11
potaninmt
closed
2 years ago
1
Sorry for all the problems but now after i run the factor bases and roots, and go to find relations the program crashes
#10
stewcop
closed
4 years ago
2
how to make this program work
#9
stewcop
closed
4 years ago
2
it may be dumb but i dont know how to run
#8
stewcop
closed
4 years ago
1
What mean Smoothness Bound
#7
SlimRG
closed
4 years ago
2
Merge master into SievingStrategyContract brach
#6
AdamWhiteHat
closed
4 years ago
0
Biggest factor
#5
Manuel3115
closed
4 years ago
4
PR dev to master
#4
AdamWhiteHat
closed
5 years ago
0
Create LICENSE
#3
AdamWhiteHat
closed
5 years ago
0
dev to master
#2
AdamWhiteHat
closed
5 years ago
0
Request for example
#1
SethKitchen
closed
5 years ago
2