10,375- LA discussion

[Raman]

Originally Posted by fivemack

Congratulations on finishing this difficult job despite adversity.

Do you mean the temporary operating system failure or the harsh
words from Dr. Silverman?

Originally Posted by R.D. Silverman

I assume that you weren't the victim of many months of daily mail bombs
from Raman; hundreds of junk mails per day containing total gibberish.....

Have you read his prior efforts on this forum??????

Peut être vous voudriez parler en français?

Oubliez svp le passé. Chacun qui est nouveau au forum le trouvent difficile à obtenir arrangé au commencement. Quand j'étais nouveau à ce forum, je ne pouvais pas tolérer les réponses agressives de d'autres.

Je n'ai pas été disposé à travailler pour me, et ai été prévu d'autres pour donner la réponse exacte que je me suis attendue, qu'est administrer l'alimentation à la cuillère par des choses de remise directement à moi.

Veuillez ne pas continuer votre comportement grossier vers moi plus longtemps. Mentalement - les personnes perturbées et mentalement faibles ont besoin de plus de courtoisie de la communauté. Veuillez ne pas venir autour je si vous ne pouvez pas changer votre comportement pour maintenant.

[henryzz]

Originally Posted by Batalov

Henry, it is SNFS complexity 200.00, so GNFS is out of question here.

sorry i stated my question badly again
what i meant is:
what size gnfs would be of equal difficulty to that factorization

[Batalov]

Well, for the complexity of quartic we can add at least 20 to the 200.0 and then multiply by 0.7 => about gnfs-154, but this is just a ballpark.

[henryzz]

Originally Posted by Batalov

Well, for the complexity of quartic we can add at least 20 to the 200.0 and then multiply by 0.7 => about gnfs-154, but this is just a ballpark.

ok thanks
so with a quad and a duo he did a calculation roughly equal to breaking a 512-bit RSA key
they arent that hard anymore!!

[jasonp]

Originally Posted by henryzz

so with a quad and a duo he did a calculation roughly equal to breaking a 512-bit RSA key they arent that hard anymore!!

A GGNFS user factored a (self-generated) 512-bit key with the standard perl script and the standard postprocessing tools around 3 years ago. IIRC he needed a few months on 12 old P3 machines and 12 days on a K8 system for the matrix. So big jobs like these have not been that hard for quite a while; maybe the big difference is that now there's widespread willingness to learn how the tools work, because now everybody can see these jobs completing.

[xilman]

Originally Posted by Raman

Do you mean the temporary operating system failure or the harsh
words from Dr. Silverman?

I'm sure he meant the former as did I.

Originally Posted by Raman

Oubliez svp le passé.

D'accord.

Paul