Level II Challenges (43)
Page 1 of the challenges in Level II, ordered by date posted (the most recent appear first).
|
|
|
|
|
|
In the fifth part the same variant of the cipher already introduced in Part 3 and 4 of this challenge has been used here, too. The only difference is that spaces were removed previously to the encryption process. Read more...
Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
|
|
Author:
This e-mail address is being protected from spambots. You need JavaScript enabled to view it
|
|
Published on: 2012-03-09 21:49 |
|
Maximum number of attempts for this challenge: 15 |
|
|
|
All successful users of this challenge
| Rank |
User (#6) |
Achieved points (Global score) |
y-m-d - h:m:s |
|
|
|
The Killer (Killer) |
2000 (31504) |
2012-03-10 18:17:46 |
|
|
J. M. (jomandi) |
2000 (74074) |
2012-03-10 18:57:08 |
|
|
Armin Krauss (argh) |
2000 (75549) |
2012-03-10 21:16:55 |
|
|
Seth Kintigh (DarkFibre) |
1493 (57644) |
2012-03-11 00:47:49 |
|
#5 |
Peter Mustermann (Gummiboot) |
1136 (28905) |
2012-03-16 20:59:40 |
|
#6 |
Bart den Hartog (Bart13) |
1053 (34701) |
2012-03-30 11:45:54 |
|
|
|
|
|
You must be logged in to solve the challenge |
|
|
|
|
|
|
With RSA keys, the private key d must remain private. If the public key e is very small, this is not completely possible. This exercise demonstrates how simple it is to compute a portion of the secret key d. Read more...
Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
|
|
Author:
This e-mail address is being protected from spambots. You need JavaScript enabled to view it
|
|
Published on: 2012-02-11 13:20 |
|
Maximum number of attempts for this challenge: 15 |
|
|
|
All successful users of this challenge
| Rank |
User (#18) |
Achieved points (Global score) |
y-m-d - h:m:s |
|
|
|
Bart den Hartog (Bart13) |
2000 (34701) |
2012-02-11 13:23:49 |
|
|
Viktor (Veselovský) |
2000 (56663) |
2012-02-11 13:32:57 |
|
|
J. M. (jomandi) |
2000 (74074) |
2012-02-11 13:58:47 |
|
|
Nathan (Witten) |
2000 (18537) |
2012-02-11 14:53:02 |
|
#5 |
The Killer (Killer) |
2000 (31504) |
2012-02-11 15:19:01 |
|
#6 |
Armin Krauss (argh) |
2000 (75549) |
2012-02-11 16:11:07 |
|
#7 |
Michel Van Caneghem (vancan) |
2000 (25399) |
2012-02-11 17:53:01 |
|
#8 |
Seth Kintigh (DarkFibre) |
2000 (57644) |
2012-02-11 20:11:15 |
|
#9 |
Peter Mustermann (Gummiboot) |
1493 (28905) |
2012-02-12 14:49:20 |
|
#10 |
Jean-Baptiste Mossé (intersect) |
1163 (1263) |
2012-02-16 13:24:30 |
|
#11 |
Martin Härterich (HaeM) |
1053 (8787) |
2012-02-28 16:17:44 |
|
#12 |
Thomas Gonda (TomG) |
1042 (22869) |
2012-03-05 15:41:48 |
|
#13 |
Luigi Tomelli (archstanton) |
1042 (19183) |
2012-03-05 16:10:07 |
|
#14 |
Keith Randall (randall77) |
1042 (25331) |
2012-03-06 01:42:39 |
|
#15 |
Kurt Gebauer (Yokozuna) |
1020 (21884) |
2012-04-05 13:18:28 |
|
#16 |
Hans Peter (hanspeter) |
1020 (19304) |
2012-04-05 22:03:17 |
|
#17 |
Aliazer (Aliazer) |
1010 (10555) |
2012-04-20 21:27:38 |
|
#18 |
Thomas Lambert (lambert) |
1010 (18539) |
2012-04-21 18:04:08 |
|
|
|
|
|
You must be logged in to solve the challenge |
|
|
|
|
|
|
This challenge descends from the RSA Laboratories contest to encourage research into the practical difficulty of factoring large integers of different length (between 330 and 2048 bit) and cracking RSA keys used in cryptography. This challenge is about factoring a number with 230 decimal digits. Read more...
Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
|
|
Author:
This e-mail address is being protected from spambots. You need JavaScript enabled to view it
|
|
Published on: 2012-02-07 10:43 |
|
Maximum number of attempts for this challenge: 15 |
|
|
|
All successful users of this challenge
| No one solved the challenge right now. Be the first! |
|
|
|
|
|
You must be logged in to solve the challenge |
|
|
|
|
|
|
This challenge descends from the RSA Laboratories contest to encourage research into the practical difficulty of factoring large integers of different length (between 330 and 2048 bit) and cracking RSA keys used in cryptography. This challenge is about factoring a number with 220 decimal digits. Read more...
Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
|
|
Author:
This e-mail address is being protected from spambots. You need JavaScript enabled to view it
|
|
Published on: 2012-02-07 10:42 |
|
Maximum number of attempts for this challenge: 15 |
|
|
|
All successful users of this challenge
| No one solved the challenge right now. Be the first! |
|
|
|
|
|
You must be logged in to solve the challenge |
|
|
|
|
|
|
This challenge descends from the RSA Laboratories contest to encourage research into the practical difficulty of factoring large integers of different length (between 330 and 2048 bit) and cracking RSA keys used in cryptography. This challenge is about factoring a number with 212 decimal digits. Read more...
Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
|
|
Author:
This e-mail address is being protected from spambots. You need JavaScript enabled to view it
|
|
Published on: 2012-02-07 10:30 |
|
Maximum number of attempts for this challenge: 15 |
|
|
|
All successful users of this challenge
| No one solved the challenge right now. Be the first! |
|
|
|
|
|
You must be logged in to solve the challenge |
|
