[QUOTE=R.D. Silverman;355252]I think you took too many quaaludes last night.[/QUOTE]

I'm curious, Bob. What are you referring to? The quantum computer part (yes, exceedingly unlikely in the next 3 years) or the govt. goons part (breaking RSA might be something they'd want to keep to themselves.) Please elaborate.

[QUOTE=PBMcL;355264]I'm curious, Bob. What are you referring to? The quantum computer part (yes, exceedingly unlikely in the next 3 years) or the govt. goons part (breaking RSA might be something they'd want to keep to themselves.) Please elaborate.[/QUOTE]

Both ideas are delusional. And you didn't discuss the gov't keeping an
RSA break secret. You did discuss their seizing a quantum computer.
(This assumes that it was developed in the public domain).

(1) If someone builds such a computer, the fact of its existence will not
be secret. It will be in the public domain. And the Bernstein vs. State
Dept. case makes it clear that the government can't suppress publishing.
The mere fact that such a computer exists will kill RSA all by itself.

(2) The government can not seize private property except as a result of
a criminal proceeding or under eminent domain. Neither applies.

[QUOTE=R.D. Silverman;355270](2) The government can not seize private property except as a result of a criminal proceeding or under eminent domain. Neither applies.[/QUOTE]

Are you [I][U]absolutely[/U][/I] sure on these claims?

(obliquely relevant to the few last posts)
 

In case anyone was watching - [URL="http://www.cbs.com/shows/elementary/video/EC872537-85AE-1FD4-C2EF-7A8CD60980F2/elementary-solve-for-x/"]yesterday's Elementary[/URL] made me chuckle a few times. It had to do with some mathematicians being randomly killed... Holmes got it! - "They were getting close to solving P vs NP problem." /gasp/ I will not give away the (rather obvious) conclusion.

It almost follows the scenario of the last few posts. (or not. See it. If anything, you will be amused.)

[QUOTE=R.D. Silverman;355270](2) The government can not seize private property except as a result of
a criminal proceeding or under eminent domain. Neither applies.[/QUOTE]

:missingteeth:

They've done more for less. I don't know what cover story would be used, I don't know what possibly-secret interpretation of law would cover for it, but I'm quite sure that this would be attempted in the unlikely chance that someone in the 'outside world' made [i]ex nihilo[/i] a cryptographically-useful quantum computer.

Okay, I have a "related" question insomuch as it pertains to the attempt to factor Fermat numbers: is using the -go command in PFGW the best way to test for divisibility after a Proth prime has been found? If not, what is? Thanks!

Also, does anyone know how far F12, F13, and F14 have been p-1 tested and/or have the .bu files for the deepest known test?

I noticed that PrimeNet gives ECM-F jobs with B1=8e8 for F12 (at least when asked using Manual testing). However, the statistics on [URL="http://mersenne.org/report_ECM/"]http://mersenne.org/report_ECM/[/URL] only have the curve count up to 26e7. Although I am not planning on devoting too much resources on this, I am curious to know how much ECM has been poured to F12 via PrimeNet. Is there a way to get the information (easily) from the server?

Try [url]http://mersenne.org/report_ECM/index_new.php[/url]

I'm not sure if the 360,000 curves required is correct.

[QUOTE=Prime95;365060]Try [url]http://mersenne.org/report_ECM/index_new.php[/url]

I'm not sure if the 360,000 curves required is correct.[/QUOTE]

Thank you!

I see there were way more curves at B1=8e8 than I had expected.

360,000 seems a bit high for B1=8e8, but then again the memory requirement for something like B1=2e9 might be too high for the current average computer running ECM on these. I noticed that running stage 2 on mprime with B1=85e7 uses 551MB of memory (when mprime is allowed to have 4GB). I did not yet try B1=2e9 nor running stage 2 on GMP-ECM.

[QUOTE=rajula;365062]I see there were way more curves at B1=8e8 than I had expected.[/QUOTE]

Remember, the ECM report is a bit odd. The 800M column includes the work done in the 260M column. That is, the 112,000 curves at 260M is roughly equivalent to 36,000 curves at 800M. When the 260M column is marked "Done", the 800M column starts counting from 36,000.