adding fudge factor to handle the case of g(X)=m1*X+m2. It works, since I finally factored rsa110:
adding fudge factor to handle the case of g(X)=m1*X+m2. It works, since I
finally factored rsa110:

# Dependency 003
# Reading ab pair #0 at 0.00
# Reading ab pair #100000 at 9.62
# Reading ab pair #200000 at 23.55
# Reading ab pair #300000 at 44.17
# Reading ab pair #400000 at 58.38
# Reading ab pair #500000 at 68.05
# Reading ab pair #600000 at 106.56
Finished accumulating the product in 141.14
nab = 619148, v = 619144
sizeinbit of cst term = 26914064
sizeinbit of leading term = 26914008
Using p=41 for lifting
lifting mod p^2 at 141.19
lifting mod p^4 at 141.22
lifting mod p^8 at 141.25
....
lifting mod p^2097152 at 791.52
lifting mod p^4194304 at 1822.09
Square root lifted in 2757.01
Algebraic square root is: 31730117166702553118632032959790084494779767973172684176295835061213473244726386887614274631430045283461920355
Rational square root is: 13927427318536041019886756187624478685597613653208969494187774466237525427419480890002447462305817703762145426
6122421090493547576937037317561418841225758554253106999
5846418214406154678836553182979162384198610505601062333
Stopping, since we have probably finished

For more details: #relations given by PZ was 7272158. With parameters
Args: Examples/rsa110/rsa110 1.0 120 300 500
merge gave:
=> nrows=190237 ncols=190109

and for Gauss:
done 189824 pivots in 103757s (est. 103913s)
done 189952 pivots in 103761s (est. 103847s)
done 190080 pivots in 103765s (est. 103781s)
dim of kernel is 128
printing 128 first vectors of kernel...



git-svn-id: 189946a10c5fc96e9dd03ba7cba917cd4c3d09f4@598 de4796e2-0b1e-0410-91b4-86bc23549317

mancoast/cado-nfs,mancoast/cado-nfs,mancoast/cado-nfs,mancoast/cado-nfs,mancoast/cado-nfs,mancoast/cado-nfs,mancoast/cado-nfs