mersenneforum.org  

Go Back   mersenneforum.org > Search Forums

Showing results 1 to 5 of 5
Search took 0.01 seconds.
Search: Posts Made By: R1zZ1
Forum: Factoring 2007-03-02, 21:59
Replies: 36
Views: 4,158
Posted By R1zZ1
YES! Thank you for helping me and my group to do...

YES! Thank you for helping me and my group to do this very very interesting project! I've founded a lot of interesting threads on this forum that helped us to do a good implementation of quadratic...
Forum: Factoring 2007-02-27, 19:05
Replies: 36
Views: 4,158
Posted By R1zZ1
Thx a lot! Can you approximately indicate me...

Thx a lot!

Can you approximately indicate me how much i have to increase the cutoff to compensate avoiding of all primes smaller than 30?
Forum: Factoring 2007-02-27, 16:34
Replies: 36
Views: 4,158
Posted By R1zZ1
Using p=2 for sieving (Quadratic sieve algorithm)

Hi guys,

I'm trying to implement the Quadratic Sieve algorithm (MPQS) and I don't know how to use p=2 in sieving, because I noticed that without this prime in factor base I have not enough...
Forum: Factoring 2007-02-01, 23:20
Replies: 2
Views: 1,158
Posted By R1zZ1
I'll also appreciate if you indicate me a C++...

I'll also appreciate if you indicate me a C++ library with a function that solves equations system over Z_2.

Lidia has a function named solve() but i am not sure that it works with sparse matrix...
Forum: Factoring 2007-02-01, 22:56
Replies: 2
Views: 1,158
Posted By R1zZ1
Linear algebra in MPQS

Hi all, I'm an italian student and I need your support.

I'm implementing MPQS with GMP, the implemented sieving algorithm works fine and I obtain the sparse matrix representing the good relations...
Showing results 1 to 5 of 5

 
All times are UTC. The time now is 05:05.

Sat Oct 31 05:05:38 UTC 2020 up 51 days, 2:16, 2 users, load averages: 1.59, 1.75, 1.75

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.