9
$\begingroup$

I was going through these presentation slides (PDF) on Crypto 2013.

It summarizes the paper, Factoring RSA keys from certified smart cards: Coppersmith in the wild.

In the last slide, it was mentioned that one possible future work to be done is to use the “Adi Shamir's secret database of all primes” to attempt breaking RSA-1024. I tried to Google for “Adi Shamir's secret database of all primes”, but I can't find anything. Does anyone have any idea about this "database"?

$\endgroup$
4
  • 8
    $\begingroup$ That database is to cryptography venues what the Dahu is to French summer camps. Also see the answers to this. $\;$ The three other 'future work' items in the presentation are in the same vein. $\endgroup$
    – fgrieu
    Jul 7, 2014 at 6:25
  • 2
    $\begingroup$ @fgrieu I tried to come up with something more… “meaty”, but your comment practically answers the question on-point. So, maybe it would make sense to post it as an answer? I’ld surely upvote it. $\endgroup$
    – e-sushi
    Jul 7, 2014 at 17:40
  • 1
    $\begingroup$ It exists, but you can't select from it because the programmer forgot to put a with(nolock) on the insert sproc. $\endgroup$ Jul 8, 2014 at 17:58
  • $\begingroup$ Now the record is 340 million $\endgroup$
    – kelalaka
    Jan 17, 2020 at 21:19

1 Answer 1

8
$\begingroup$

Adi Shamir's secret database of all primes is to cryptography venues what the Dahu is to French summer camps. For why, see the answers to this related question.

The three other future work items in the quoted presentation are in the same vein (Breaking RSA-1024 with Fermat factoring; Breaking RSA-1024 using $1024 = 2*2*2*2*2*2*2*2*2*2$; Breaking RSA-1024 using Intel's new RDRAND_NSAKEY instruction).

Note: serious work and some further progress did occur after Cypto 2013; see these updated slides of Asiacrypt 2013, also linked from DJB's smartfacts page.

$\endgroup$
1
  • 1
    $\begingroup$ That is amazing, I can't remember how many snipe hunts I've done. $\endgroup$
    – mikeazo
    Oct 29, 2015 at 14:10

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.