![]() |
![]() |
#1 |
Mar 2016
39710 Posts |
![]()
A peaceful night for all persons,
if i have a biquadratic function for a complex vector such as f(v)=vMv mod f where v=a+bi with a,b element N and M a 2*2 Matrix with l,m,m,o element N and the resulting vector is calculated by modulo f for a and b, where f is element N and not prime, are there special points for a and b which are suitable for a factorisation ? I suppose M refer to an irrducible polynomial over N. For the special case M=E where E is the neutral Element f(a,b)=a²-b² if = 0 then a factorisation is certainly possible Are there other possibilities ? Greetings from the complex lattice ![]() ![]() ![]() Bernhard |
![]() |
![]() |
![]() |
#2 |
Mar 2016
6158 Posts |
![]()
A peaceful evening for all persons,
![]() ![]() ![]() i implemented some algorithms with a combination of bilinear forms and a pollard rho algorithm. 40 digit numbers are possible to factorize for me, but not more. I checked parallel 8 curves and looked up for some results. If i use a small cluster with 30 cores, is there a real chance to increase the probability for factoring higher numbers ? Greetings from the factoring algorithms, which can be really nice ![]() ![]() Bernhard |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
factorisation | devarajkandadai | Factoring | 7 | 2013-07-06 03:44 |
Records for complete factorisation | Brian-E | Math | 25 | 2009-12-16 21:40 |
Being coy about a factorisation | fivemack | Math | 7 | 2007-11-17 01:27 |
Kraitchik's factorisation method | Robertcop | Math | 2 | 2006-02-06 21:03 |
Complex number problem | dave_0273 | Math | 3 | 2004-11-08 17:15 |