PARI's commands

[CRGreathouse]

Originally Posted by 3.14159

I don't need your meaningless sarcasm..

You'll get that about the same time you stop making ridiculous comments.

[3.14159]

Originally Posted by CRGreathouse

You'll get that about the same time you stop making ridiculous comments.

How was it ridiculous? Oh, wait, you're obviously infallible.

If you have nothing to add but smart-assed comments, just take a hike. Go kick some rocks. Get lost.

-------------------------------------------------------------

And, the split I was waiting for;

starting SIQS on c95: 46841064479706362242009239768661696640259680130429637064776609553939726832118289550545198006023

==== sieving in progress ( 4 threads):   84528 relations needed ====
====            Press ctrl-c to abort and save state            ====
85338 rels found: 21435 full + 63903 from 1174005 partial, (473.94 rels/sec)

SIQS elapsed time = 2587.6930 seconds.


***factors found***

PRP48 = 987044774093075878551222112255952559665853921239
PRP47 = 47455865943614596177273605697112936809372568657

(The timing isn't too accurate; The total time should have been somewhere around 55-65 minutes.)

[3.14159]

Okay; Now I see the problem with the crashing; I'm supposed to use 64-bit YAFU for large factoring jobs.

P.S: My factors! They're there!

starting SIQS on c102: 598913786496676879646847684910753405454458067319718781528903247886083067885539845621954730905822163869

==== sieving in progress ( 4 threads):  123064 relations needed ====
====            Press ctrl-c to abort and save state            ====


SIQS elapsed time = 136.5740 seconds.


***factors found***

PRP51 = 948235779757086528363084445862876675364034142714669
PRP51 = 631608508434582689071389212392863397901302351306801

.. Setting me a new record.

[kar_bon]

A C102 factored with yafu in SIQS-mode in 136 seconds?

[3.14159]

Originally Posted by kar_bon

A C102 factored with yafu in SIQS-mode in 136 seconds?

Nono, the relations were collected separately. A more accurate timeframe would be five hours, + 136 seconds for the post-processing. (Took up about 1.4 GB of RAM) I forgot to include that. You should have been able to see that, as it did not print the amount of relations it collected.

Though, a 102-digit number in two minutes; I think that would enable me to break an RSA key. (Or maybe not.)

[CRGreathouse]

Originally Posted by 3.14159

How was it ridiculous?

Expecting a tool designed to do A to instead do B?

Originally Posted by 3.14159

If you have nothing to add but smart-assed comments, just take a hike. Go kick some rocks. Get lost.

Good luck with that.

Originally Posted by 3.14159

Though, a 102-digit number in two minutes; I think that would enable me to break an RSA key. (Or maybe not.)

The current 'insecure; do not use' RSA key length is 1024 bits = 308 digits, about 17 million times harder.

[3.14159]

Originally Posted by CRGreathouse

Expecting a tool designed to do A to instead do B?

You misunderstood what I meant.

The current 'insecure; do not use' RSA key length is 1024 bits = 308 digits, about 17 million times harder.

They might be viable for a couple of decades, IMO.

[CRGreathouse]

Originally Posted by 3.14159

You misunderstood what I meant.

Please, enlighten us.

Originally Posted by 3.14159

They might be viable for a couple of decades, IMO.

You would trust a 1024-bit RSA key?

[3.14159]

Originally Posted by CRGreathouse

Please, enlighten us.




You would trust a 1024-bit RSA key?

The former: A power check would be necessary, in order to avoid wasted time.

The latter: Please show me a link which shows the factors of RSA1024.

[kar_bon]

Originally Posted by 3.14159

The former: A power check would be necessary, in order to avoid wasted time.

No. It's your turn to check of powers first. ECM is designed to test in another way.

[3.14159]

Originally Posted by kar_bon

No. It's your turn to check of powers first. ECM is designed to test in another way.

Wait.. Isn't it supposed to be unable to factor p^n, where p is prime?

(Ex: 5808458716416796798459^5)

I'm going to work on sigma(71608085354600097239391307^4).