Cipher challenges on four levels
 |
Level I challenges are similar to crossword puzzles from newspapers and can be solved with little cryptographic background. You don't need a computer for solving level I challenges -- all you need is a bit of clever thinking and probably a pen and paper. A tool like CrypTool can help reveal the answer to a level I challenge within minutes or even seconds, if the necessary algorithms are already built in. Hence, if you are new to cryptography, but nonetheless interested in the mysterious topic of cryptanalysis, give the level I challenges a try. You will almost assuredly meet quickly with success. |
|
 |
Level II challenges require some background knowledge in cryptology and usually some computational power. Additionally, you may require tools that are not available in a convenient package like CrypTool, OpenSSL or SAGE. Therefore, you must first thoroughly understand the problem and then you may need to write a computer program, which helps you. It could take hours or even days to solve a level II challenge. Hence, if you consider yourself well-armed with cryptologic knowledge (such as if you are a university student in a cryptographic course), give the level II challenges a try. Success may not come easily, but it will be a worthwhile endeavor. |
|
 |
Level III challenges require a thorough background in cryptanalysis and usually significant computational power as well. The problems in this level represent current research topics that are believed to be very difficult to solve. Thus, practical solutions may not even exist and ready-to-run tools almost certainly do not. The methodology to solve some of these challenges may already be known, but it may require such a huge amount of computational power that only a large group of people working together in a distributed system could obtain the solution. Challenges in this category mark the thin line between algorithms that are still secure and those that are not. Solving them may take weeks or even several months. Hence, challenges in this level are intended for entire research groups with many experts in cryptanalysis, programming, and distributed systems. Success cannot be guaranteed, but if you are the first to successfully solve one of these challenges, it probably would catch the attention of the scientific community. Of course, it still remains up to you to publish or present any such scientific techniques and results. |
|
 |
Level X challenges require a thorough background in cryptanalysis and a solution would most likely constitute a breakthrough in the field. The problems categorized in this level are cryptographic ciphers that are still today unsolved. The fact that they remain unsolved today, despite the attempts of many cryptographers, suggests that these are highly difficult research problems. However, a simple idea may make some of them as easy as a level I challenge - it is simply not known to the current research community if and how these kinds of problems are solvable. Clearly, you cannot prove with a codeword that you solved one of these challenges since we (i.e., the MTC3 team) also do not know the plaintext contents of the original messages. Therefore, if you do find a promising solution, you should contact either the author of the challenge or the MTC3 team. Additionally, you should publish your findings in a famous scientific journal such as Cryptologia or Journal of Cryptology. Hence, if you are struck by inspiration and have a brilliant idea about the solution to one of the challenges categorized as level X, just give it a try.
|
Additionally, you may require tools that are not available in a convenient package like CrypTool.
All Challenges (124)
Ordered by date posted, the most recent appear first.
|
|
|
|
|
|
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 (#10) |
Achieved points (Global score) |
y-m-d - h:m:s |
|
|
|
Bart den Hartog (Bart13) |
2000 (26912) |
2012-02-11 13:23:49 |
|
|
Viktor (Veselovský) |
2000 (32635) |
2012-02-11 13:32:57 |
|
|
J. M. (jomandi) |
2000 (69433) |
2012-02-11 13:58:47 |
|
|
Nathan (Witten) |
2000 (18063) |
2012-02-11 14:53:02 |
|
#5 |
The Killer (Killer) |
2000 (28992) |
2012-02-11 15:19:01 |
|
#6 |
Armin Krauss (argh) |
2000 (70714) |
2012-02-11 16:11:07 |
|
#7 |
Michel Van Caneghem (vancan) |
2000 (11121) |
2012-02-11 17:53:01 |
|
#8 |
Seth Kintigh (DarkFibre) |
2000 (40106) |
2012-02-11 20:11:15 |
|
#9 |
Peter Mustermann (Gummiboot) |
1493 (27769) |
2012-02-12 14:49:20 |
|
#10 |
Jean-Baptiste Mossé (intersect) |
1163 (1263) |
2012-02-16 13:24:30 |
|
|
|
|
|
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 617 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 12:13 |
|
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 617 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 12:13 |
|
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 500 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 12:11 |
|
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 490 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 12:10 |
|
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 |
|
