![]() |
|
|
#199 | |
|
May 2010
Prime hunting commission.
24·3·5·7 Posts |
Quote:
Also: I do know an applet that provides a cheap simulation of RSA key generation, also provides a cheap simulation of encryption. Here it is. Applet for prime-generating: Here it is. (It says it's crypto practice using applets.) Last fiddled with by 3.14159 on 2010-07-23 at 14:13 |
|
|
|
|
|
|
#200 |
|
Aug 2006
3×1,993 Posts |
25 would be sufficient if an enemy handed you the supposed prime, at that error tolerance. 7 would be sufficient for a random 512-bit primes* according to Damgård-Landrock-Pomerance.
* 512-bit primes generating a 1024-bit key are the minimum required for modern security. For a 2048-bit key with 1024-bit primes, 3 or 4 tests would suffice. Last fiddled with by CRGreathouse on 2010-07-23 at 14:14 |
|
|
|
|
|
#201 | |
|
May 2010
Prime hunting commission.
24×3×5×7 Posts |
Quote:
![]() An example encryption: 12567 --> 211295745591 --> 2241528539259169170987271045307742926880092206585363020076052605925009129640969172636961058727725654469153396. Last fiddled with by 3.14159 on 2010-07-23 at 14:20 |
|
|
|
|
|
|
#202 |
|
Undefined
"The unspeakable one"
Jun 2006
My evil lair
22×32×173 Posts |
What are you basing your guess on?
Like I mentioned it depends upon the number size. I used a table. It starts at 160bits since I was not interested in smaller numbers. Code:
k(bits) : MR tests 160 : 34 161-163 : 33 164-166 : 32 167-169 : 31 170-173 : 30 174-177 : 29 178-181 : 28 182-185 : 27 186-190 : 26 191-195 : 25 196-201 : 24 202-208 : 23 209-215 : 22 216-222 : 21 223-231 : 20 232-241 : 19 242-252 : 18 253-264 : 17 265-278 : 16 279-294 : 15 295-313 : 14 314-334 : 13 335-360 : 12 361-392 : 11 393-430 : 10 431-479 : 9 480-542 : 8 543-626 : 7 627-746 : 6 747-926 : 5 927-1232 : 4 1233-1853 : 3 1854-oo : 2 Last fiddled with by retina on 2010-07-23 at 14:24 |
|
|
|
|
|
#203 | |
|
May 2010
Prime hunting commission.
24×3×5×7 Posts |
Quote:
Last fiddled with by 3.14159 on 2010-07-23 at 14:28 |
|
|
|
|
|
|
#204 |
|
Undefined
"The unspeakable one"
Jun 2006
My evil lair
22·32·173 Posts |
You are confusing ECC and symmetric crypto with RSA.
Last fiddled with by retina on 2010-07-23 at 14:39 |
|
|
|
|
|
#205 |
|
May 2010
Prime hunting commission.
24×3×5×7 Posts |
Also: A simple encryption: Try finding the cipher:
Hello -->19925626416901921153862395493065804612143354989442736293065804612143354989442736293642482459687520062956914986149. |
|
|
|
|
|
#206 |
|
Undefined
"The unspeakable one"
Jun 2006
My evil lair
22·32·173 Posts |
Have you ever estimated the effort increase required for 1024 bits compared to 768 bits? Without some major advance in factoring theory I doubt that "soon" will be soon at all.
|
|
|
|
|
|
#207 |
|
Aug 2006
3×1,993 Posts |
Yes -- although I happened to remove that phrase in my edit to the post (because of the uncertainty in key size).
You never seem to tire of that owl. Incidentally, I took the key sizes from the 2003 RSA schedule of recommendations, which has 1024-bit RSA expiring at the end of this year. (It's slightly complicated, look it up if you care.) 2048-bit is recommended until 2030. |
|
|
|
|
|
#208 | |
|
May 2010
Prime hunting commission.
69016 Posts |
Quote:
Last fiddled with by 3.14159 on 2010-07-23 at 15:08 |
|
|
|
|
|
|
#209 |
|
Aug 2006
135338 Posts |
I guess it all depends on how long the data needs to stay secure and who you need to protect against. 768-bit keys could still be used, in a pinch, for data that goes stale fast. But if you need the data to be secure for years and think that the NSA wants it... 1024 is clearly inadequate.
|
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Wheel Factorization | a1call | Factoring | 11 | 2017-06-19 14:04 |
| Efficient Test | paulunderwood | Computer Science & Computational Number Theory | 5 | 2017-06-09 14:02 |
| LL tests more credit-efficient than P-1? | ixfd64 | Software | 3 | 2011-02-20 16:24 |
| A Wheel | storm5510 | Puzzles | 7 | 2010-06-25 10:29 |
| Most efficient way to LL | hj47 | Software | 11 | 2009-01-29 00:45 |