Take the 2-minute tour ×
Cryptography Stack Exchange is a question and answer site for software developers, mathematicians and others interested in cryptography. It's 100% free, no registration required.

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"?

share|improve this question
6  
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. –  fgrieu Jul 7 at 6:25
4  
+1 for a good morning laugh. :D –  fkraiem Jul 7 at 8:00
2  
@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. –  e-sushi Jul 7 at 17:40
    
It exists, but you can't select from it because the programmer forgot to put a with(nolock) on the insert sproc. –  Andrew Hoffman Jul 8 at 17:58
add comment

1 Answer 1

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.

share|improve this answer
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

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