MysteryTwister C3
NUMBER OF ACTIVE MEMBERS:

9767
Follow us: Facebook Twitter
 
 

Four levels

Four levels of increasing difficulty: From pen & paper to complex mathematical problems.

Limited attempts

You have only a limited number of attempts to solve each challenge. Be certain of your answer before you submit it.

Be fast

Be fast and earn a place on the Hall of Fame. The first four to solve each challenge will be displayed permanently.

Special Level X

The special level X contains cryptographic problems which are currently not known to have been solved.



Cipher challenges on four levels

 

Level I crypto challenges

Level I Challenges - Pen & Paper

Level I challenges are similar to crossword puzzles from newspapers and can be solved with little cryptographic background. You might not even need a computer for solving level I challenges — all you need is a bit of clever thinking and probably a pen and paper. A program like CrypTool applied to a level I challenge can help reveal the answer 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 crypto challenges

Level II Challenges - Programming skills required

Level II challenges require some background knowledge in cryptology and usually some computational power. Additionally, you may require tools that are not available in such convenient packages like CrypTool, OpenSSL or Sage. Therefore, you must first thoroughly understand the problem in order to write a computer program, which helps you getting along. 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 crypto challenges

Level III Challenges - Extensive computing power recommended

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 crypto challenges

Level X Challenges - Unsolved ciphers

Most level X challenges contain problems that have remained unsolved for a long time. The fact that they have been unsolved regardless of numerous attempts suggests these challenges being hard. However, a simple idea can probably reduce the difficulty of it to a simple level I challenge — currently it is just unknown if and how they can be solved. Of course such a challenge cannot be solved with a simple codeword, since even we (the respective author and the MTC3 team) do not know the solution (the plaintext, the original message or the approach). So if you discover a promising solution you should either contact the author or the MTC3 team. Furthermore, you can publish your findings in a scientific journal such as Cryptologia or Journal of Cryptology.

 

Additionally, you may require tools that are not available in a convenient package like CrypTool.


All Challenges (292)

Ordered by date posted, the most recent appear first.

A Cloaked Substitution Cipher — Part 2

[kallick-27] - 1 user already solved this challenge.
 
 
 

Like the MONOALPHABETIC SUBSTITUTION WITH CAMOUFLAGE series of challenges, this two-part challenge considers a modification of the classic simple substitution cipher achieved by randomly introducing decoy characters into the ciphertext in encryption which are then ignored in decryption. In part 2, the plaintext is first divided into two parts, then each part will be encrypted separately.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2019-08-25 19:26
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#1) Achieved points (Global score) y-m-d - h:m:s

D3d4lu5 (D3d4lu5) 2000 (297709) 2019-08-26 00:10:35
You must be logged in to solve the challenge


A Cloaked Substitution Cipher — Part 1

[kallick-26] - 8 users already solved this challenge.
 
 
 

Like the MONOALPHABETIC SUBSTITUTION WITH CAMOUFLAGE series of challenges, this two-part challenge considers a modification of the classic simple substitution cipher achieved by randomly introducing decoy characters into the ciphertext in encryption which are then ignored in decryption. In part 1, the cipher uses a key which devides the ciphertext alphabet into signal characters and noise characters.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2019-08-21 12:05
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#8) Achieved points (Global score) y-m-d - h:m:s

Snake (snk) 2000 (79889) 2019-08-21 19:03:44
D3d4lu5 (D3d4lu5) 2000 (297709) 2019-08-21 19:03:46
Michael Möller (michaelm) 2000 (175129) 2019-08-21 23:36:41
Eugene (lim0n) 1824 (47187) 2019-08-22 12:59:50
#5 Kurt Gebauer (Yokozuna) 1824 (175433) 2019-08-23 09:06:13
#6 Bart den Hartog (Bart13) 1725 (139176) 2019-08-24 00:59:12
#7 Viktor (Veselovský) 1660 (153262) 2019-08-24 17:35:25
#8 George (Theofanidis) 1660 (110784) 2019-08-24 19:27:39
You must be logged in to solve the challenge


The T52 Sturgeon Challenge — Part 12

[lasry-25] - 2 users already solved this challenge, 1 is working on it.
 
 
 

The Siemens and Halske T52 was a family of German teleprinter encryption devices used during WW2. This challenge is part of a series of challenges with T52. In this challenge, you need to recover the plaintext from a T52ca ciphertext. The key is partially known. You are also provided with a crib.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2019-08-10 17:32
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#2) Achieved points (Global score) y-m-d - h:m:s

D3d4lu5 (D3d4lu5) 1660 (297709) 2019-08-14 16:54:59
Kurt Gebauer (Yokozuna) 1523 (175433) 2019-08-18 15:58:58
You must be logged in to solve the challenge


The T52 Sturgeon Challenge — Part 11

[lasry-24] - 2 users already solved this challenge.
 
 
 

The Siemens and Halske T52 was a family of German teleprinter encryption devices used during WW2. This challenge is part of a series of challenges with T52. In this challenge, you need to recover the plaintext from a T52c ciphertext. The key is partially known. You are also provided with a crib.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2019-08-10 17:32
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#2) Achieved points (Global score) y-m-d - h:m:s

D3d4lu5 (D3d4lu5) 1660 (297709) 2019-08-14 17:05:47
Kurt Gebauer (Yokozuna) 1523 (175433) 2019-08-18 15:58:07
You must be logged in to solve the challenge


The T52 Sturgeon Challenge — Part 10

[lasry-23] - 1 user already solved this challenge.
 
 
 

The Siemens and Halske T52 was a family of German teleprinter encryption devices used during WW2. This challenge is part of a series of challenges with T52. In this challenge, you need to recover the plaintext from six "in-depth" ciphertexts built with T52ca. You are also provided with cribs for each message.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2019-08-10 17:32
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#1) Achieved points (Global score) y-m-d - h:m:s

Kurt Gebauer (Yokozuna) 1485 (175433) 2019-08-20 03:56:48
You must be logged in to solve the challenge


The T52 Sturgeon Challenge — Part 9

[lasry-22] - 1 user already solved this challenge.
 
 
 

The Siemens and Halske T52 was a family of German teleprinter encryption devices used during WW2. This challenge is part of a series of challenges with T52. In this challenge, you need to recover the plaintext from six "in-depth" ciphertexts built with T52a/b. You are also provided with cribs for each message.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2019-08-10 17:31
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#1) Achieved points (Global score) y-m-d - h:m:s

Kurt Gebauer (Yokozuna) 1456 (175433) 2019-08-21 22:34:20
You must be logged in to solve the challenge


The T52 Sturgeon Challenge — Part 8

[lasry-21] - 2 users already solved this challenge.
 
 
 

The Siemens and Halske T52 was a family of German teleprinter encryption devices used during WW2. This challenge is part of a series of challenges with T52. In this challenge, you need to recover the plaintext from six "in-depth" ciphertexts built with T52c. The key is partially known. You are also provided with cribs for each message.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2019-08-10 17:31
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#2) Achieved points (Global score) y-m-d - h:m:s

D3d4lu5 (D3d4lu5) 1660 (297709) 2019-08-14 06:40:22
Kurt Gebauer (Yokozuna) 1523 (175433) 2019-08-18 16:55:50
You must be logged in to solve the challenge


The T52 Sturgeon Challenge — Part 7

[lasry-20] - 2 users already solved this challenge.
 
 
 

The Siemens and Halske T52 was a family of German teleprinter encryption devices used during WW2. This challenge is part of a series of challenges with T52. In this challenge, you need to recover the plaintext from ten "in-depth" ciphertexts built with T52ca. The key is partially known.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2019-08-10 17:30
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#2) Achieved points (Global score) y-m-d - h:m:s

D3d4lu5 (D3d4lu5) 1725 (297709) 2019-08-13 16:29:12
Kurt Gebauer (Yokozuna) 1613 (175433) 2019-08-15 03:30:25
You must be logged in to solve the challenge


The T52 Sturgeon Challenge — Part 6

[lasry-19] - 2 users already solved this challenge.
 
 
 

The Siemens and Halske T52 was a family of German teleprinter encryption devices used during WW2. This challenge is part of a series of challenges with T52. In this challenge, you need to recover the plaintext from ten "in-depth" ciphertexts built with T52c. The key is partially known.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2019-08-10 17:30
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#2) Achieved points (Global score) y-m-d - h:m:s

D3d4lu5 (D3d4lu5) 1725 (297709) 2019-08-13 00:21:56
Kurt Gebauer (Yokozuna) 1613 (175433) 2019-08-15 14:53:37
You must be logged in to solve the challenge


The T52 Sturgeon Challenge — Part 5

[lasry-18] - 2 users already solved this challenge.
 
 
 

The Siemens and Halske T52 was a family of German teleprinter encryption devices used during WW2. This challenge is part of a series of challenges with T52. In this challenge, you need to recover the plaintext from ten "in-depth" ciphertexts built with T52ab. The key is partially known.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2019-08-10 17:30
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#2) Achieved points (Global score) y-m-d - h:m:s

D3d4lu5 (D3d4lu5) 1824 (297709) 2019-08-12 16:35:58
Kurt Gebauer (Yokozuna) 1660 (175433) 2019-08-13 23:24:00
You must be logged in to solve the challenge


The T52 Sturgeon Challenge — Part 4

[lasry-17] - 2 users already solved this challenge, 1 is working on it.
 
 
 

The Siemens and Halske T52 was a family of German teleprinter encryption devices used during WW2. This challenge is part of a series of challenges with T52. In this challenge, you need to recover the plaintext only from a T52ab ciphertext. The key is partially known.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2019-07-22 23:20
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#2) Achieved points (Global score) y-m-d - h:m:s

Kurt Gebauer (Yokozuna) 1725 (175433) 2019-07-25 18:49:21
D3d4lu5 (D3d4lu5) 1385 (297709) 2019-08-11 20:05:00
You must be logged in to solve the challenge


The T52 Sturgeon Challenge — Part 3

[lasry-16] - 2 users already solved this challenge.
 
 
 

The Siemens and Halske T52 was a family of German teleprinter encryption devices used during WW2. This challenge is part of a series of challenges with T52. In this challenge, you need to recover the plaintext only from a T52d ciphertext. The key is partially known.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2019-07-22 23:17
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#2) Achieved points (Global score) y-m-d - h:m:s

Kurt Gebauer (Yokozuna) 2000 (175433) 2019-07-23 07:38:03
D3d4lu5 (D3d4lu5) 1824 (297709) 2019-07-24 06:19:13
You must be logged in to solve the challenge


The T52 Sturgeon Challenge — Part 2

[lasry-15] - 2 users already solved this challenge.
 
 
 

The Siemens and Halske T52 was a family of German teleprinter encryption devices used during WW2. This challenge is part of a series of challenges with T52. In this challenge, you need to recover the plaintext only from a T52c ciphertext. The key is partially known.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2019-07-22 23:15
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#2) Achieved points (Global score) y-m-d - h:m:s

Kurt Gebauer (Yokozuna) 2000 (175433) 2019-07-23 00:55:17
D3d4lu5 (D3d4lu5) 1824 (297709) 2019-07-24 06:18:14
You must be logged in to solve the challenge


The T52 Sturgeon Challenge — Part 1

[lasry-14] - 3 users already solved this challenge.
 
 
 

The Siemens and Halske T52 was a family of German teleprinter encryption devices used during WW2. This challenge is part of a series of challenges with T52. In this challenge, you need to recover the plaintext only from a T52ab ciphertext. The key is partially known.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2019-07-13 23:11
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#3) Achieved points (Global score) y-m-d - h:m:s

Kurt Gebauer (Yokozuna) 1725 (175433) 2019-07-16 04:47:40
D3d4lu5 (D3d4lu5) 1725 (297709) 2019-07-16 17:31:02
Bart den Hartog (Bart13) 1444 (139176) 2019-07-26 16:40:28
You must be logged in to solve the challenge


The Vatican Challenge — Part 5

[lasry-13] - 0 users already solved this challenge.
 
 
 

The Vatican owns some encrypted manuscripts waiting for decryption. Can you find the solution for an archive manuscript from 1539-1548?
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2019-07-07 20:50
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


The Vatican Challenge — Part 4

[lasry-12] - 1 user already solved this challenge.
 
 
 

The Vatican owns some encrypted manuscripts waiting for decryption. Can you find the solution for an archive manuscript from 1535/1536?
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2019-07-07 20:46
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#1) Achieved points (Global score) y-m-d - h:m:s

Thomas (Thomas4897) 10000 (16596) 2019-08-23 00:58:00
You must be logged in to solve the challenge


The Vatican Challenge — Part 3

[lasry-11] - 0 users already solved this challenge.
 
 
 

The Vatican owns some encrypted manuscripts waiting for decryption. Can you find the solution for a message from 1721?
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2019-06-25 17:14
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


Handycipher — Part 10

[kallick-25] - 1 user already solved this challenge.
 
 
 

Handycipher is a low-tech stream cipher, simple enough to permit pen-and-paper encrypting and decrypting of messages, while providing a significantly high level of security. Handycipher was first published in 2014 and further improved in 2015 and 2016. Part 10 of the Handycipher series presents the same challenge as Part 9 but with a different key choice. It is a ciphertext-only challenge.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2019-06-25 17:10
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#1) Achieved points (Global score) y-m-d - h:m:s

D3d4lu5 (D3d4lu5) 2000 (297709) 2019-06-26 12:28:07
You must be logged in to solve the challenge


Handycipher made in love — Part 2

[kallick-24] - 13 users already solved this challenge, 1 is working on it.
 
 
 

Part 2 of the series "Handycipher made in love" is almost identical to Part 1 except that the solution you are asked for is the correct key that Alice used to produce the ciphertext rather than the short message embedded in the plaintext.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2019-05-21 16:47
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#13) Achieved points (Global score) y-m-d - h:m:s

Armin Krauss (argh) 2000 (185115) 2019-05-21 19:53:02
D3d4lu5 (D3d4lu5) 2000 (297709) 2019-05-21 22:37:28
Viktor (Veselovský) 2000 (153262) 2019-05-21 23:37:36
Kurt Gebauer (Yokozuna) 2000 (175433) 2019-05-22 04:17:23
#5 Alain Collignon (vexilla72) 2000 (87833) 2019-05-22 11:15:40
#6 Michael Möller (michaelm) 2000 (175129) 2019-05-22 12:28:56
#7 Danny Higgins (hamster147) 2000 (34095) 2019-05-22 12:46:19
#8 Dominik M. (Sgt. Pepper) 2000 (97919) 2019-05-22 15:03:47
#9 Eugene (lim0n) 1824 (47187) 2019-05-23 13:37:11
#10 George (Theofanidis) 1725 (110784) 2019-05-23 23:00:36
#11 Random Dude (rnd) 1469 (90929) 2019-05-31 23:52:30
#12 E.T (Ertheb) 1324 (81809) 2019-06-23 17:55:08
#13 Bart den Hartog (Bart13) 1244 (139176) 2019-08-11 23:04:07
You must be logged in to solve the challenge


Homophonic Encryption — Part 4

[kopal-04] - 12 users already solved this challenge.
 
 
 

Homophonic encryption is a modified version of the monoalphabetic substitution: One plaintext symbol can be substituted by more than one ciphertext symbol. In part 4 of this series we consider a distribution of the homophones based on English language statistics like in part 2, but the alphabet doesn't contain the blank. This is a ciphertext-only challenge. Try to crack the ciphertext and extract a specific word from the plaintext.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Authors: This email address is being protected from spambots. You need JavaScript enabled to view it.,This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2019-05-08 21:31
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#12) Achieved points (Global score) y-m-d - h:m:s

Viktor (Veselovský) 2000 (153262) 2019-05-09 00:56:19
Snake (snk) 2000 (79889) 2019-05-09 14:10:58
Armin Krauss (argh) 2000 (185115) 2019-05-09 17:58:49
George Lasry (george4096) 2000 (299488) 2019-05-09 20:48:39
#5 D3d4lu5 (D3d4lu5) 1824 (297709) 2019-05-10 18:25:33
#6 E.T (Ertheb) 1613 (81809) 2019-05-13 19:52:53
#7 Random Dude (rnd) 1456 (90929) 2019-05-20 13:42:29
#8 Dominik M. (Sgt. Pepper) 1444 (97919) 2019-05-21 18:51:04
#9 sarah b (silva) 1321 (23218) 2019-06-12 14:03:49
#10 Stephan (Stephje1978) 1254 (26762) 2019-07-20 19:51:56
#11 Bart den Hartog (Bart13) 1251 (139176) 2019-07-23 02:41:07
#12 gerdw (gerdw) 1246 (28316) 2019-07-27 22:50:35
You must be logged in to solve the challenge


Homophonic Encryption — Part 3

[kopal-03] - 17 users already solved this challenge.
 
 
 

Homophonic encryption is a modified version of the monoalphabetic substitution: One plaintext symbol can be substituted by more than one ciphertext symbol. In part 3 of this series every plaintext symbol has the same number of possible substitutions like in part 1, but the alphabet doesn't contain the blank. This is a ciphertext-only challenge. Try to crack the ciphertext and extract a specific word from the plaintext.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Authors: This email address is being protected from spambots. You need JavaScript enabled to view it.,This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2019-05-08 21:30
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#17) Achieved points (Global score) y-m-d - h:m:s

Viktor (Veselovský) 2000 (153262) 2019-05-09 00:41:40
Alain Collignon (vexilla72) 2000 (87833) 2019-05-09 10:44:10
Dominik M. (Sgt. Pepper) 2000 (97919) 2019-05-09 13:01:44
Snake (snk) 2000 (79889) 2019-05-09 13:48:05
#5 D3d4lu5 (D3d4lu5) 2000 (297709) 2019-05-09 17:16:18
#6 Armin Krauss (argh) 2000 (185115) 2019-05-09 17:34:33
#7 George Lasry (george4096) 2000 (299488) 2019-05-09 20:51:40
#8 Kurt Gebauer (Yokozuna) 1660 (175433) 2019-05-12 09:56:05
#9 E.T (Ertheb) 1613 (81809) 2019-05-13 19:39:06
#10 Random Dude (rnd) 1469 (90929) 2019-05-19 06:21:43
#11 Eugene (lim0n) 1469 (47187) 2019-05-19 07:57:08
#12 sarah b (silva) 1444 (23218) 2019-05-21 10:23:59
#13 Danny Higgins (hamster147) 1312 (34095) 2019-06-15 09:29:43
#14 George (Theofanidis) 1310 (110784) 2019-06-15 23:35:10
#15 Stephan (Stephje1978) 1254 (26762) 2019-07-20 19:44:17
#16 Bart den Hartog (Bart13) 1251 (139176) 2019-07-23 01:31:01
#17 gerdw (gerdw) 1246 (28316) 2019-07-27 22:34:51
You must be logged in to solve the challenge


Homophonic Encryption — Part 2

[kopal-02] - 18 users already solved this challenge.
 
 
 

Homophonic encryption is a modified version of the monoalphabetic substitution: One plaintext symbol can be substituted by more than one ciphertext symbol. In part 2 of this series we consider a distribution of the homophones based on English language statistics. This is a ciphertext-only challenge. Try to crack the ciphertext and extract a specific word from the plaintext.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Authors: This email address is being protected from spambots. You need JavaScript enabled to view it.,This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2019-05-08 21:30
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

George Lasry (george4096) 1725 (299488) 2019-05-10 22:02:30
Armin Krauss (argh) 1725 (185115) 2019-05-10 22:04:09
Snake (snk) 1725 (79889) 2019-05-10 22:29:03
Alain Collignon (vexilla72) 1725 (87833) 2019-05-10 23:47:11
#5 Viktor (Veselovský) 1725 (153262) 2019-05-11 00:58:36
#6 H. Lautenschlager (helmi) 1725 (32947) 2019-05-11 19:53:59
#7 Kurt Gebauer (Yokozuna) 1725 (175433) 2019-05-11 20:56:51
#8 E.T (Ertheb) 1613 (81809) 2019-05-13 19:28:56
#9 D3d4lu5 (D3d4lu5) 1576 (297709) 2019-05-14 06:05:32
#10 Eugene (lim0n) 1523 (47187) 2019-05-16 13:32:40
#11 sarah b (silva) 1485 (23218) 2019-05-18 19:57:39
#12 Random Dude (rnd) 1469 (90929) 2019-05-19 05:44:02
#13 George (Theofanidis) 1469 (110784) 2019-05-19 16:12:16
#14 Dominik M. (Sgt. Pepper) 1433 (97919) 2019-05-22 15:21:28
#15 Danny Higgins (hamster147) 1423 (34095) 2019-05-22 21:56:59
#16 Stephan (Stephje1978) 1254 (26762) 2019-07-20 18:47:10
#17 Bart den Hartog (Bart13) 1251 (139176) 2019-07-23 00:42:48
#18 gerdw (gerdw) 1246 (28316) 2019-07-27 23:58:09
You must be logged in to solve the challenge


Homophonic Encryption — Part 1

[kopal-01] - 21 users already solved this challenge.
 
 
 

Homophonic encryption is a modified version of the monoalphabetic substitution: One plaintext symbol can be substituted by more than one ciphertext symbol. In part 1 of this series every plaintext symbol has the same number of possible substitutions. This is a ciphertext-only challenge. Try to crack the ciphertext and extract a specific word from the plaintext.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Authors: This email address is being protected from spambots. You need JavaScript enabled to view it.,This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2019-05-04 21:22
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#21) Achieved points (Global score) y-m-d - h:m:s

Snake (snk) 0 (79889) 2019-05-04 20:15:46
Armin Krauss (argh) 2000 (185115) 2019-05-04 23:35:06
D3d4lu5 (D3d4lu5) 2000 (297709) 2019-05-05 04:23:38
Kurt Gebauer (Yokozuna) 2000 (175433) 2019-05-05 13:33:42
#5 H. Lautenschlager (helmi) 2000 (32947) 2019-05-05 13:50:31
#6 Dominik M. (Sgt. Pepper) 2000 (97919) 2019-05-05 15:17:09
#7 George (Theofanidis) 2000 (110784) 2019-05-05 19:47:28
#8 Marc (rcll0891) 1824 (24004) 2019-05-05 22:43:25
#9 Alain Collignon (vexilla72) 1824 (87833) 2019-05-06 11:43:14
#10 E.T (Ertheb) 1824 (81809) 2019-05-06 14:05:14
#11 Viktor (Veselovský) 1824 (153262) 2019-05-06 19:00:08
#12 Michael Möller (michaelm) 1725 (175129) 2019-05-06 22:40:30
#13 George Lasry (george4096) 1660 (299488) 2019-05-07 22:40:03
#14 sarah b (silva) 1523 (23218) 2019-05-12 10:44:07
#15 Eugene (lim0n) 1469 (47187) 2019-05-15 14:53:33
#16 Random Dude (rnd) 1444 (90929) 2019-05-17 03:56:02
#17 Danny Higgins (hamster147) 1398 (34095) 2019-05-22 17:04:47
#18 Hans Joachim Girulat (joregi) 1262 (36279) 2019-07-09 15:30:08
#19 Stephan (Stephje1978) 1250 (26762) 2019-07-20 19:47:49
#20 Bart den Hartog (Bart13) 1247 (139176) 2019-07-22 23:32:57
#21 gerdw (gerdw) 1244 (28316) 2019-07-27 20:56:08
You must be logged in to solve the challenge


Handycipher made in love — Part 1

[theofanidis-09] - 18 users already solved this challenge.
 
 
 

Strange things happen when you're in love. This challenge is about how the plaintext can be revealed when Handycipher is used in a wrong way.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2019-02-16 12:29
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

Armin Krauss (argh) 2000 (185115) 2019-02-16 14:52:29
D3d4lu5 (D3d4lu5) 2000 (297709) 2019-02-16 16:30:13
Michael Möller (michaelm) 2000 (175129) 2019-02-16 18:53:09
George Lasry (george4096) 2000 (299488) 2019-02-16 21:36:16
#5 Alain Collignon (vexilla72) 2000 (87833) 2019-02-16 22:05:39
#6 Viktor (Veselovský) 2000 (153262) 2019-02-16 23:50:47
#7 Kurt Gebauer (Yokozuna) 2000 (175433) 2019-02-17 05:12:50
#8 Dominik M. (Sgt. Pepper) 1824 (97919) 2019-02-17 16:28:10
#9 Snake (snk) 1824 (79889) 2019-02-17 19:03:26
#10 Rainer Zufall (kiekuk) 1406 (56786) 2019-03-04 14:32:25
#11 sarah b (silva) 1281 (23218) 2019-04-10 10:11:09
#12 curmudgeon (curmudgeon) 1262 (1973) 2019-04-23 06:26:13
#13 Beamofoldlight (Beamofoldlight) 1250 (3745) 2019-05-03 16:05:30
#14 Danny Higgins (hamster147) 1236 (34095) 2019-05-19 22:53:22
#15 Eugene (lim0n) 1233 (47187) 2019-05-23 14:09:42
#16 Random Dude (rnd) 1227 (90929) 2019-05-31 13:45:56
#17 E.T (Ertheb) 1216 (81809) 2019-06-19 17:29:41
#18 Bart den Hartog (Bart13) 1199 (139176) 2019-07-29 05:55:03
You must be logged in to solve the challenge


Monoalphabetic Substitution with Nostradamus Flavor

[theofanidis-08] - 18 users already solved this challenge, 2 are working on it.
 
 
 

What would Nostradamus do to make a mono-alphabetic substitution harder to break?
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2019-02-16 12:28
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

Armin Krauss (argh) 2000 (185115) 2019-02-16 13:26:09
D3d4lu5 (D3d4lu5) 2000 (297709) 2019-02-16 15:57:07
Dominik M. (Sgt. Pepper) 2000 (97919) 2019-02-16 19:22:15
George Lasry (george4096) 2000 (299488) 2019-02-16 21:43:46
#5 Viktor (Veselovský) 2000 (153262) 2019-02-16 23:02:15
#6 Alain Collignon (vexilla72) 2000 (87833) 2019-02-16 23:07:32
#7 Kurt Gebauer (Yokozuna) 2000 (175433) 2019-02-17 06:54:14
#8 Snake (snk) 1824 (79889) 2019-02-17 17:11:33
#9 Luigi Tomelli (archstanton) 1660 (108345) 2019-02-19 13:04:04
#10 Lane Williams (planetlane) 1660 (23948) 2019-02-19 16:02:06
#11 Random Dude (rnd) 1660 (90929) 2019-02-19 17:26:52
#12 Karl Schutt (günter) 1660 (41550) 2019-02-19 18:42:32
#13 sarah b (silva) 1613 (23218) 2019-02-20 15:14:33
#14 Pierre Robier (tripleedged) 1613 (5916) 2019-02-20 21:29:51
#15 Rainer Zufall (kiekuk) 1444 (56786) 2019-02-28 16:30:24
#16 E.T (Ertheb) 1261 (81809) 2019-04-23 17:55:37
#17 Hans Joachim Girulat (joregi) 1223 (36279) 2019-06-07 22:57:11
#18 Michael (FoM) 1217 (38953) 2019-06-18 17:17:19
You must be logged in to solve the challenge


Cryptanalysis Hacking Puzzles — Part 2

[martins-02] - 65 users already solved this challenge, 16 are working on it.
 
 
 

Solving this challenge is not as hard as finding the needle in a haystack, isn't it?
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2019-01-09 14:10
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#65) Achieved points (Global score) y-m-d - h:m:s

Armin Krauss (argh) 200 (185115) 2019-01-09 15:41:27
Dominik M. (Sgt. Pepper) 200 (97919) 2019-01-09 16:25:16
sarah b (silva) 200 (23218) 2019-01-09 20:37:52
Alain Collignon (vexilla72) 200 (87833) 2019-01-10 08:00:54
#5 Random Dude (rnd) 200 (90929) 2019-01-10 13:53:12
#6 D3d4lu5 (D3d4lu5) 150 (297709) 2019-01-10 22:13:00
#7 S (Zyphe) 133 (10461) 2019-01-11 17:15:04
#8 George (Theofanidis) 133 (110784) 2019-01-11 18:10:41
#9 Michael Möller (michaelm) 125 (175129) 2019-01-12 22:07:19
#10 0e85dc6eaf (0e85dc6eaf) 125 (125) 2019-01-13 13:05:43
#11 j.h. (haegarq) 114 (15252) 2019-01-16 06:17:43
#12 E.T (Ertheb) 107 (81809) 2019-01-22 21:08:13
#13 Lane Williams (planetlane) 105 (23948) 2019-01-31 03:52:34
#14 Klein (rijman) 104 (417) 2019-02-04 19:38:43
#15 Oliver Spiess (AWK-Spiess) 103 (503) 2019-02-10 23:03:31
#16 Pierre Robier (tripleedged) 103 (5916) 2019-02-16 16:59:17
#17 yachoor (yachoor) 103 (103) 2019-02-18 12:09:49
#18 Oliver H (AlfheriH) 102 (804) 2019-02-23 13:20:02
#19 Luigy (Luigy) 102 (102) 2019-03-01 01:12:17
#20 Sergey (vkaser) 102 (902) 2019-03-05 14:17:35
#21 Ulrich Dorobeck (Papageno) 102 (3827) 2019-03-06 16:31:58
#22 Rainer Zufall (kiekuk) 102 (56786) 2019-03-07 09:54:57
#23 Viktor (Veselovský) 102 (153262) 2019-03-10 11:36:16
#24 Snake (snk) 102 (79889) 2019-03-10 13:49:10
#25 Somebody (Achidutzu) 102 (2796) 2019-03-11 15:41:55
#26 Michael (FoM) 102 (38953) 2019-03-14 15:40:07
#27 Thiago Araujo Pereira (thiagoap) 101 (701) 2019-03-21 14:22:15
#28 Joerg G. (SnifferMaster) 101 (18154) 2019-03-22 14:48:50
#29 Jennifer White (Dusty) 101 (501) 2019-03-24 20:38:43
#30 Sebastian Slupina (Grandwizard) 101 (10866) 2019-03-31 23:42:04
#31 Christian (Zettorino) 101 (502) 2019-04-04 10:17:30
#32 Kame Kaze (kamekazeman) 101 (301) 2019-04-17 23:43:59
#33 E41614048 (E41614048) 101 (4063) 2019-04-26 12:04:23
#34 Hughes (hughes) 101 (7925) 2019-04-29 10:49:10
#35 E41614001 (E41614001) 101 (2782) 2019-05-01 17:57:55
#36 E41614018 (E41614018) 101 (6243) 2019-05-02 14:34:13
#37 E41614031 (E41614031) 101 (7526) 2019-05-03 14:15:51
#38 E41614038 (SurgeWong) 101 (1989) 2019-05-04 09:24:17
#39 Pavel Kessler (pavel) 101 (5096) 2019-05-04 23:15:14
#40 Maggie K (Maggiek) 101 (101) 2019-05-06 20:40:00
#41 hi (hellothere) 101 (101) 2019-05-12 14:23:07
#42 Norbert Biermann (Norbert) 101 (45031) 2019-05-17 16:29:31
#43 Manfred (katatonius) 101 (2394) 2019-05-28 11:38:13
#44 Hans Joachim Girulat (joregi) 101 (36279) 2019-05-28 22:20:25
#45 Eugene (lim0n) 101 (47187) 2019-06-12 13:31:56
#46 Chaosdreamer (Chaosdreamer) 101 (101) 2019-06-15 01:28:20
#47 Jeff (Fountain) 101 (8788) 2019-06-15 22:39:45
#48 Vermillion (Vermillion) 101 (101) 2019-06-15 23:20:52
#49 Malte Spiegelberg (Caunthol) 101 (601) 2019-06-16 16:04:18
#50 Danny Higgins (hamster147) 101 (34095) 2019-06-19 13:17:53
#51 newbie (newbies) 101 (101) 2019-06-28 13:19:26
#52 david (sexton) 101 (2801) 2019-06-30 17:50:28
#53 T (Wagner) 101 (16988) 2019-06-30 20:35:00
#54 gerdw (gerdw) 101 (28316) 2019-07-06 22:08:23
#55 Andi (Penticton) 101 (101) 2019-07-10 16:06:53
#56 Egon Hamburger (Seehase) 101 (3746) 2019-07-15 09:42:14
#57 Bart den Hartog (Bart13) 101 (139176) 2019-07-16 00:48:18
#58 kokn3t (kokn3t) 101 (101) 2019-07-22 07:02:11
#59 Kurt Gebauer (Yokozuna) 100 (175433) 2019-07-29 22:37:44
#60 M Koch (Mako) 100 (200) 2019-07-31 17:48:37
#61 J-L Morel (Rossignol) 100 (29425) 2019-08-10 17:49:09
#62 Stephan (Stephje1978) 100 (26762) 2019-08-11 19:22:23
#63 H. Lautenschlager (helmi) 100 (32947) 2019-08-15 23:15:04
#64 Denilson (denilson) 100 (800) 2019-08-23 02:24:37
#65 Alexander Berezhnoy (bereal) 100 (200) 2019-08-24 10:49:40
You must be logged in to solve the challenge


"The Road" — Part 3

[gutgesell-08] - 0 users already solved this challenge, 2 are working on it.
 
 
 

Once upon a time, there was a three-part challenge which was inspired by Kryptos and is based on a fairy tale. Can you solve this mysterious challenge?
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2018-12-08 17:45
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


"The Road" — Part 2

[gutgesell-07] - 0 users already solved this challenge.
 
 
 

Once upon a time, there was a three-part challenge which was inspired by Kryptos and is based on a fairy tale. Can you solve this mysterious challenge?
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2018-12-08 17: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


"The Road" — Part 1

[gutgesell-06] - 3 users already solved this challenge.
 
 
 

Once upon a time, there was a three-part challenge which was inspired by Kryptos and is based on a fairy tale. Can you solve this mysterious challenge?
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2018-12-08 17:27
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#3) Achieved points (Global score) y-m-d - h:m:s

Armin Krauss (argh) 1824 (185115) 2018-12-10 15:47:26
Viktor (Veselovský) 1613 (153262) 2018-12-13 15:15:16
D3d4lu5 (D3d4lu5) 1315 (297709) 2019-01-14 08:37:31
You must be logged in to solve the challenge


Catherine of Aragon's Letter to King Ferdinand, her Father (1509)

[tomokiyo-01] - 2 users already solved this challenge.
 
 
 

On November 3rd, 1509, Catherine of Aragon wrote an encrypted letter to her father. What did she tell him?
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2018-11-28 15:42
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#2) Achieved points (Global score) y-m-d - h:m:s

Thomas (Thomas4897) 2000 (16596) 2018-12-11 15:50:54
Viktor (Veselovský) 2000 (153262) 2018-12-11 15:52:01
You must be logged in to solve the challenge


Cryptanalysis Hacking Puzzles — Part 1

[martins-01] - 21 users already solved this challenge, 16 are working on it.
 
 
 

Three messages were delivered — two encrypted, one in clear. Can you solve the puzzle?
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2018-10-26 20:33
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#21) Achieved points (Global score) y-m-d - h:m:s

Viktor (Veselovský) 200 (153262) 2018-10-26 22:47:28
D3d4lu5 (D3d4lu5) 200 (297709) 2018-10-27 08:18:21
Dominik M. (Sgt. Pepper) 200 (97919) 2018-10-27 14:30:52
Random Dude (rnd) 150 (90929) 2018-10-28 01:43:34
#5 Snake (snk) 150 (79889) 2018-10-28 17:45:23
#6 E.T (Ertheb) 150 (81809) 2018-10-28 18:58:04
#7 Armin Krauss (argh) 117 (185115) 2018-11-01 19:25:26
#8 Rainer Zufall (kiekuk) 113 (56786) 2018-11-03 12:57:49
#9 Kurt Gebauer (Yokozuna) 113 (175433) 2018-11-03 15:32:07
#10 H. Lautenschlager (helmi) 113 (32947) 2018-11-03 17:33:23
#11 Alain Collignon (vexilla72) 111 (87833) 2018-11-04 11:04:29
#12 Hans Peter (hanspeter) 108 (52256) 2018-11-08 18:35:37
#13 Johnatan (RazorBest) 103 (1105) 2018-12-03 17:38:42
#14 Michael (FoM) 102 (38953) 2018-12-27 19:40:37
#15 S (Zyphe) 101 (10461) 2019-01-13 16:47:18
#16 v1k1ng (v1k1ng) 101 (101) 2019-01-21 22:25:16
#17 Hughes (hughes) 101 (7925) 2019-04-30 09:51:16
#18 Hans Joachim Girulat (joregi) 100 (36279) 2019-05-28 15:38:03
#19 Eugene (lim0n) 100 (47187) 2019-06-12 11:03:04
#20 david (sexton) 100 (2801) 2019-07-01 10:52:43
#21 J-L Morel (Rossignol) 100 (29425) 2019-08-10 17:08:53
You must be logged in to solve the challenge


Breaking a Filter Generator

[cli-03] - 13 users already solved this challenge.
 
 
 

You are given a part of a keystream, which was produced by a filter generator. Can you find the missing keystream bytes?
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2018-09-25 14:22
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#13) Achieved points (Global score) y-m-d - h:m:s

Kurt Gebauer (Yokozuna) 1824 (175433) 2018-09-26 21:06:06
Viktor (Veselovský) 1725 (153262) 2018-09-27 22:20:26
roehm (roehm) 1725 (5399) 2018-09-28 00:56:29
D3d4lu5 (D3d4lu5) 1725 (297709) 2018-09-28 02:01:18
#5 Alain Collignon (vexilla72) 1660 (87833) 2018-09-28 16:19:20
#6 S Combes (jerva) 1660 (99132) 2018-09-29 13:49:15
#7 Nicolas (nicosPavlov) 1469 (151166) 2018-10-06 07:29:57
#8 E.T (Ertheb) 1385 (81809) 2018-10-15 13:04:25
#9 George Lasry (george4096) 1330 (299488) 2018-10-27 02:15:58
#10 Random Dude (rnd) 1318 (90929) 2018-10-30 18:04:00
#11 Kasia (kasia-tutej) 1232 (53366) 2018-12-31 19:29:06
#12 ykaridi (ykaridi) 1192 (7035) 2019-03-27 20:24:51
#13 Bart den Hartog (Bart13) 1164 (139176) 2019-08-06 16:56:35
You must be logged in to solve the challenge


Autokey Cipher

[cli-02] - 85 users already solved this challenge, 5 are working on it.
 
 
 

The autokey cipher uses only a short keyword and the plaintext to encrypt messages. Are you able to break the given ciphertext?
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2018-09-25 14:21
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#85) Achieved points (Global score) y-m-d - h:m:s

Snake (snk) 200 (79889) 2018-09-25 16:08:04
Viktor (Veselovský) 200 (153262) 2018-09-25 22:11:53
Michael Möller (michaelm) 200 (175129) 2018-09-25 22:32:51
Kurt Gebauer (Yokozuna) 200 (175433) 2018-09-26 02:53:02
#5 Armin Krauss (argh) 200 (185115) 2018-09-26 09:50:09
#6 H. Lautenschlager (helmi) 150 (32947) 2018-09-26 19:27:39
#7 Random Dude (rnd) 150 (90929) 2018-09-26 20:28:17
#8 Em Doulgerakis (Greko) 150 (124033) 2018-09-26 20:50:58
#9 Alain Collignon (vexilla72) 150 (87833) 2018-09-27 11:05:50
#10 Dominik M. (Sgt. Pepper) 150 (97919) 2018-09-27 11:50:12
#11 Nicolas (nicosPavlov) 133 (151166) 2018-09-27 18:41:45
#12 D3d4lu5 (D3d4lu5) 133 (297709) 2018-09-28 06:16:40
#13 Murat Kaya (mksecurity) 133 (133) 2018-09-28 08:50:51
#14 Joerg G. (SnifferMaster) 125 (18154) 2018-09-28 15:52:36
#15 E.T (Ertheb) 125 (81809) 2018-09-28 16:50:20
#16 Joachim Kessel (joe_counter) 120 (229) 2018-09-29 15:00:43
#17 George (Theofanidis) 120 (110784) 2018-09-29 17:44:10
#18 sarah b (silva) 117 (23218) 2018-10-01 10:03:13
#19 S (Zyphe) 114 (10461) 2018-10-01 16:30:16
#20 Lane Williams (planetlane) 113 (23948) 2018-10-02 18:45:46
#21 Jörg Schwarzwälder (secuso) 113 (2125) 2018-10-02 22:31:54
#22 Marc (rcll0891) 113 (24004) 2018-10-02 22:50:57
#23 Dodo (Dodo) 111 (2335) 2018-10-03 23:13:57
#24 HowarthStudios (HowarthStudios) 110 (3596) 2018-10-04 18:57:11
#25 kelalaka (kelalaka) 108 (417) 2018-10-06 16:20:34
#26 Javantea (Javantea) 108 (40816) 2018-10-08 03:03:57
#27 Luigi Tomelli (archstanton) 107 (108345) 2018-10-09 09:55:33
#28 Nofre Tete (noffi) 106 (21921) 2018-10-11 00:10:28
#29 Arbacle Clemens (arbacle) 106 (2502) 2018-10-12 21:47:20
#30 Ekrem Aydin (Eko115) 105 (1105) 2018-10-14 15:12:37
#31 Pavel Kessler (pavel) 105 (5096) 2018-10-14 23:31:28
#32 j.h. (haegarq) 104 (15252) 2018-10-17 14:31:21
#33 Roland Jansen (roland) 104 (17607) 2018-10-20 10:17:11
#34 jusb3 (jusb3) 103 (2199) 2018-10-25 17:22:24
#35 João Vaz Martins (Awakening Star) 103 (4561) 2018-10-28 12:15:47
#36 Christian (gizmore) 103 (204) 2018-10-29 21:59:44
#37 Rainer Zufall (kiekuk) 103 (56786) 2018-10-29 22:51:17
#38 clyto (clytorock) 103 (3195) 2018-11-03 13:42:10
#39 Hans Peter (hanspeter) 102 (52256) 2018-11-08 18:43:25
#40 madness (madness) 102 (15407) 2018-11-15 02:30:32
#41 steven (steven18) 102 (3091) 2018-11-25 13:56:37
#42 Karl Schutt (günter) 101 (41550) 2018-12-02 08:45:33
#43 Johnatan (RazorBest) 101 (1105) 2018-12-03 18:06:20
#44 zuben c3 (zuben-c3) 101 (24853) 2018-12-17 19:42:41
#45 DirkS (Dustman) 101 (8479) 2018-12-18 14:06:12
#46 Dev Kalra (0__0) 101 (1490) 2018-12-22 18:38:39
#47 fm92 (fm92) 101 (601) 2018-12-24 11:44:39
#48 Bertolo (Bertolo) 101 (7167) 2018-12-24 14:34:03
#49 Ein-beispiel (Ein-beispiel) 101 (301) 2018-12-30 23:25:55
#50 Pierre Robier (tripleedged) 101 (5916) 2019-01-02 23:49:13
#51 Epeli (Epeli) 101 (3084) 2019-01-04 23:58:11
#52 Szabó Zoltán (szabo.z87) 101 (55604) 2019-01-07 10:50:44
#53 Michael (FoM) 101 (38953) 2019-01-15 01:34:57
#54 mglarragan (mglarragan) 101 (2091) 2019-01-20 11:02:50
#55 Oliver H (AlfheriH) 101 (804) 2019-02-23 15:07:06
#56 George Lasry (george4096) 101 (299488) 2019-02-23 20:06:46
#57 Raudah (Sandouk) 101 (301) 2019-03-05 20:33:00
#58 Ulrich Dorobeck (Papageno) 101 (3827) 2019-03-05 22:32:20
#59 Somebody (Achidutzu) 101 (2796) 2019-03-15 22:17:42
#60 Selma Metin (seltuna) 101 (902) 2019-03-28 14:58:12
#61 Sebastian Slupina (Grandwizard) 101 (10866) 2019-03-31 23:23:12
#62 Christian (Zettorino) 101 (502) 2019-04-04 11:04:03
#63 Darchicourt (Darki) 101 (3308) 2019-04-09 11:27:52
#64 Kame Kaze (kamekazeman) 100 (301) 2019-04-18 16:58:27
#65 Hughes (hughes) 100 (7925) 2019-04-30 10:59:39
#66 Beamofoldlight (Beamofoldlight) 100 (3745) 2019-05-06 19:48:16
#67 Luth (Luthorien) 100 (800) 2019-05-15 12:24:15
#68 Norbert Biermann (Norbert) 100 (45031) 2019-05-17 16:43:09
#69 Martin (LordMartin) 100 (402) 2019-05-21 15:39:54
#70 Hans Joachim Girulat (joregi) 100 (36279) 2019-05-23 19:57:01
#71 Jeff (Fountain) 100 (8788) 2019-05-25 22:40:17
#72 Mark Bedaywi (Supermac30) 100 (200) 2019-05-26 17:25:55
#73 Jörg Höpfner (hpjulianum) 100 (200) 2019-06-16 19:53:21
#74 Danny Higgins (hamster147) 100 (34095) 2019-06-19 12:01:06
#75 Mike (RogueRamblers) 100 (26411) 2019-06-22 01:28:02
#76 Piotr (lesnik7) 100 (8171) 2019-06-22 12:43:46
#77 david (sexton) 100 (2801) 2019-06-30 16:16:43
#78 gerdw (gerdw) 100 (28316) 2019-07-06 22:40:34
#79 Malte Spiegelberg (Caunthol) 100 (601) 2019-07-11 19:27:05
#80 Bart den Hartog (Bart13) 100 (139176) 2019-07-15 23:54:28
#81 ajg (ludimus) 100 (11914) 2019-07-29 00:04:29
#82 robot (imnotarobot) 100 (100) 2019-08-01 02:07:35
#83 Gerben Blom (Gerben) 100 (600) 2019-08-10 12:01:51
#84 Stephan (Stephje1978) 100 (26762) 2019-08-17 19:02:34
#85 Alexander Berezhnoy (bereal) 100 (200) 2019-08-24 15:36:17
You must be logged in to solve the challenge


Modular Sequences

[cli-01] - 35 users already solved this challenge, 17 are working on it.
 
 
 

What do you know about modular sequences? Work it out.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2018-09-25 14:19
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#35) Achieved points (Global score) y-m-d - h:m:s

Em Doulgerakis (Greko) 200 (124033) 2018-09-25 15:30:49
Snake (snk) 200 (79889) 2018-09-25 17:05:31
Viktor (Veselovský) 200 (153262) 2018-09-25 21:39:20
Kurt Gebauer (Yokozuna) 200 (175433) 2018-09-26 02:12:29
#5 Armin Krauss (argh) 200 (185115) 2018-09-26 09:53:20
#6 H. Lautenschlager (helmi) 150 (32947) 2018-09-26 17:43:13
#7 Random Dude (rnd) 150 (90929) 2018-09-26 20:55:07
#8 Dominik M. (Sgt. Pepper) 150 (97919) 2018-09-27 11:43:26
#9 Alain Collignon (vexilla72) 150 (87833) 2018-09-27 12:26:17
#10 D3d4lu5 (D3d4lu5) 133 (297709) 2018-09-28 06:52:02
#11 S (Zyphe) 114 (10461) 2018-10-01 15:48:02
#12 Dodo (Dodo) 111 (2335) 2018-10-03 22:15:17
#13 kelalaka (kelalaka) 108 (417) 2018-10-07 11:41:41
#14 Luigi Tomelli (archstanton) 106 (108345) 2018-10-11 14:59:10
#15 Rainer Zufall (kiekuk) 103 (56786) 2018-11-01 19:44:48
#16 Hans Peter (hanspeter) 102 (52256) 2018-11-15 07:33:53
#17 madness (madness) 102 (15407) 2018-11-15 10:59:14
#18 Christian (chrisadmin) 102 (2019) 2018-11-19 18:50:23
#19 E.T (Ertheb) 102 (81809) 2018-11-19 21:26:49
#20 Joerg G. (SnifferMaster) 102 (18154) 2018-11-22 14:48:02
#21 Johnatan (RazorBest) 101 (1105) 2018-12-05 11:00:20
#22 Michael (FoM) 101 (38953) 2019-01-13 12:05:38
#23 Pierre Robier (tripleedged) 101 (5916) 2019-02-18 23:51:30
#24 Oliver H (AlfheriH) 101 (804) 2019-02-23 14:52:10
#25 Jens Hansen (bonnaix) 101 (3511) 2019-03-08 20:38:41
#26 Klaus (kumaus) 101 (21415) 2019-03-19 16:35:44
#27 Darchicourt (Darki) 101 (3308) 2019-04-09 13:56:41
#28 Hughes (hughes) 100 (7925) 2019-04-30 13:12:00
#29 Luth (Luthorien) 100 (800) 2019-05-15 13:13:01
#30 Norbert Biermann (Norbert) 100 (45031) 2019-05-18 20:34:35
#31 Simon Hemmerich (simhem) 100 (3779) 2019-06-11 00:33:38
#32 Jörg Höpfner (hpjulianum) 100 (200) 2019-07-03 21:14:41
#33 Stephan (Stephje1978) 100 (26762) 2019-07-16 20:26:31
#34 Bart den Hartog (Bart13) 100 (139176) 2019-07-22 05:03:16
#35 Chung Nguyen Huy Hoang (CNHHoang) 100 (700) 2019-08-03 06:41:55
You must be logged in to solve the challenge


Trendy Messenger

[minihold-03] - 28 users already solved this challenge, 1 is working on it.
 
 
 

Sniffing on the WiFi, you notice an ElGamal encrypted message. Are you able to compute it?
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2018-06-12 13:26
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#28) Achieved points (Global score) y-m-d - h:m:s

D3d4lu5 (D3d4lu5) 2000 (297709) 2018-06-13 01:04:34
Kurt Gebauer (Yokozuna) 2000 (175433) 2018-06-13 11:25:42
Dominik M. (Sgt. Pepper) 1824 (97919) 2018-06-13 14:33:57
Viktor (Veselovský) 1725 (153262) 2018-06-14 19:05:40
#5 Alain Collignon (vexilla72) 1547 (87833) 2018-06-19 07:44:33
#6 George (Theofanidis) 1523 (110784) 2018-06-19 19:26:48
#7 Vlad (Vlad94) 1523 (1523) 2018-06-19 20:50:56
#8 Teodoru catalin Andrei (teodoru) 1502 (5698) 2018-06-20 16:01:04
#9 Eric (ExAstris) 1469 (26990) 2018-06-22 16:47:20
#10 E.T (Ertheb) 1456 (81809) 2018-06-23 14:51:57
#11 Christophe BORELLY (cb34) 1433 (12358) 2018-06-25 13:53:33
#12 Silvia Kortmann (mikinsget) 1406 (10104) 2018-06-29 10:26:04
#13 Armin Krauss (argh) 1398 (185115) 2018-06-29 14:25:48
#14 Nicolas (nicosPavlov) 1330 (151166) 2018-07-13 16:23:13
#15 Mihail (plexor) 1327 (16827) 2018-07-14 19:56:05
#16 Alain (Integral) 1307 (207924) 2018-07-21 13:53:14
#17 Em Doulgerakis (Greko) 1288 (124033) 2018-07-30 16:34:08
#18 Karl Schutt (günter) 1278 (41550) 2018-08-06 05:43:46
#19 Javantea (Javantea) 1218 (40816) 2018-10-10 03:19:11
#20 Random Dude (rnd) 1212 (90929) 2018-10-22 22:43:50
#21 kilink (kilink) 1200 (8053) 2018-11-19 00:27:26
#22 Snake (snk) 1199 (79889) 2018-11-23 16:13:11
#23 Rainer Zufall (kiekuk) 1199 (56786) 2018-11-23 21:37:49
#24 Luigi Tomelli (archstanton) 1191 (108345) 2018-12-15 19:54:53
#25 Kasia (kasia-tutej) 1187 (53366) 2018-12-31 17:02:03
#26 Will (nitrow) 1164 (6807) 2019-04-26 11:30:50
#27 Eugene (lim0n) 1161 (47187) 2019-05-13 11:02:50
#28 Bart den Hartog (Bart13) 1153 (139176) 2019-07-22 17:30:41
You must be logged in to solve the challenge


Fastest in the West

[minihold-01] - 26 users already solved this challenge.
 
 
 

Buying a train ticket via credit card should not be a problem — actually. Can you solve the subset-sum problem to get your train?
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2018-06-12 13:24
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#26) Achieved points (Global score) y-m-d - h:m:s

Kurt Gebauer (Yokozuna) 2000 (175433) 2018-06-13 03:24:07
D3d4lu5 (D3d4lu5) 2000 (297709) 2018-06-13 07:45:23
Alain Collignon (vexilla72) 2000 (87833) 2018-06-13 10:36:19
Dominik M. (Sgt. Pepper) 1824 (97919) 2018-06-14 13:22:36
#5 Viktor (Veselovský) 1725 (153262) 2018-06-14 16:21:58
#6 George (Theofanidis) 1660 (110784) 2018-06-15 20:11:16
#7 E.T (Ertheb) 1576 (81809) 2018-06-17 22:53:05
#8 Diaconu Bogdan (bogdan_walle) 1523 (1723) 2018-06-19 16:36:32
#9 Teodoru catalin Andrei (teodoru) 1502 (5698) 2018-06-20 15:58:58
#10 Eric (ExAstris) 1485 (26990) 2018-06-21 18:56:13
#11 Alain (Integral) 1485 (207924) 2018-06-22 00:15:18
#12 Snake (snk) 1469 (79889) 2018-06-22 22:48:21
#13 Armin Krauss (argh) 1398 (185115) 2018-06-29 15:27:43
#14 Nicolas (nicosPavlov) 1391 (151166) 2018-07-01 04:20:26
#15 Christophe BORELLY (cb34) 1385 (12358) 2018-07-02 11:31:03
#16 George Lasry (george4096) 1367 (299488) 2018-07-04 23:19:04
#17 Em Doulgerakis (Greko) 1288 (124033) 2018-07-30 15:10:17
#18 Michael Möller (michaelm) 1233 (175129) 2018-09-16 15:06:39
#19 Random Dude (rnd) 1212 (90929) 2018-10-21 20:56:52
#20 Rainer Zufall (kiekuk) 1206 (56786) 2018-11-03 21:05:24
#21 kilink (kilink) 1200 (8053) 2018-11-19 00:02:07
#22 Luigi Tomelli (archstanton) 1191 (108345) 2018-12-16 10:43:50
#23 Kasia (kasia-tutej) 1187 (53366) 2018-12-31 16:12:51
#24 Bart den Hartog (Bart13) 1153 (139176) 2019-07-22 21:37:01
#25 Eugene (lim0n) 1152 (47187) 2019-08-01 14:43:32
#26 Dr. Peter Uelkes (RandyWaterhouse) 1150 (9990) 2019-08-18 12:10:20
You must be logged in to solve the challenge


Summer Job

[minihold-02] - 34 users already solved this challenge, 2 are working on it.
 
 
 

During your summer job in an Austrian weekly magazine a mysterious letter arrives. Are you able to decrypt the message?
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2018-06-12 13:16
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#34) Achieved points (Global score) y-m-d - h:m:s

Kurt Gebauer (Yokozuna) 2000 (175433) 2018-06-12 21:37:26
E.T (Ertheb) 2000 (81809) 2018-06-12 21:48:19
Viktor (Veselovský) 2000 (153262) 2018-06-12 23:34:15
D3d4lu5 (D3d4lu5) 2000 (297709) 2018-06-13 06:19:26
#5 Alain Collignon (vexilla72) 1824 (87833) 2018-06-13 15:53:42
#6 Dominik M. (Sgt. Pepper) 1725 (97919) 2018-06-14 22:17:14
#7 George (Theofanidis) 1613 (110784) 2018-06-17 11:54:19
#8 John Smith (Froyo10) 1547 (1747) 2018-06-18 20:24:50
#9 Teodoru catalin Andrei (teodoru) 1502 (5698) 2018-06-20 15:57:16
#10 Eric (ExAstris) 1485 (26990) 2018-06-22 04:38:27
#11 Alain (Integral) 1469 (207924) 2018-06-23 10:16:28
#12 Silvia Kortmann (mikinsget) 1433 (10104) 2018-06-26 01:36:50
#13 Armin Krauss (argh) 1406 (185115) 2018-06-28 20:33:36
#14 George Lasry (george4096) 1367 (299488) 2018-07-04 22:04:09
#15 Snake (snk) 1330 (79889) 2018-07-13 21:05:10
#16 Nicolas (nicosPavlov) 1327 (151166) 2018-07-15 05:49:19
#17 Mihail (plexor) 1324 (16827) 2018-07-16 09:04:57
#18 Em Doulgerakis (Greko) 1294 (124033) 2018-07-27 15:28:14
#19 Karl Schutt (günter) 1279 (41550) 2018-08-04 21:30:42
#20 Hans Joachim Girulat (joregi) 1278 (36279) 2018-08-05 17:41:25
#21 Andrei Gasparovici (fullofvim) 1261 (1861) 2018-08-18 07:52:36
#22 Random Dude (rnd) 1217 (90929) 2018-10-13 03:24:44
#23 Rainer Zufall (kiekuk) 1206 (56786) 2018-11-03 12:37:24
#24 Hans Peter (hanspeter) 1204 (52256) 2018-11-08 18:53:31
#25 kilink (kilink) 1200 (8053) 2018-11-18 22:14:22
#26 Luigi Tomelli (archstanton) 1191 (108345) 2018-12-17 12:59:10
#27 Kasia (kasia-tutej) 1187 (53366) 2018-12-31 17:36:11
#28 Szabó Zoltán (szabo.z87) 1185 (55604) 2019-01-08 08:51:43
#29 Nofre Tete (noffi) 1185 (21921) 2019-01-08 21:53:11
#30 zuben c3 (zuben-c3) 1184 (24853) 2019-01-11 10:59:35
#31 Eugene (lim0n) 1161 (47187) 2019-05-12 13:21:42
#32 Marco Cinelli (Snap) 1160 (28365) 2019-05-21 13:00:26
#33 gerdw (gerdw) 1153 (28316) 2019-07-14 17:26:39
#34 Bart den Hartog (Bart13) 1153 (139176) 2019-07-16 05:21:53
You must be logged in to solve the challenge


Weakened ElsieFour — Part 2

[rotthaler-08] - 0 users already solved this challenge, 1 is working on it.
 
 
 

The challenges for the weakened ElsieFour serve as an exercise and use an intentionally weakened version of LC4. ElsieFour combines ideas of modern RC4 stream cipher, historical Playfair cipher and plaintext-dependent keystreams. It can be computed manually. Part 2 is a partly-known key challenge which provides 12 consecutive characters of the key.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2018-04-28 16:36
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


Weakened ElsieFour — Part 1

[rotthaler-07] - 1 user already solved this challenge.
 
 
 

The challenges for the weakened ElsieFour serve as an exercise and use an intentionally weakened version of LC4. ElsieFour combines ideas of modern RC4 stream cipher, historical Playfair cipher and plaintext-dependent keystreams. It can be computed manually. Part 1 is a partly-known key challenge which provides the first 12 characters of the key.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2018-04-28 16:29
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#1) Achieved points (Global score) y-m-d - h:m:s

George (Theofanidis) 1200 (110784) 2018-10-06 20:53:41
You must be logged in to solve the challenge


Number Sequence — Part 10

[strauss-01] - 70 users already solved this challenge, 16 are working on it.
 
 
 

How many experience points does Thomas need to reach the 200th level of his new computer game?
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2018-04-18 16:56
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#70) Achieved points (Global score) y-m-d - h:m:s

Armin Krauss (argh) 200 (185115) 2018-04-18 18:25:13
Kurt Gebauer (Yokozuna) 200 (175433) 2018-04-18 20:22:55
H. Lautenschlager (helmi) 200 (32947) 2018-04-18 20:29:36
Viktor (Veselovský) 200 (153262) 2018-04-18 20:31:10
#5 Nofre Tete (noffi) 200 (21921) 2018-04-18 22:28:44
#6 Snake (snk) 200 (79889) 2018-04-19 10:02:11
#7 Lucio (lcalderonc) 150 (1251) 2018-04-19 19:24:03
#8 Dominik M. (Sgt. Pepper) 150 (97919) 2018-04-19 22:11:26
#9 S (Zyphe) 150 (10461) 2018-04-19 23:07:58
#10 D3d4lu5 (D3d4lu5) 133 (297709) 2018-04-20 18:28:23
#11 Luigi Castro Alvis (LuigiCastro21) 120 (2417) 2018-04-23 05:00:35
#12 E.T (Ertheb) 117 (81809) 2018-04-23 17:22:26
#13 Rainer Zufall (kiekuk) 113 (56786) 2018-04-25 23:01:20
#14 Robert (rm) 113 (56475) 2018-04-26 00:22:43
#15 nimroth (nimroth cynthor) 109 (6021) 2018-04-28 23:07:37
#16 Diego (DiegoRA) 109 (3697) 2018-04-29 04:34:37
#17 Diego Ucharima (Diego_Ucharima) 109 (2206) 2018-04-29 08:40:11
#18 Carlos (OzBlanco) 108 (3596) 2018-04-29 21:10:11
#19 Steve Vaillancourt (stvai2) 108 (15041) 2018-04-29 23:19:24
#20 George (Theofanidis) 103 (110784) 2018-05-27 17:04:16
#21 Danny Higgins (hamster147) 102 (34095) 2018-05-31 12:56:53
#22 Lasome (Lasome) 102 (203) 2018-05-31 19:42:31
#23 Ansehn (Rnabtd) 102 (203) 2018-05-31 19:50:50
#24 Andreas (reklavv) 102 (102) 2018-06-05 15:56:09
#25 j.h. (haegarq) 102 (15252) 2018-06-06 08:38:06
#26 Georgius Stolte (HazmatsFear) 102 (15671) 2018-06-06 20:55:45
#27 Alain Collignon (vexilla72) 102 (87833) 2018-06-07 16:49:46
#28 Kim H. S. (tenchijin) 102 (25468) 2018-06-07 22:01:45
#29 Nicolas (nicosPavlov) 102 (151166) 2018-06-10 05:55:54
#30 jack (jack_) 102 (303) 2018-06-18 16:58:32
#31 Random Dude (rnd) 101 (90929) 2018-07-07 05:49:00
#32 Em Doulgerakis (Greko) 101 (124033) 2018-07-26 17:18:32
#33 Hans Joachim Girulat (joregi) 101 (36279) 2018-07-27 15:41:49
#34 Karl Schutt (günter) 101 (41550) 2018-08-05 18:03:58
#35 Hughes (hughes) 101 (7925) 2018-08-06 08:13:07
#36 Julian (Lemmynator) 101 (16666) 2018-08-06 14:48:05
#37 Lane Williams (planetlane) 101 (23948) 2018-08-09 23:38:08
#38 mykallan (mikeA) 101 (2197) 2018-08-13 01:08:40
#39 Michael Möller (michaelm) 101 (175129) 2018-08-25 17:48:00
#40 A (2h873hcue) 101 (301) 2018-09-05 12:26:38
#41 Pavel Kessler (pavel) 101 (5096) 2018-09-24 23:22:06
#42 Jörg Schwarzwälder (secuso) 101 (2125) 2018-10-02 22:52:40
#43 kelalaka (kelalaka) 101 (417) 2018-10-07 13:15:50
#44 Javantea (Javantea) 101 (40816) 2018-10-10 03:40:25
#45 Luigi Tomelli (archstanton) 101 (108345) 2018-10-16 13:29:38
#46 Christian (chrisadmin) 101 (2019) 2018-10-17 19:52:58
#47 Mathijs Verbeek (QIXL) 101 (3096) 2018-10-17 21:07:59
#48 jusb3 (jusb3) 101 (2199) 2018-10-26 00:30:43
#49 Christian (gizmore) 101 (204) 2018-10-29 22:34:01
#50 Hans Peter (hanspeter) 100 (52256) 2018-11-08 18:38:36
#51 Johnatan (RazorBest) 100 (1105) 2018-12-17 12:20:28
#52 zuben c3 (zuben-c3) 100 (24853) 2018-12-17 19:05:08
#53 Elle (mermaidm0tel) 100 (200) 2018-12-21 12:48:39
#54 Kasia (kasia-tutej) 100 (53366) 2019-01-01 21:06:43
#55 Ronny (kadenbach) 100 (1000) 2019-01-06 01:49:20
#56 Michael (FoM) 100 (38953) 2019-01-12 02:36:00
#57 Piotr (lesnik7) 100 (8171) 2019-01-13 18:52:32
#58 Pierre Robier (tripleedged) 100 (5916) 2019-02-16 17:47:55
#59 Klaus (kumaus) 100 (21415) 2019-03-14 12:05:12
#60 Piyush Agarwal (Piyushgrwl) 100 (3493) 2019-03-20 23:26:41
#61 Joerg G. (SnifferMaster) 100 (18154) 2019-03-22 15:59:06
#62 Sebastian Slupina (Grandwizard) 100 (10866) 2019-04-04 12:10:14
#63 Darchicourt (Darki) 100 (3308) 2019-04-09 15:11:03
#64 Norbert Biermann (Norbert) 100 (45031) 2019-05-18 22:10:06
#65 Stephan (Stephje1978) 100 (26762) 2019-06-02 21:07:25
#66 Mike (RogueRamblers) 100 (26411) 2019-06-24 22:39:06
#67 david (sexton) 100 (2801) 2019-07-02 08:44:29
#68 gerdw (gerdw) 100 (28316) 2019-07-10 22:07:50
#69 Bart den Hartog (Bart13) 100 (139176) 2019-07-16 01:09:55
#70 Dr. Peter Uelkes (RandyWaterhouse) 100 (9990) 2019-07-27 18:02:56
You must be logged in to solve the challenge


The Vatican Challenge — Part 2

[megyesi-02] - 3 users already solved this challenge.
 
 
 

The Secret Archives of the Vatican keep a large collection of ciphertexts from papal correspondence. The keys of these manuscripts have been destroyed, or are kept elsewhere and been forgotten. Can you find out how to decipher the letter from March 14, 1625?
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2018-02-14 20:43
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#3) Achieved points (Global score) y-m-d - h:m:s

Norbert Biermann (Norbert) 2000 (45031) 2018-03-20 15:45:57
Thomas (Thomas4897) 1000 (16596) 2018-04-16 16:42:50
Tomokiyo (cryptiana) 1000 (1000) 2018-06-01 14:59:09
The solution for this challenge was made public on 2018-06-20, and thus it is not possible to get points for this challenge any more. However, you can still solve and enter a solution for this challenge. If you believe you have the solution, you can still write us an email.
You must be logged in to solve the challenge


The Vatican Challenge — Part 1

[megyesi-01] - 3 users already solved this challenge.
 
 
 

The Main Library of the Vatican owns some encrypted manuscripts, waiting for decryption. Can you find the solution to the letter from 1628?
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2018-02-14 20:36
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#3) Achieved points (Global score) y-m-d - h:m:s

Thomas (Thomas4897) 2000 (16596) 2018-03-12 15:00:33
Norbert Biermann (Norbert) 1000 (45031) 2018-03-20 14:59:36
Tomokiyo (cryptiana) 0 (1000) 2018-08-13 15:02:13
The solution for this challenge was made public on 2018-06-20, and thus it is not possible to get points for this challenge any more. However, you can still solve and enter a solution for this challenge. If you believe you have the solution, you can still write us an email.
You must be logged in to solve the challenge


The Einstein Enigma

[hiker-01] - 45 users already solved this challenge, 4 are working on it.
 
 
 

The hero of the book has to decode a manuscript — seven lines of it are here for you. These lines were encoded with a mixture of classic methods — anagrams, two position-dependent monoalphabetic substitutions and Atbash. Can you help him?
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2018-02-07 23:40
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#45) Achieved points (Global score) y-m-d - h:m:s

H. Lautenschlager (helmi) 2000 (32947) 2018-02-08 18:35:02
Kurt Gebauer (Yokozuna) 2000 (175433) 2018-02-08 20:23:50
Snake (snk) 2000 (79889) 2018-02-08 21:10:28
Alain Collignon (vexilla72) 1824 (87833) 2018-02-09 07:29:58
#5 Mir Dim (mir0soft) 1824 (72404) 2018-02-09 09:40:24
#6 Dominik M. (Sgt. Pepper) 1824 (97919) 2018-02-09 12:33:10
#7 Mihail (plexor) 1725 (16827) 2018-02-10 13:44:32
#8 Lane Williams (planetlane) 1660 (23948) 2018-02-11 04:56:48
#9 E.T (Ertheb) 1660 (81809) 2018-02-11 17:34:28
#10 Armin Krauss (argh) 1613 (185115) 2018-02-12 00:55:11
#11 Nicolas (nicosPavlov) 1613 (151166) 2018-02-12 03:48:24
#12 chris_3stones (3stones) 1613 (37759) 2018-02-12 20:31:25
#13 George (Theofanidis) 1613 (110784) 2018-02-12 20:34:04
#14 Marc (rcll0891) 1576 (24004) 2018-02-12 23:54:59
#15 Sebastian Slupina (Grandwizard) 1547 (10866) 2018-02-14 23:36:16
#16 Viktor (Veselovský) 1523 (153262) 2018-02-15 18:12:30
#17 Manu (manu87) 1502 (2979) 2018-02-16 09:14:05
#18 Rainer Zufall (kiekuk) 1414 (56786) 2018-02-23 21:36:11
#19 j.h. (haegarq) 1373 (15252) 2018-03-01 08:45:39
#20 Jhoana Reichert (15faustino) 1324 (1724) 2018-03-13 01:16:54
#21 Nofre Tete (noffi) 1324 (21921) 2018-03-13 19:04:33
#22 Norbert Biermann (Norbert) 1305 (45031) 2018-03-20 11:27:40
#23 Ignacio (Moebiusar) 1302 (7390) 2018-03-21 13:59:00
#24 D3d4lu5 (D3d4lu5) 1278 (297709) 2018-04-03 12:25:30
#25 Szabó Zoltán (szabo.z87) 1264 (55604) 2018-04-13 13:36:52
#26 Allisat (psychohasii) 1248 (4356) 2018-04-28 00:36:38
#27 Anna (ronja11) 1236 (4244) 2018-05-11 14:24:08
#28 Eric (ExAstris) 1224 (26990) 2018-05-28 02:56:23
#29 Manfred Wurm (Tschabobo) 1216 (8835) 2018-06-11 09:22:40
#30 Alain (Integral) 1210 (207924) 2018-06-24 10:58:21
#31 Em Doulgerakis (Greko) 1197 (124033) 2018-07-27 14:56:52
#32 Hans Joachim Girulat (joregi) 1197 (36279) 2018-07-27 19:49:03
#33 Danny Higgins (hamster147) 1190 (34095) 2018-08-18 22:44:30
#34 Michael Möller (michaelm) 1186 (175129) 2018-09-02 09:58:19
#35 Random Dude (rnd) 1185 (90929) 2018-09-03 06:05:00
#36 sarah b (silva) 1168 (23218) 2018-11-28 11:38:47
#37 Karl Schutt (günter) 1167 (41550) 2018-11-30 22:19:10
#38 Luigi Tomelli (archstanton) 1164 (108345) 2018-12-19 16:17:47
#39 zuben c3 (zuben-c3) 1162 (24853) 2019-01-05 16:04:02
#40 Bertolo (Bertolo) 1160 (7167) 2019-01-15 18:34:32
#41 Clemens (16dombrowski) 1153 (5136) 2019-03-13 19:42:18
#42 Alex (Meiny) 1153 (5136) 2019-03-13 20:00:00
#43 Eugene (lim0n) 1144 (47187) 2019-06-22 15:29:12
#44 Bart den Hartog (Bart13) 1142 (139176) 2019-07-16 03:33:56
#45 gerdw (gerdw) 1142 (28316) 2019-07-16 07:43:05
You must be logged in to solve the challenge


Advent Challenge — Part 3

[rotthaler-05] - 28 users already solved this challenge, 1 is working on it.
 
 
 

What do you do, if your father and your stepmother decide to communicate only encrypted? You tape-record the messages. But what do the two of them really talk about?
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2017-12-22 18:19
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#28) Achieved points (Global score) y-m-d - h:m:s

Viktor (Veselovský) 2000 (153262) 2017-12-22 19:30:50
Dominik M. (Sgt. Pepper) 2000 (97919) 2017-12-22 19:31:05
Alain Collignon (vexilla72) 2000 (87833) 2017-12-22 19:34:58
Kurt Gebauer (Yokozuna) 2000 (175433) 2017-12-22 19:43:48
#5 D3d4lu5 (D3d4lu5) 2000 (297709) 2017-12-22 19:44:19
#6 H. Lautenschlager (helmi) 2000 (32947) 2017-12-22 21:36:12
#7 Snake (snk) 2000 (79889) 2017-12-22 21:41:17
#8 Mir Dim (mir0soft) 2000 (72404) 2017-12-23 08:43:02
#9 S Combes (jerva) 2000 (99132) 2017-12-23 10:37:20
#10 Armin Krauss (argh) 1824 (185115) 2017-12-23 21:23:45
#11 Em Doulgerakis (Greko) 1824 (124033) 2017-12-24 12:12:44
#12 Rainer Zufall (kiekuk) 1576 (56786) 2017-12-28 16:21:44
#13 Ronja (Ronja) 1576 (3715) 2017-12-28 17:00:41
#14 E.T (Ertheb) 1456 (81809) 2018-01-03 17:42:31
#15 Nicolas (nicosPavlov) 1444 (151166) 2018-01-04 07:56:07
#16 Martin (martinbucher) 1423 (27363) 2018-01-06 11:17:17
#17 Manu (manu87) 1276 (2979) 2018-02-16 12:32:20
#18 Szabó Zoltán (szabo.z87) 1226 (55604) 2018-04-09 15:31:39
#19 Alain (Integral) 1192 (207924) 2018-06-24 23:40:15
#20 George (Theofanidis) 1190 (110784) 2018-07-02 22:33:10
#21 Random Dude (rnd) 1169 (90929) 2018-10-06 14:31:34
#22 Hans Peter (hanspeter) 1163 (52256) 2018-11-08 18:58:36
#23 Luigi Tomelli (archstanton) 1158 (108345) 2018-12-18 09:34:04
#24 Kasia (kasia-tutej) 1156 (53366) 2019-01-01 23:38:24
#25 zuben c3 (zuben-c3) 1156 (24853) 2019-01-03 20:45:49
#26 Eugene (lim0n) 1145 (47187) 2019-04-20 21:09:23
#27 Lane Williams (planetlane) 1144 (23948) 2019-05-04 03:53:34
#28 Bart den Hartog (Bart13) 1138 (139176) 2019-07-17 03:37:43
You must be logged in to solve the challenge


Advent Challenge — Part 4

[rotthaler-06] - 29 users already solved this challenge.
 
 
 

Decrypting a Christmas carol to help children in need? It's not that easy, if you don't know much about cryptography. Can you help Jacob and the children?
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2017-12-21 17:06
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#29) Achieved points (Global score) y-m-d - h:m:s

Viktor (Veselovský) 2000 (153262) 2017-12-21 18:47:44
Michael Möller (michaelm) 2000 (175129) 2017-12-21 19:14:17
Kurt Gebauer (Yokozuna) 2000 (175433) 2017-12-21 19:56:48
S Combes (jerva) 2000 (99132) 2017-12-21 22:27:59
#5 H. Lautenschlager (helmi) 2000 (32947) 2017-12-21 23:30:50
#6 Dominik M. (Sgt. Pepper) 2000 (97919) 2017-12-22 01:43:42
#7 Alain Collignon (vexilla72) 2000 (87833) 2017-12-22 08:16:18
#8 D3d4lu5 (D3d4lu5) 1824 (297709) 2017-12-22 20:43:46
#9 Ronja (Ronja) 1824 (3715) 2017-12-22 22:59:42
#10 J-L Morel (Rossignol) 1824 (29425) 2017-12-23 09:15:19
#11 Mir Dim (mir0soft) 1824 (72404) 2017-12-23 11:56:52
#12 Armin Krauss (argh) 1725 (185115) 2017-12-23 23:50:55
#13 Rainer Zufall (kiekuk) 1547 (56786) 2017-12-28 14:16:36
#14 Snake (snk) 1502 (79889) 2017-12-29 21:06:52
#15 Nicolas (nicosPavlov) 1433 (151166) 2018-01-04 07:57:46
#16 E.T (Ertheb) 1423 (81809) 2018-01-04 18:37:28
#17 George (Theofanidis) 1302 (110784) 2018-01-31 18:24:56
#18 Nofre Tete (noffi) 1229 (21921) 2018-04-02 11:48:23
#19 Szabó Zoltán (szabo.z87) 1223 (55604) 2018-04-12 12:01:01
#20 Alain (Integral) 1192 (207924) 2018-06-24 18:18:23
#21 Eric (ExAstris) 1192 (26990) 2018-06-24 21:14:31
#22 Em Doulgerakis (Greko) 1181 (124033) 2018-08-02 16:48:27
#23 Hans Joachim Girulat (joregi) 1178 (36279) 2018-08-18 18:12:23
#24 Random Dude (rnd) 1168 (90929) 2018-10-06 04:22:09
#25 Luigi Tomelli (archstanton) 1158 (108345) 2018-12-18 14:22:13
#26 Kasia (kasia-tutej) 1156 (53366) 2019-01-01 23:18:27
#27 Lane Williams (planetlane) 1149 (23948) 2019-03-08 02:58:17
#28 Eugene (lim0n) 1145 (47187) 2019-04-21 12:39:25
#29 Bart den Hartog (Bart13) 1138 (139176) 2019-07-17 17:45:13
You must be logged in to solve the challenge


AES ECB Wrong Encoding

[miro-01] - 14 users already solved this challenge.
 
 
 

Do you believe that AES is easy to break because of a wrong encoding? Try it yourself...
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2017-12-16 19:21
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#14) Achieved points (Global score) y-m-d - h:m:s

Viktor (Veselovský) 2000 (153262) 2017-12-17 18:10:22
Snake (snk) 1824 (79889) 2017-12-17 21:48:12
Armin Krauss (argh) 1824 (185115) 2017-12-17 23:34:09
Kurt Gebauer (Yokozuna) 1824 (175433) 2017-12-18 13:16:26
#5 Kasia (kasia-tutej) 1613 (53366) 2017-12-21 16:40:57
#6 D3d4lu5 (D3d4lu5) 1523 (297709) 2017-12-24 04:30:18
#7 Dominik M. (Sgt. Pepper) 1523 (97919) 2017-12-24 17:46:24
#8 H. Lautenschlager (helmi) 1423 (32947) 2017-12-31 18:15:33
#9 a (agigi) 1192 (1192) 2018-06-18 14:46:05
#10 Oprea Bogdan (bogdan.oprea) 1192 (1192) 2018-06-18 14:48:57
#11 Teodoru catalin Andrei (teodoru) 1192 (5698) 2018-06-20 15:55:25
#12 Alain (Integral) 1184 (207924) 2018-07-19 09:43:49
#13 Em Doulgerakis (Greko) 1180 (124033) 2018-08-03 11:01:50
#14 Eugene (lim0n) 1143 (47187) 2019-05-12 06:23:52
You must be logged in to solve the challenge


Advent-Challenge — Part 2

[rotthaler-04] - 32 users already solved this challenge, 2 are working on it.
 
 
 

Mike would like to belong to the cryptographers. Can you help him to find out their meeting point at the Christmas market?
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2017-12-16 19:20
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#32) Achieved points (Global score) y-m-d - h:m:s

Kurt Gebauer (Yokozuna) 2000 (175433) 2017-12-17 00:20:59
Dominik M. (Sgt. Pepper) 2000 (97919) 2017-12-17 06:30:45
Alain Collignon (vexilla72) 2000 (87833) 2017-12-17 11:20:39
Viktor (Veselovský) 2000 (153262) 2017-12-17 12:30:11
#5 Snake (snk) 2000 (79889) 2017-12-17 13:08:04
#6 HolgerK (HolgerK) 1824 (25776) 2017-12-17 21:40:33
#7 Armin Krauss (argh) 1824 (185115) 2017-12-17 23:35:23
#8 H. Lautenschlager (helmi) 1824 (32947) 2017-12-18 16:07:50
#9 Em Doulgerakis (Greko) 1824 (124033) 2017-12-18 16:55:03
#10 Rainer Zufall (kiekuk) 1725 (56786) 2017-12-19 18:36:20
#11 Mir Dim (mir0soft) 1660 (72404) 2017-12-20 14:38:38
#12 J-L Morel (Rossignol) 1660 (29425) 2017-12-20 15:48:19
#13 Kasia (kasia-tutej) 1613 (53366) 2017-12-21 14:27:23
#14 Martin (martinbucher) 1613 (27363) 2017-12-21 16:34:55
#15 D3d4lu5 (D3d4lu5) 1576 (297709) 2017-12-22 14:54:56
#16 chris_3stones (3stones) 1469 (37759) 2017-12-26 20:14:01
#17 George (Theofanidis) 1469 (110784) 2017-12-26 20:17:25
#18 T (Wagner) 1433 (16988) 2017-12-30 08:51:23
#19 Nicolas (nicosPavlov) 1414 (151166) 2018-01-01 12:24:40
#20 E.T (Ertheb) 1406 (81809) 2018-01-02 18:16:51
#21 j.h. (haegarq) 1357 (15252) 2018-01-10 11:36:25
#22 Tristan1473 (Tristan1473) 1260 (18914) 2018-02-22 09:28:54
#23 Thomas Gonda (TomG) 1236 (36291) 2018-03-19 14:50:31
#24 Szabó Zoltán (szabo.z87) 1222 (55604) 2018-04-09 12:22:19
#25 Silvia Kortmann (mikinsget) 1203 (10104) 2018-05-17 01:25:36
#26 Hans Joachim Girulat (joregi) 1177 (36279) 2018-08-16 23:28:02
#27 Random Dude (rnd) 1168 (90929) 2018-10-04 15:41:41
#28 Hans Peter (hanspeter) 1162 (52256) 2018-11-08 18:57:23
#29 Luigi Tomelli (archstanton) 1157 (108345) 2018-12-17 18:06:55
#30 zuben c3 (zuben-c3) 1155 (24853) 2019-01-02 12:17:53
#31 Eugene (lim0n) 1144 (47187) 2019-04-20 21:06:17
#32 Bart den Hartog (Bart13) 1138 (139176) 2019-07-17 02:45:34
You must be logged in to solve the challenge


Advent-Challenge — Part 1

[rotthaler-03] - 286 users already solved this challenge, 13 are working on it.
 
 
 

Little Anna has forgotten how to decrypt her ciphertext. Can you come up to her pre-Christmas wish?
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2017-12-08 19:24
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#286) Achieved points (Global score) y-m-d - h:m:s

Kurt Gebauer (Yokozuna) 200 (175433) 2017-12-08 20:26:00
Michael Möller (michaelm) 200 (175129) 2017-12-08 20:27:32
HolgerK (HolgerK) 200 (25776) 2017-12-08 20:51:53
H. Lautenschlager (helmi) 200 (32947) 2017-12-08 21:06:49
#5 Qiu (Qiu) 200 (2099) 2017-12-08 22:08:03
#6 Viktor (Veselovský) 200 (153262) 2017-12-08 22:36:15
#7 Robert (rm) 200 (56475) 2017-12-09 00:52:38
#8 D3d4lu5 (D3d4lu5) 200 (297709) 2017-12-09 03:01:45
#9 Qinncade (Qinncade) 150 (2610) 2017-12-09 23:15:33
#10 Tim Fink (Magellan) 150 (4876) 2017-12-10 07:27:05
#11 Alain Collignon (vexilla72) 150 (87833) 2017-12-10 09:25:22
#12 Snake (snk) 150 (79889) 2017-12-10 14:33:18
#13 Armin Krauss (argh) 150 (185115) 2017-12-10 16:51:04
#14 Bernhard Gruber (bgr) 133 (22889) 2017-12-11 09:51:50
#15 Georgius Stolte (HazmatsFear) 133 (15671) 2017-12-11 11:10:16
#16 Andreas Frerichs (Ossili) 133 (33266) 2017-12-11 14:07:20
#17 Kai Fischell (MrFlector) 133 (1433) 2017-12-11 14:39:01
#18 Rainer Zufall (kiekuk) 133 (56786) 2017-12-11 14:50:55
#19 Em Doulgerakis (Greko) 133 (124033) 2017-12-11 15:18:52
#20 Dominik M. (Sgt. Pepper) 133 (97919) 2017-12-11 16:23:39
#21 Marc (rcll0891) 133 (24004) 2017-12-11 16:29:47
#22 Wieland (wisch) 133 (6633) 2017-12-11 17:09:24
#23 satz (rbsatish) 125 (125) 2017-12-12 10:06:58
#24 Bart den Hartog (Bart13) 117 (139176) 2017-12-14 19:02:22
#25 E.T (Ertheb) 114 (81809) 2017-12-15 16:27:23
#26 Mir Dim (mir0soft) 113 (72404) 2017-12-16 00:33:24
#27 Ronja (Ronja) 113 (3715) 2017-12-16 11:58:40
#28 Fabian (XP-72) 111 (3707) 2017-12-17 19:19:38
#29 Lane Williams (planetlane) 110 (23948) 2017-12-17 22:27:26
#30 J-L Morel (Rossignol) 109 (29425) 2017-12-19 11:02:25
#31 Holger (holger) 109 (812) 2017-12-19 11:20:07
#32 Anibal Kürekci (ak187) 109 (1076) 2017-12-19 12:42:02
#33 Martin (martinbucher) 108 (27363) 2017-12-20 10:10:00
#34 John Reade (AconitumFerox) 108 (108) 2017-12-20 14:49:45
#35 KW (qwer*) 107 (13963) 2017-12-21 19:46:59
#36 George (Theofanidis) 107 (110784) 2017-12-22 18:26:58
#37 Hanspeter (hapela) 107 (1007) 2017-12-23 18:12:33
#38 Dusan Djuric (flapjack) 106 (2104) 2017-12-23 23:13:46
#39 j.h. (haegarq) 106 (15252) 2017-12-26 13:20:04
#40 chris_3stones (3stones) 105 (37759) 2017-12-26 20:15:55
#41 Gu Drun (Shirkano) 105 (105) 2017-12-28 12:41:35
#42 T (Wagner) 105 (16988) 2017-12-29 08:28:22
#43 Urs Gysler (Sansibar) 105 (3269) 2017-12-30 19:17:14
#44 Alex (Faustino50) 104 (104) 2017-12-31 01:55:44
#45 Maximilian (Xian) 104 (604) 2017-12-31 11:20:06
#46 Samuel (Samusicus) 104 (2203) 2018-01-03 15:09:12
#47 Carsten Caliebe (CAKA100) 104 (306) 2018-01-03 17:31:45
#48 Gideon (gidl0r) 103 (103) 2018-01-06 00:56:48
#49 Fr3d (Logarn) 103 (103) 2018-01-06 10:26:17
#50 Lukas Leuenberger (LukiLeu) 103 (103) 2018-01-06 18:31:45
#51 Kevin (Kroev) 103 (103) 2018-01-09 00:26:18
#52 swarmspider (swarmspider) 103 (4528) 2018-01-11 09:50:24
#53 Pen (justtesting) 103 (1697) 2018-01-12 13:31:47
#54 Elias (EliasTerm) 103 (103) 2018-01-13 02:40:06
#55 Nicolas (nicosPavlov) 103 (151166) 2018-01-13 11:16:36
#56 Nofre Tete (noffi) 103 (21921) 2018-01-13 13:07:29
#57 George Lasry (george4096) 103 (299488) 2018-01-13 18:40:16
#58 Ines (bufo01) 103 (4515) 2018-01-14 15:35:10
#59 The Brain 83 (thebrain983) 103 (1895) 2018-01-14 22:57:43
#60 Goldfingerz (goldfingerz) 103 (603) 2018-01-15 20:00:14
#61 Big Guy (bsn) 103 (103) 2018-01-16 16:52:26
#62 Christof Kleber (Loki) 103 (6051) 2018-01-17 11:00:13
#63 freak_out (freak_out) 103 (803) 2018-01-17 18:46:29
#64 Quasario (Quantum) 102 (102) 2018-01-19 16:00:40
#65 john doe (0x0abc) 102 (102) 2018-01-21 21:10:54
#66 lzn (lzn) 102 (102) 2018-01-22 22:57:31
#67 Mariana Pereira (Profmari) 102 (102) 2018-01-23 21:34:52
#68 S (Zyphe) 102 (10461) 2018-01-25 17:41:30
#69 Dusan (xxdradus) 102 (40236) 2018-01-26 12:41:12
#70 Andreas Zipse (zippi0815) 102 (3295) 2018-01-27 20:51:55
#71 Valentina Schunk (vale.schunk) 102 (102) 2018-01-29 17:16:10
#72 Jörg Schwarzwälder (secuso) 102 (2125) 2018-02-01 14:45:04
#73 Justin Huber (Kendyy) 102 (303) 2018-02-01 17:35:31
#74 Marc Schneider (schiiins) 102 (302) 2018-02-01 20:45:57
#75 tom (tomer766) 102 (102) 2018-02-03 10:44:26
#76 Sebastian Slupina (Grandwizard) 102 (10866) 2018-02-08 12:33:26
#77 Bastian (KorbenU19) 102 (102) 2018-02-11 10:54:47
#78 Klaus Kolba (Kolbone) 101 (3107) 2018-02-12 22:55:42
#79 Manu (manu87) 101 (2979) 2018-02-14 11:49:33
#80 Jack2k (Jack2k) 101 (101) 2018-02-18 17:20:13
#81 D (masterdot) 101 (201) 2018-02-19 14:18:49
#82 Ulrich Dorobeck (Papageno) 101 (3827) 2018-02-19 16:59:06
#83 Lena (littleYoung) 101 (101) 2018-02-20 16:34:49
#84 Tristan1473 (Tristan1473) 101 (18914) 2018-02-21 19:09:45
#85 khuslen (khuslen) 101 (201) 2018-02-24 16:43:08
#86 Danny Higgins (hamster147) 101 (34095) 2018-02-27 12:14:15
#87 Lennard (knubbelknospe) 101 (101) 2018-02-27 15:59:41
#88 David (Zajin) 101 (1598) 2018-02-27 19:48:52
#89 BENJAMIN (whatupyo02) 101 (201) 2018-02-27 21:48:00
#90 Kurkowski (ThomasK) 101 (2327) 2018-03-01 09:10:07
#91 JoGo (JoGo) 101 (11686) 2018-03-01 17:35:00
#92 Esura (Esura) 101 (101) 2018-03-01 18:22:21
#93 Tom Tox (tox) 101 (17708) 2018-03-03 21:56:58
#94 Bertold (bk) 101 (9673) 2018-03-04 14:09:16
#95 Nizar Rahman (rmn) 101 (201) 2018-03-05 15:34:24
#96 Julian (Lemmynator) 101 (16666) 2018-03-05 16:38:01
#97 Mau_Kappel (Mau_Kappel) 101 (4496) 2018-03-05 22:04:00
#98 ich (whoma) 101 (2299) 2018-03-06 18:51:29
#99 Doug (Cryptographer88) 101 (101) 2018-03-09 22:20:06
#100 Andreas Kammerer (daxq) 101 (201) 2018-03-10 11:00:09
#101 Tiago Rodeghiero (Tiago Rodeghiero) 101 (901) 2018-03-11 17:07:49
#102 Bruno Garcia (bgarcia) 101 (101) 2018-03-12 12:08:52
#103 Lucas (Beastwood) 101 (1999) 2018-03-13 14:17:20
#104 Selma Metin (seltuna) 101 (902) 2018-03-14 14:47:50
#105 Hector (ChevChelios) 101 (1599) 2018-03-15 23:12:18
#106 Thomas Gonda (TomG) 101 (36291) 2018-03-16 08:08:53
#107 Karl Schutt (günter) 101 (41550) 2018-03-17 05:57:20
#108 Fernando Sacilotto (Sacilotto) 101 (1292) 2018-03-17 22:07:33
#109 Norbert Biermann (Norbert) 101 (45031) 2018-03-20 12:48:31
#110 Kelsey Bailey (honeybteach) 101 (301) 2018-03-20 14:47:29
#111 Tom (quering) 101 (101) 2018-03-22 14:37:19
#112 Jrox (jrox) 101 (601) 2018-03-23 00:43:52
#113 Lucas de Vargas (vargas) 101 (301) 2018-03-24 01:31:39
#114 Ignacio (Moebiusar) 101 (7390) 2018-03-24 15:35:26
#115 Matheus (MrMath) 101 (301) 2018-03-24 22:40:06
#116 Thomas (Thomas4897) 101 (16596) 2018-03-28 18:18:24
#117 Luciano Ignaczak (ignaczak) 101 (3390) 2018-03-30 05:00:09
#118 Lara Riegelhofer (larrow_sparrow) 101 (2798) 2018-04-01 17:06:32
#119 resthiana (Pejuang_Surga) 101 (101) 2018-04-02 15:25:53
#120 Szabó Zoltán (szabo.z87) 101 (55604) 2018-04-03 11:23:08
#121 Martina (BonoV) 101 (3017) 2018-04-03 16:09:24
#122 v3ct0r (V3ct0r_) 101 (1291) 2018-04-05 14:28:48
#123 Nimsoo Sun (Nimsoosun) 101 (2518) 2018-04-05 21:38:13
#124 Benjamin (200611736) 101 (10186) 2018-04-07 23:12:26
#125 Alexander Hamling (hamling) 101 (201) 2018-04-08 10:55:43
#126 Steffen (stmue) 101 (2911) 2018-04-13 08:53:16
#127 Jatin (jatinluthra14) 101 (101) 2018-04-17 13:09:25
#128 Aracelly Tapia Torrealva (yllecara2018) 101 (101) 2018-04-26 02:31:18
#129 btALuie9jr9K (btALuie9jr9K) 101 (101) 2018-04-26 14:25:07
#130 Steve Vaillancourt (stvai2) 101 (15041) 2018-04-29 04:27:52
#131 Christian Inci (ch100) 101 (9253) 2018-05-02 00:50:16
#132 micaman (micaman) 101 (4634) 2018-05-11 16:31:41
#133 gabard (higgins29200) 101 (201) 2018-05-13 20:20:33
#134 Eric (ExAstris) 101 (26990) 2018-05-19 18:18:14
#135 drizak (drizak) 101 (101) 2018-05-29 00:52:42
#136 Ansehn (Rnabtd) 101 (203) 2018-05-31 20:04:57
#137 Lasome (Lasome) 101 (203) 2018-05-31 20:05:10
#138 Chirag Bapat (bapatchirag) 101 (201) 2018-06-03 10:12:15
#139 Plaxy Moreover (plaxy) 101 (101) 2018-06-04 12:03:33
#140 sarah b (silva) 101 (23218) 2018-06-05 09:22:46
#141 Kim H. S. (tenchijin) 101 (25468) 2018-06-07 22:31:00
#142 Fedilia (Fedilia) 101 (4489) 2018-06-08 17:37:38
#143 Yasir Javed (kianiyasir) 101 (101) 2018-06-09 03:48:56
#144 Christophe BORELLY (cb34) 101 (12358) 2018-06-09 20:05:09
#145 Leu (shiftleft) 101 (101) 2018-06-10 15:38:36
#146 Alexander Watson (awatson) 101 (2098) 2018-06-11 18:58:41
#147 Peter (Garnet) 101 (14234) 2018-06-14 20:30:51
#148 masam (jimboo) 101 (18687) 2018-06-14 23:40:04
#149 jack (jack_) 101 (303) 2018-06-18 16:20:33
#150 Max (Max_04) 101 (101) 2018-06-20 23:27:48
#151 Alain (Integral) 101 (207924) 2018-06-23 11:43:20
#152 Mosoiu (bobocea) 101 (101) 2018-06-23 11:44:08
#153 josh (talos) 101 (401) 2018-06-23 17:56:23
#154 Simon Kirchner (Twistios) 101 (3088) 2018-06-24 12:39:34
#155 Random Dude (rnd) 101 (90929) 2018-06-24 20:21:40
#156 Jan Knap (maddoxik) 100 (2458) 2018-06-28 22:14:41
#157 Raudah (Sandouk) 100 (301) 2018-06-30 01:13:27
#158 E41514019 (E41514019) 100 (2885) 2018-07-04 03:03:01
#159 wff1315 (wff) 100 (1789) 2018-07-04 03:05:03
#160 E41514015 (E41514015) 100 (2985) 2018-07-04 03:07:42
#161 E41514057 (E41514057) 100 (1796) 2018-07-04 03:40:49
#162 YKJ (E41514070) 100 (1896) 2018-07-04 04:04:09
#163 E41514023 (E41514023) 100 (3967) 2018-07-04 04:15:14
#164 E41514009 (E41514009) 100 (1000) 2018-07-04 04:21:49
#165 胡俊杰 (二十六) 100 (500) 2018-07-04 04:51:01
#166 V3 (kokoiuem18) 100 (200) 2018-07-04 11:20:54
#167 Michael (Fegoras) 100 (200) 2018-07-08 18:30:12
#168 adi (adi) 100 (100) 2018-07-11 21:23:16
#169 John (helpau) 100 (200) 2018-07-13 15:04:47
#170 João Vaz Martins (Awakening Star) 100 (4561) 2018-07-15 07:27:46
#171 Mihail (plexor) 100 (16827) 2018-07-16 22:09:02
#172 Matthias Frank (mfp) 100 (600) 2018-07-19 12:59:26
#173 Ionut (jonnyenglish) 100 (600) 2018-07-19 20:36:58
#174 Boris (netcom) 100 (100) 2018-07-22 14:50:07
#175 D (hakier) 100 (100) 2018-07-24 12:27:51
#176 Hans Joachim Girulat (joregi) 100 (36279) 2018-07-27 14:02:24
#177 Steve (Samacian) 100 (23804) 2018-08-02 06:25:31
#178 Verocs (koromvirag) 100 (433) 2018-08-02 11:18:42
#179 Hughes (hughes) 100 (7925) 2018-08-06 08:39:49
#180 Filippe Guerreiro Carvalho (filippegc) 100 (800) 2018-08-10 06:12:52
#181 Gustavo Sauer (gsauer) 100 (100) 2018-08-12 00:43:54
#182 Arrob (Arrob) 100 (100) 2018-08-14 12:23:10
#183 Laís Titoni (ltc) 100 (400) 2018-08-16 01:06:31
#184 Leonardo (leojaardim) 100 (2586) 2018-08-16 17:52:03
#185 Vlatiha Romanova (Vlatiha) 100 (10323) 2018-08-17 08:29:37
#186 Andrei Gasparovici (fullofvim) 100 (1861) 2018-08-17 20:07:20
#187 Lutz Sittinger (Kryptolutz) 100 (1802) 2018-08-19 10:52:35
#188 Mateus (Mateus de Freitas) 100 (400) 2018-08-20 01:39:04
#189 Ryan J Henry (Poxinomy) 100 (400) 2018-08-30 18:47:47
#190 HowarthStudios (HowarthStudios) 100 (3596) 2018-09-02 00:53:20
#191 Jennifer (jennipher) 100 (500) 2018-09-02 06:46:33
#192 A (2h873hcue) 100 (301) 2018-09-05 06:23:12
#193 Rahm (rmartins) 100 (1996) 2018-09-06 18:08:07
#194 Thiago Araujo Pereira (thiagoap) 100 (701) 2018-09-06 20:41:30
#195 med (med1) 100 (100) 2018-09-08 21:31:50
#196 Giulia (misteryaddicted) 100 (100) 2018-09-09 15:53:02
#197 Andy Wood (Woody) 100 (300) 2018-09-12 09:43:45
#198 Germano (German) 100 (400) 2018-09-12 18:51:00
#199 Imam Uasa (Merricx) 100 (9188) 2018-09-13 13:48:34
#200 Simon (¡Simon!) 100 (100) 2018-09-20 09:35:40
#201 Dodo (Dodo) 100 (2335) 2018-09-23 21:13:44
#202 Ralf (Infinitesimalpartikel) 100 (100) 2018-09-25 14:25:06
#203 Vinicius Moura (vpmoura) 100 (300) 2018-09-28 01:52:01
#204 Javantea (Javantea) 100 (40816) 2018-10-08 03:07:32
#205 Arbacle Clemens (arbacle) 100 (2502) 2018-10-12 22:11:32
#206 Koch (bbsldinflk) 100 (1389) 2018-10-15 23:29:51
#207 Mathijs Verbeek (QIXL) 100 (3096) 2018-10-17 17:46:04
#208 simone (xseris) 100 (8632) 2018-10-20 12:13:45
#209 Ne0Lux-C1Ph3r (Ne0Lux-C1Ph3r) 100 (800) 2018-10-27 04:53:47
#210 _o_ (_o_) 100 (1000) 2018-10-27 11:15:54
#211 clyto (clytorock) 100 (3195) 2018-11-03 14:55:17
#212 Cee Jae (vnm666) 100 (300) 2018-11-06 08:19:38
#213 Hans Peter (hanspeter) 100 (52256) 2018-11-08 18:41:35
#214 mglarragan (mglarragan) 100 (2091) 2018-11-11 10:08:57
#215 madness (madness) 100 (15407) 2018-11-15 02:40:25
#216 Sergej Schalew (CryptoSolver) 100 (600) 2018-11-20 20:34:33
#217 Joerg G. (SnifferMaster) 100 (18154) 2018-11-23 10:20:03
#218 Pierre Robier (tripleedged) 100 (5916) 2018-11-24 20:41:42
#219 steven (steven18) 100 (3091) 2018-11-25 14:04:45
#220 cipherbox (cipherbox) 100 (100) 2018-11-25 20:00:24
#221 Fernando karl (Karl) 100 (300) 2018-11-26 11:53:41
#222 Dario Moré (AUltraPotato) 100 (100) 2018-12-04 12:19:59
#223 t (Stark) 100 (100) 2018-12-04 20:32:37
#224 Clemens (16dombrowski) 100 (5136) 2018-12-15 14:18:57
#225 Luigi Tomelli (archstanton) 100 (108345) 2018-12-16 11:05:11
#226 Johnatan (RazorBest) 100 (1105) 2018-12-17 12:40:57
#227 Lorenzo (lorenzruskov) 100 (100) 2018-12-18 17:01:21
#228 Alex (Meiny) 100 (5136) 2018-12-18 20:58:21
#229 zuben c3 (zuben-c3) 100 (24853) 2018-12-20 16:06:41
#230 Elle (mermaidm0tel) 100 (200) 2018-12-21 11:59:09
#231 fm92 (fm92) 100 (601) 2018-12-24 12:28:02
#232 Bertolo (Bertolo) 100 (7167) 2018-12-24 19:38:08
#233 Dev Kalra (0__0) 100 (1490) 2018-12-25 11:21:24
#234 Brandon Z (laroof) 100 (200) 2018-12-27 00:06:20
#235 Ein-beispiel (Ein-beispiel) 100 (301) 2018-12-30 22:40:23
#236 Alan Turing (alan.turing) 100 (100) 2018-12-31 18:03:20
#237 jürgen (grmla) 100 (1794) 2019-01-04 10:02:51
#238 Michael (FoM) 100 (38953) 2019-01-06 00:42:08
#239 Kasia (kasia-tutej) 100 (53366) 2019-01-06 18:36:22
#240 Piotr (lesnik7) 100 (8171) 2019-01-11 13:38:38
#241 Lars Prepens (lprepens) 100 (200) 2019-01-31 07:11:33
#242 David (Fokus_1_U) 100 (200) 2019-01-31 19:08:05
#243 whitecowboy (whitecowboy) 100 (7446) 2019-02-05 18:20:52
#244 Kevin Weber (ThunderArmy) 100 (7783) 2019-02-11 16:47:13
#245 Felix Seifried (FS) 100 (500) 2019-02-20 14:45:11
#246 LoneWolf219 (LoneWolf219) 100 (12795) 2019-02-23 04:51:40
#247 Oliver H (AlfheriH) 100 (804) 2019-02-23 15:14:14
#248 Lia (Lia) 100 (6855) 2019-03-05 22:19:49
#249 Tom GS (gousheng) 100 (4368) 2019-03-08 08:22:29
#250 E41614056 (E41614056) 100 (4062) 2019-03-08 13:56:54
#251 Mike (RogueRamblers) 100 (26411) 2019-03-12 01:17:18
#252 Klaus (kumaus) 100 (21415) 2019-03-14 09:42:14
#253 Nicole (Sarezki) 100 (100) 2019-03-20 14:31:06
#254 Tom (toomderbaumarkt) 100 (600) 2019-03-20 15:00:42
#255 Piyush Agarwal (Piyushgrwl) 100 (3493) 2019-03-20 23:43:58
#256 Jennifer White (Dusty) 100 (501) 2019-03-25 12:26:31
#257 Gabriel Sippel (Sippel) 100 (300) 2019-03-25 18:40:05
#258 Jurian (Jurian95) 100 (2793) 2019-03-30 16:47:10
#259 Darchicourt (Darki) 100 (3308) 2019-04-09 16:33:34
#260 Christian (MarquisDeSud) 100 (7848) 2019-04-11 10:03:58
#261 Eugene (lim0n) 100 (47187) 2019-04-12 15:07:29
#262 Ralf Stephan (rwst) 100 (25229) 2019-04-16 07:50:01
#263 Kame Kaze (kamekazeman) 100 (301) 2019-04-19 00:26:07
#264 r karoly (r_karoly) 100 (4078) 2019-04-30 13:56:18
#265 Gabriel (GMG2022) 100 (300) 2019-05-13 12:06:16
#266 Jeff (Fountain) 100 (8788) 2019-05-25 23:01:30
#267 Mark Bedaywi (Supermac30) 100 (200) 2019-05-27 00:16:28
#268 Aeon (dokyriak) 100 (4081) 2019-05-27 14:43:57
#269 Manfred (katatonius) 100 (2394) 2019-05-29 12:35:49
#270 ENOENT (ENOENT) 100 (13478) 2019-05-31 15:12:46
#271 Stephan (Stephje1978) 100 (26762) 2019-06-02 22:47:53
#272 Simon Hemmerich (simhem) 100 (3779) 2019-06-10 16:23:45
#273 Ryan (Ascendingfox) 100 (400) 2019-06-27 10:46:33
#274 Anna (Timimim) 100 (1892) 2019-06-28 19:36:03
#275 david (sexton) 100 (2801) 2019-07-02 12:17:59
#276 yult (yult) 100 (12185) 2019-07-05 20:09:59
#277 gerdw (gerdw) 100 (28316) 2019-07-11 18:06:36
#278 ajg (ludimus) 100 (11914) 2019-07-15 22:45:36
#279 Egon Hamburger (Seehase) 100 (3746) 2019-07-17 17:20:56
#280 partamier (yann) 100 (5635) 2019-07-23 09:52:07
#281 Erik (Erox) 100 (26141) 2019-07-28 12:36:38
#282 Igor (Doring) 100 (800) 2019-08-12 23:12:27
#283 João Souza (jahjoao) 100 (100) 2019-08-20 02:24:55
#284 Gustavo Staudt (gustaudtklering) 100 (400) 2019-08-23 00:44:47
#285 Denilson (denilson) 100 (800) 2019-08-23 01:45:17
#286 Eduardo de Oliveira (edulycan) 100 (700) 2019-08-23 17:52:07
You must be logged in to solve the challenge


Number Sequence — Part 9

[quantum-01] - 67 users already solved this challenge, 50 are working on it.
 
 
 

Are you able to crack the password of Radomil and find the missing 5 digits?
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2017-11-16 17:43
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#67) Achieved points (Global score) y-m-d - h:m:s

nimroth (nimroth cynthor) 200 (6021) 2017-11-16 19:39:34
H. Lautenschlager (helmi) 200 (32947) 2017-11-16 22:27:42
Kurt Gebauer (Yokozuna) 200 (175433) 2017-11-16 23:03:55
Armin Krauss (argh) 200 (185115) 2017-11-17 00:08:50
#5 Dominik M. (Sgt. Pepper) 200 (97919) 2017-11-17 12:20:28
#6 Viktor (Veselovský) 200 (153262) 2017-11-17 14:41:25
#7 D3d4lu5 (D3d4lu5) 150 (297709) 2017-11-18 07:33:32
#8 Robert (rm) 150 (56475) 2017-11-18 16:55:29
#9 S (Zyphe) 133 (10461) 2017-11-19 17:22:18
#10 Bernhard Gruber (bgr) 125 (22889) 2017-11-20 17:27:33
#11 E.T (Ertheb) 120 (81809) 2017-11-21 12:55:32
#12 Bart den Hartog (Bart13) 114 (139176) 2017-11-23 13:22:30
#13 Roland Jansen (roland) 111 (17607) 2017-11-25 08:40:16
#14 Em Doulgerakis (Greko) 108 (124033) 2017-11-29 15:59:37
#15 Rainer Zufall (kiekuk) 107 (56786) 2017-11-29 22:29:26
#16 Andreas Frerichs (Ossili) 107 (33266) 2017-11-30 06:57:08
#17 HolgerK (HolgerK) 104 (25776) 2017-12-08 21:29:19
#18 Mir Dim (mir0soft) 103 (72404) 2017-12-16 00:37:57
#19 Holger (holger) 103 (812) 2017-12-21 10:45:51
#20 KW (qwer*) 103 (13963) 2017-12-21 19:50:41
#21 Ronja (Ronja) 102 (3715) 2017-12-28 17:13:08
#22 Carsten Caliebe (CAKA100) 102 (306) 2018-01-03 23:14:54
#23 Martin (martinbucher) 102 (27363) 2018-01-06 15:01:40
#24 Nofre Tete (noffi) 102 (21921) 2018-01-14 16:40:12
#25 Justin Huber (Kendyy) 101 (303) 2018-02-01 17:42:50
#26 Klaus Kolba (Kolbone) 101 (3107) 2018-02-12 23:56:27
#27 Ulrich Dorobeck (Papageno) 101 (3827) 2018-02-20 20:56:50
#28 Snake (snk) 101 (79889) 2018-02-23 17:46:05
#29 Karl Schutt (günter) 101 (41550) 2018-03-16 19:20:22
#30 Joerg G. (SnifferMaster) 101 (18154) 2018-03-25 13:20:36
#31 Benjamin (200611736) 101 (10186) 2018-04-14 22:15:03
#32 Lucio (lcalderonc) 101 (1251) 2018-04-30 05:37:00
#33 Diaconu Bogdan (bogdan_walle) 100 (1723) 2018-06-18 12:28:51
#34 John Smith (Froyo10) 100 (1747) 2018-06-18 14:08:11
#35 Radu CIRSTEA (radu0627) 100 (100) 2018-06-18 14:09:24
#36 catalin (slg2011) 100 (200) 2018-06-18 14:47:37
#37 tamisrah (tamisrah) 100 (3134) 2018-06-18 17:56:53
#38 jack (jack_) 100 (303) 2018-06-18 17:58:52
#39 Examateur (ExAmateur) 100 (100) 2018-06-19 07:37:44
#40 Chisiu Simona (chisiu.simona) 100 (200) 2018-06-24 10:37:08
#41 Random Dude (rnd) 100 (90929) 2018-07-20 17:37:15
#42 Steve Vaillancourt (stvai2) 100 (15041) 2018-07-27 19:55:44
#43 Julian (Lemmynator) 100 (16666) 2018-08-06 14:30:38
#44 Mathijs Verbeek (QIXL) 100 (3096) 2018-10-17 21:10:56
#45 sarah b (silva) 100 (23218) 2018-10-23 20:45:25
#46 _o_ (_o_) 100 (1000) 2018-10-27 11:18:49
#47 Müller (AKHH17S?) 100 (100) 2018-11-03 19:30:50
#48 SA17S3 (JungerKnacker) 100 (100) 2018-11-11 18:41:39
#49 Robert Fuchs (Robo91) 100 (100) 2018-11-14 21:59:45
#50 Luigi Tomelli (archstanton) 100 (108345) 2018-12-17 13:01:20
#51 zuben c3 (zuben-c3) 100 (24853) 2018-12-17 21:01:10
#52 Bertolo (Bertolo) 100 (7167) 2018-12-26 12:55:02
#53 George (Theofanidis) 100 (110784) 2019-01-09 19:20:03
#54 Michael (FoM) 100 (38953) 2019-01-11 20:48:29
#55 Piotr (lesnik7) 100 (8171) 2019-01-13 19:16:52
#56 Jani (mathpseudo) 100 (902) 2019-01-29 15:33:11
#57 Bastien (jacky) 100 (100) 2019-02-07 22:20:23
#58 Lane Williams (planetlane) 100 (23948) 2019-02-28 16:04:19
#59 Lia (Lia) 100 (6855) 2019-03-05 22:25:04
#60 Piyush Agarwal (Piyushgrwl) 100 (3493) 2019-03-20 19:47:16
#61 Danny Higgins (hamster147) 100 (34095) 2019-03-24 15:04:11
#62 Hughes (hughes) 100 (7925) 2019-04-30 17:28:17
#63 Norbert Biermann (Norbert) 100 (45031) 2019-05-18 21:53:06
#64 Somebody (Achidutzu) 100 (2796) 2019-05-31 19:00:49
#65 david (sexton) 100 (2801) 2019-07-03 20:21:14
#66 Stephan (Stephje1978) 100 (26762) 2019-07-20 20:54:02
#67 gerdw (gerdw) 100 (28316) 2019-07-21 10:03:45
You must be logged in to solve the challenge


Hilly — Part 2

[almardeny-02] - 1 user already solved this challenge, 1 is working on it.
 
 
 

Hilly is an improved version of Hill cipher. This challenge consists of the decryption of a ciphertext by means of a partly-known key.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2017-10-17 17:12
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#1) Achieved points (Global score) y-m-d - h:m:s

Em Doulgerakis (Greko) 1156 (124033) 2018-10-29 21:19:05
You must be logged in to solve the challenge


Weakened ElsieFour — Part 3

[rotthaler-02] - 2 users already solved this challenge.
 
 
 

The challenges for the weakened ElsieFour serve as an exercise and use an intentionally weakened version of LC4. ElsieFour combines ideas of modern RC4 stream cipher, historical Playfair cipher and plaintext-dependent keystreams. It can be computed manually. Part 3 is a partly-known-plaintext challenge which provides 2 messages that were encrypted with the same key.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2017-10-03 06:39
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#2) Achieved points (Global score) y-m-d - h:m:s

Nicolas (nicosPavlov) 1226 (151166) 2018-01-18 01:49:20
Michael Möller (michaelm) 1186 (175129) 2018-04-24 07:26:39
You must be logged in to solve the challenge


ElsieFour — Part 1

[rotthaler-01] - 2 users already solved this challenge.
 
 
 

ElsieFour combines ideas of modern RC4 stream cipher, historical Playfair cipher and plaintext-dependent keystreams. It can be computed manually. Part 1 is a partly-known-plaintext challenge which provides 2 messages that were encrypted with the same key.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2017-10-03 06:37
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#2) Achieved points (Global score) y-m-d - h:m:s

S Combes (jerva) 14436 (99132) 2018-06-18 22:14:19
Michael Möller (michaelm) 14182 (175129) 2018-10-29 13:09:48
You must be logged in to solve the challenge


Kaskade-S/T — Part 6 (RansomKaskade Part 1)

[mirkobe-01] - 6 users already solved this challenge.
 
 
 

From a honeypot you get a set of encrypted files and the according plaintext files. Could you discover the used key, to help victims of the ransom ware?
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Authors: This email address is being protected from spambots. You need JavaScript enabled to view it.,This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2017-07-02 12:32
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

Armin Krauss (argh) 1444 (185115) 2017-07-14 14:00:35
Michael Möller (michaelm) 1344 (175129) 2017-07-29 12:39:20
Kurt Gebauer (Yokozuna) 1186 (175433) 2018-01-22 18:16:47
George Lasry (george4096) 1156 (299488) 2018-07-08 22:27:49
#5 Alain Collignon (vexilla72) 1142 (87833) 2018-12-02 20:00:09
#6 D3d4lu5 (D3d4lu5) 1131 (297709) 2019-05-19 12:39:50
You must be logged in to solve the challenge


Holographic Encryption — Part 2

[pavillon-02] - 2 users already solved this challenge.
 
 
 

Holographic encryption can be performed by employing encryption masks which alter the field before propagation. This makes the image
unrecognizable when recorded. You are given three holograms that represent the cipher image and three plain images and their holograms which were encrypted with the same encryption masks.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2017-04-07 22:29
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#2) Achieved points (Global score) y-m-d - h:m:s

Viktor (Veselovský) 1613 (153262) 2017-04-12 18:46:17
Armin Krauss (argh) 1444 (185115) 2017-04-20 17:54:38
You must be logged in to solve the challenge


Holographic Encryption — Part 1

[pavillon-01] - 4 users already solved this challenge.
 
 
 

Holographic encryption can be performed by employing encryption masks which alter the field before propagation. This makes the image unrecognizable when recorded. You are given three holograms that represent the cipher image and two corrupted encryption masks.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2017-04-07 22:25
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#4) Achieved points (Global score) y-m-d - h:m:s

Viktor (Veselovský) 1660 (153262) 2017-04-11 09:41:56
Armin Krauss (argh) 1456 (185115) 2017-04-19 17:59:59
Bart den Hartog (Bart13) 1198 (139176) 2017-09-20 03:18:52
D3d4lu5 (D3d4lu5) 1124 (297709) 2019-07-21 16:07:09
You must be logged in to solve the challenge


Hilly — Part 1

[almardeny-01] - 6 users already solved this challenge, 4 are working on it.
 
 
 

Hilly is an improved version of the Hill cipher. This challenge consists of the decryption of a ciphertext by means of a given plaintext-ciphertext pair.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2017-01-25 04:09
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

Viktor (Veselovský) 1385 (153262) 2017-02-13 19:33:24
Dominik M. (Sgt. Pepper) 1142 (97919) 2018-07-03 02:17:21
Alain (Integral) 1142 (207924) 2018-07-03 19:30:44
Alain Collignon (vexilla72) 1141 (87833) 2018-07-14 09:53:00
#5 Em Doulgerakis (Greko) 1139 (124033) 2018-08-07 11:17:55
#6 D3d4lu5 (D3d4lu5) 1127 (297709) 2019-03-06 17:05:47
You must be logged in to solve the challenge


Handycipher — Part 9

[kallick-23] - 3 users already solved this challenge, 1 is working on it.
 
 
 

Handycipher is a newly created cipher designed to permit pen-and-paper encrypting and decrypting, while providing a significantly high level of security. Part 9 is the same as Part 6, but uses an improved version of the cipher. It is a ciphertext-only challenge.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2017-01-21 22:17
Maximum number of attempts for this challenge: 20

All successful users of this challenge

Rank User (#3) Achieved points (Global score) y-m-d - h:m:s

George Lasry (george4096) 14906 (299488) 2017-05-31 11:00:46
Michael Möller (michaelm) 14129 (175129) 2018-03-26 21:50:27
D3d4lu5 (D3d4lu5) 13830 (297709) 2019-01-26 17:57:14
You must be logged in to solve the challenge


Handycipher — Part 8

[kallick-22] - 3 users already solved this challenge, 1 is working on it.
 
 
 

Handycipher is a newly created cipher designed to permit pen-and-paper encrypting and decrypting, while providing a significantly high level of security. Part 8 is the same as Part 5, but uses an improved version of the cipher. You are given the ciphertext and 229 letters occuring at an unknown location in the plaintext.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2017-01-21 22:14
Maximum number of attempts for this challenge: 20

All successful users of this challenge

Rank User (#3) Achieved points (Global score) y-m-d - h:m:s

George Lasry (george4096) 14917 (299488) 2017-05-28 23:32:02
Michael Möller (michaelm) 14117 (175129) 2018-04-04 18:16:20
D3d4lu5 (D3d4lu5) 13830 (297709) 2019-01-26 09:32:09
You must be logged in to solve the challenge


Handycipher — Part 7

[kallick-21] - 2 users already solved this challenge, 1 is working on it.
 
 
 

Handycipher is a newly created cipher designed to permit pen-and-paper encrypting and decrypting, while providing a significantly high level of security. Part 7 is the same as Part 4, but uses an improved version of the cipher. You are given the ciphertext and the first 229 letters of the plaintext.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2017-01-21 22:11
Maximum number of attempts for this challenge: 20

All successful users of this challenge

Rank User (#2) Achieved points (Global score) y-m-d - h:m:s

George Lasry (george4096) 14917 (299488) 2017-05-28 23:43:15
D3d4lu5 (D3d4lu5) 13830 (297709) 2019-01-26 07:53:23
You must be logged in to solve the challenge


ASAC — A Strong(er) ADFGVX Cipher — Part 5

[fendt-05] - 0 users already solved this challenge.
 
 
 

This series consists of 5 challenges based on each other. It introduces a new three-step cipher called ASAC, which is a modified version of ADFGVX. Part 5 is a "bonus" and just modifies the second challenge of this series by improving the second step of the cipher.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2016-07-09 19:15
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


ASAC — A Strong(er) ADFGVX Cipher — Part 4

[fendt-04] - 0 users already solved this challenge.
 
 
 

This series consists of 5 challenges based on each other. It introduces a new three-step cipher called ASAC, which is a modified version of ADFGVX. Part 4 uses the complete cipher and is the main challenge of this series.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2016-07-09 19: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


ASAC — A Strong(er) ADFGVX Cipher — Part 3

[fendt-03] - 0 users already solved this challenge.
 
 
 

This series consists of 5 challenges based on each other. It introduces a new three-step cipher called ASAC, which is a modified version of ADFGVX. Part 3 involves the complete cipher but weakens the third step by using a single-column transposition instead of a double column transposition.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2016-07-09 19: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


ASAC — A Strong(er) ADFGVX Cipher — Part 2

[fendt-02] - 1 user already solved this challenge.
 
 
 

This series consists of 5 challenges based on each other. It introduces a new three-step cipher called ASAC, which is a modified version of ADFGVX. Part 2 uses only the first two steps of the cipher.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2016-07-09 19:08
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#1) Achieved points (Global score) y-m-d - h:m:s

George Lasry (george4096) 1155 (299488) 2017-08-01 00:01:51
You must be logged in to solve the challenge


ASAC — A Strong(er) ADFGVX Cipher — Part 1

[fendt-01] - 14 users already solved this challenge, 1 is working on it.
 
 
 

This series consists of 5 challenges based on each other. It introduces a new three-step cipher called ASAC, which is a modified version of ADFGVX. Part 1 is meant as an introduction and uses only the first step of ASAC.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2016-07-09 19:05
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#14) Achieved points (Global score) y-m-d - h:m:s

Armin Krauss (argh) 2000 (185115) 2016-07-09 20:51:02
zahir mohsen moradi (ariobarzan) 2000 (99757) 2016-07-09 23:39:20
Snake (snk) 2000 (79889) 2016-07-10 18:57:24
Robert (rm) 1613 (56475) 2016-07-13 20:20:15
#5 Kurt Gebauer (Yokozuna) 1613 (175433) 2016-07-13 20:55:56
#6 Alain (Integral) 1576 (207924) 2016-07-15 09:41:37
#7 Julia Bernotat (El Greco ) 1433 (81129) 2016-07-23 00:33:55
#8 Em Doulgerakis (Greko) 1266 (124033) 2016-09-10 08:42:36
#9 Marc (rcll0891) 1204 (24004) 2016-12-05 19:50:21
#10 Alain Collignon (vexilla72) 1204 (87833) 2016-12-06 16:18:38
#11 Danny Higgins (hamster147) 1179 (34095) 2017-02-26 18:09:02
#12 George Lasry (george4096) 1155 (299488) 2017-07-31 21:27:03
#13 D3d4lu5 (D3d4lu5) 1152 (297709) 2017-08-22 18:15:07
#14 Bart den Hartog (Bart13) 1143 (139176) 2017-11-29 00:40:19
You must be logged in to solve the challenge


Weakened Handycipher — Part 6

[kallick-20] - 5 users already solved this challenge.
 
 
 

The Weakened Handycipher challenges serve as an exercise and use an intentionally weakened version of Handycipher. Part 6 is the same as Part 3, but uses an improved version of the cipher. It is ciphertext-only.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2016-06-28 20:12
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#5) Achieved points (Global score) y-m-d - h:m:s

Alain (Integral) 1307 (207924) 2016-08-07 12:09:26
Michael Möller (michaelm) 1292 (175129) 2016-08-14 17:29:02
George Lasry (george4096) 1161 (299488) 2017-05-29 01:02:28
Nicolas (nicosPavlov) 1136 (151166) 2018-02-18 11:22:27
#5 D3d4lu5 (D3d4lu5) 1123 (297709) 2018-11-01 00:50:59
You must be logged in to solve the challenge


Weakened Handycipher — Part 5

[kallick-19] - 5 users already solved this challenge.
 
 
 

The Weakened Handycipher challenges serve as an exercise and use an intentionally weakened version of Handycipher. Part 5 is the same as Part 2, but uses an improved version of the cipher. It is ciphertext-only, but you are given some partial information about the key.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2016-06-28 20:10
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#5) Achieved points (Global score) y-m-d - h:m:s

Michael Möller (michaelm) 1337 (175129) 2016-07-28 16:36:55
Alain (Integral) 1310 (207924) 2016-08-06 16:25:46
George Lasry (george4096) 1161 (299488) 2017-05-29 21:15:02
Nicolas (nicosPavlov) 1136 (151166) 2018-02-18 11:18:20
#5 D3d4lu5 (D3d4lu5) 1123 (297709) 2018-10-31 22:03:45
You must be logged in to solve the challenge


Weakened Handycipher — Part 4

[kallick-18] - 5 users already solved this challenge.
 
 
 

The Weakened Handycipher challenges serve as an exercise and use an intentionally weakened version of Handycipher. Part 4 is the same as Part 1, but uses an improved version of the cipher. You are given the first 1,009 characters of the plaintext, and some partial information about the key.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2016-06-28 20:08
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#5) Achieved points (Global score) y-m-d - h:m:s

Michael Möller (michaelm) 1414 (175129) 2016-07-13 21:09:45
Alain (Integral) 1310 (207924) 2016-08-06 14:10:50
George Lasry (george4096) 1161 (299488) 2017-05-30 16:00:56
Nicolas (nicosPavlov) 1137 (151166) 2018-02-12 14:08:00
#5 D3d4lu5 (D3d4lu5) 1124 (297709) 2018-10-31 06:18:10
You must be logged in to solve the challenge


Extended Handycipher — Part 6

[kallick-17] - 2 users already solved this challenge.
 
 
 

Extended Handycipher is an enhancement of Handycipher. Part 6 is the same as Part 3, but uses an improved version of the cipher. You are given two encryptions of the plaintext generated with the same key. It is ciphertext-only.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2016-06-28 20:06
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#2) Achieved points (Global score) y-m-d - h:m:s

George Lasry (george4096) 14274 (299488) 2017-05-30 15:01:05
D3d4lu5 (D3d4lu5) 13701 (297709) 2019-01-28 18:39:51
You must be logged in to solve the challenge


Extended Handycipher — Part 5

[kallick-16] - 3 users already solved this challenge.
 
 
 

Extended Handycipher is an enhancement of Handycipher. Part 5 is the same as Part 2, but uses an improved version of the cipher. You are given two encryptions of the plaintext generated with the same key, and 229 characters occuring at an unknown location in the plaintext.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2016-06-28 20:04
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#3) Achieved points (Global score) y-m-d - h:m:s

Michael Möller (michaelm) 14510 (175129) 2017-02-13 22:37:52
George Lasry (george4096) 14276 (299488) 2017-05-29 00:37:15
D3d4lu5 (D3d4lu5) 13704 (297709) 2019-01-22 06:27:03
You must be logged in to solve the challenge


Extended Handycipher — Part 4

[kallick-15] - 3 users already solved this challenge.
 
 
 

Extended Handycipher is an enhancement of Handycipher. Part 4 is the same as Part 1, but uses an improved version of the cipher. You are given three encryptions of the plaintext generated with the same key, and the first 229 characters of the plaintext.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2016-06-28 20:02
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#3) Achieved points (Global score) y-m-d - h:m:s

Michael Möller (michaelm) 14475 (175129) 2017-02-27 14:57:16
George Lasry (george4096) 14276 (299488) 2017-05-29 00:30:45
D3d4lu5 (D3d4lu5) 13725 (297709) 2018-12-14 06:34:24
You must be logged in to solve the challenge


Handycipher — Part 6

[kallick-14] - 5 users already solved this challenge.
 
 
 

Handycipher is a newly created cipher designed to permit pen-and-paper encrypting and decrypting, while providing a significantly high level of security. Part 6 is the same as Part 3, but uses an improved version of the cipher. It is a ciphertext-only challenge.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2016-06-28 19:59
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#5) Achieved points (Global score) y-m-d - h:m:s

Alain (Integral) 15666 (207924) 2016-08-16 23:27:18
Michael Möller (michaelm) 15124 (175129) 2016-10-03 10:57:55
George Lasry (george4096) 14276 (299488) 2017-05-28 23:48:45
Nicolas (nicosPavlov) 13925 (151166) 2018-03-06 14:54:25
#5 D3d4lu5 (D3d4lu5) 13748 (297709) 2018-11-04 23:47:38
You must be logged in to solve the challenge


Handycipher — Part 5

[kallick-13] - 5 users already solved this challenge.
 
 
 

Handycipher is a newly created cipher designed to permit pen-and-paper encrypting and decrypting, while providing a significantly high level of security. Part 5 is the same as Part 2, but uses an improved version of the cipher. You are given the ciphertext and 229 letters occuring at an unknown location in the plaintext.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2016-06-28 19:55
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#5) Achieved points (Global score) y-m-d - h:m:s

Alain (Integral) 15684 (207924) 2016-08-16 15:08:03
Michael Möller (michaelm) 15043 (175129) 2016-10-14 13:50:17
George Lasry (george4096) 14276 (299488) 2017-05-28 23:56:58
Nicolas (nicosPavlov) 13926 (151166) 2018-03-05 11:40:29
#5 D3d4lu5 (D3d4lu5) 13749 (297709) 2018-11-04 13:40:58
You must be logged in to solve the challenge


Handycipher — Part 4

[kallick-12] - 4 users already solved this challenge.
 
 
 

Handycipher is a newly created cipher designed to permit pen-and-paper encrypting and decrypting, while providing a significantly high level of security. Part 4 is the same as Part 1, but uses an improved version of the cipher. You are given the ciphertext and the first 229 letters of the plaintext.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2016-06-28 19:50
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#4) Achieved points (Global score) y-m-d - h:m:s

Alain (Integral) 15684 (207924) 2016-08-15 21:12:28
George Lasry (george4096) 14276 (299488) 2017-05-29 00:06:01
Nicolas (nicosPavlov) 13928 (151166) 2018-03-03 03:12:00
D3d4lu5 (D3d4lu5) 13748 (297709) 2018-11-05 06:48:23
You must be logged in to solve the challenge


New Year's Greetings — Part 5

[gutgesell-05] - 14 users already solved this challenge, 1 is working on it.
 
 
 

This series consists of five parts which are based on each other and that will be getting more and more complicated with each part. This is the last part and teaches us something about the weaknesses of this method by improving it a little bit in some points.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2016-03-21 10:05
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#14) Achieved points (Global score) y-m-d - h:m:s

Szabó Zoltán (szabo.z87) 2000 (55604) 2016-03-21 19:18:08
Rainer Zufall (kiekuk) 1725 (56786) 2016-03-23 15:46:41
Viktor (Veselovský) 1576 (153262) 2016-03-26 13:20:45
Alain (Integral) 1502 (207924) 2016-03-29 14:51:54
#5 Bernhard Gruber (bgr) 1414 (22889) 2016-04-05 13:31:28
#6 Andreas Frerichs (Ossili) 1330 (33266) 2016-04-21 19:19:07
#7 zahir mohsen moradi (ariobarzan) 1330 (99757) 2016-04-21 21:37:32
#8 Christian (chrisadmin) 1212 (2019) 2016-07-31 14:45:51
#9 E.T (Ertheb) 1212 (81809) 2016-08-01 06:43:37
#10 Armin Krauss (argh) 1199 (185115) 2016-08-30 22:10:09
#11 Hans Peter (hanspeter) 1193 (52256) 2016-09-17 12:16:50
#12 D3d4lu5 (D3d4lu5) 1148 (297709) 2017-06-18 20:00:10
#13 Michael (FoM) 1117 (38953) 2019-02-02 09:30:42
#14 Dominik M. (Sgt. Pepper) 1115 (97919) 2019-03-25 13:53:22
You must be logged in to solve the challenge


New Year's Greetings — Part 4

[gutgesell-04] - 36 users already solved this challenge, 12 are working on it.
 
 
 

This series consists of five parts which are based on each other and that will be getting more and more complicated with each part. This part is the actual challenge and tells you the New Year's greeting of the author.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2016-03-21 10:02
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#36) Achieved points (Global score) y-m-d - h:m:s

Szabó Zoltán (szabo.z87) 200 (55604) 2016-03-21 14:14:22
Robert (rm) 200 (56475) 2016-03-21 15:49:31
Rainer Zufall (kiekuk) 200 (56786) 2016-03-21 23:47:44
Armin Krauss (argh) 200 (185115) 2016-03-22 01:17:45
#5 Michael Möller (michaelm) 150 (175129) 2016-03-22 10:21:46
#6 Dominik M. (Sgt. Pepper) 150 (97919) 2016-03-22 19:14:53
#7 Fabian (XP-72) 133 (3707) 2016-03-23 12:44:19
#8 HolgerK (HolgerK) 133 (25776) 2016-03-23 19:58:47
#9 Viktor (Veselovský) 133 (153262) 2016-03-23 22:33:52
#10 Bernhard Gruber (bgr) 120 (22889) 2016-03-25 16:21:02
#11 Alain (Integral) 117 (207924) 2016-03-26 19:39:49
#12 Marco Manfredi (mkk9901) 117 (17686) 2016-03-26 22:41:24
#13 Andreas Frerichs (Ossili) 104 (33266) 2016-04-13 06:32:14
#14 j.h. (haegarq) 104 (15252) 2016-04-14 07:02:14
#15 zahir mohsen moradi (ariobarzan) 103 (99757) 2016-04-21 19:52:57
#16 Hans Joachim Girulat (joregi) 103 (36279) 2016-04-24 13:29:40
#17 Max Mustermann (MustermM) 102 (6661) 2016-05-12 17:31:37
#18 Bart den Hartog (Bart13) 101 (139176) 2016-06-28 00:29:48
#19 E.T (Ertheb) 101 (81809) 2016-07-21 18:12:59
#20 Christian (chrisadmin) 101 (2019) 2016-07-25 22:20:07
#21 Hans Peter (hanspeter) 101 (52256) 2016-09-17 12:15:49
#22 chris_3stones (3stones) 100 (37759) 2016-10-10 20:31:43
#23 George (Theofanidis) 100 (110784) 2016-10-10 20:39:24
#24 Martin (martinbucher) 100 (27363) 2016-11-17 04:14:57
#25 D3d4lu5 (D3d4lu5) 100 (297709) 2017-06-18 15:06:16
#26 Alain Collignon (vexilla72) 100 (87833) 2017-11-08 08:15:36
#27 Holger (holger) 100 (812) 2017-12-21 14:06:28
#28 Mir Dim (mir0soft) 100 (72404) 2017-12-25 15:26:58
#29 H. Lautenschlager (helmi) 100 (32947) 2017-12-28 15:19:58
#30 Kurt Gebauer (Yokozuna) 100 (175433) 2018-01-05 01:20:06
#31 Nofre Tete (noffi) 100 (21921) 2018-02-04 23:08:39
#32 Bertold (bk) 100 (9673) 2018-03-18 18:08:44
#33 Nicolas (nicosPavlov) 100 (151166) 2018-03-24 16:28:02
#34 Michael (FoM) 100 (38953) 2019-01-11 18:38:21
#35 sarah b (silva) 100 (23218) 2019-01-25 19:50:09
#36 david (sexton) 100 (2801) 2019-08-12 22:53:49
You must be logged in to solve the challenge


New Year's Greetings — Part 3

[gutgesell-03] - 37 users already solved this challenge, 2 are working on it.
 
 
 

This series consists of five parts which are based on each other and that will be getting more and more complicated with each part. Part 4 contains a little New Year's greeting of the author and part 5 teaches us something about the weaknesses of this method. Part 3 adds another modification.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2016-03-21 09:59
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#37) Achieved points (Global score) y-m-d - h:m:s

Szabó Zoltán (szabo.z87) 200 (55604) 2016-03-21 13:56:26
Robert (rm) 200 (56475) 2016-03-21 15:33:43
Rainer Zufall (kiekuk) 200 (56786) 2016-03-21 23:19:10
Armin Krauss (argh) 200 (185115) 2016-03-22 01:17:16
#5 Michael Möller (michaelm) 150 (175129) 2016-03-22 10:04:40
#6 Dominik M. (Sgt. Pepper) 150 (97919) 2016-03-22 19:10:11
#7 Fabian (XP-72) 150 (3707) 2016-03-23 00:12:57
#8 HolgerK (HolgerK) 133 (25776) 2016-03-23 19:34:33
#9 Viktor (Veselovský) 133 (153262) 2016-03-23 21:47:57
#10 Bernhard Gruber (bgr) 125 (22889) 2016-03-25 09:46:34
#11 Alain (Integral) 117 (207924) 2016-03-26 19:21:04
#12 Marco Manfredi (mkk9901) 117 (17686) 2016-03-26 20:39:46
#13 Andreas Frerichs (Ossili) 105 (33266) 2016-04-11 22:55:31
#14 j.h. (haegarq) 104 (15252) 2016-04-12 11:40:39
#15 zahir mohsen moradi (ariobarzan) 103 (99757) 2016-04-21 19:12:55
#16 Hans Joachim Girulat (joregi) 103 (36279) 2016-04-23 23:11:53
#17 Max Mustermann (MustermM) 102 (6661) 2016-05-12 17:07:40
#18 Bart den Hartog (Bart13) 101 (139176) 2016-06-28 00:25:52
#19 E.T (Ertheb) 101 (81809) 2016-07-21 17:38:24
#20 Christian (chrisadmin) 101 (2019) 2016-07-25 21:15:41
#21 Hans Peter (hanspeter) 101 (52256) 2016-09-17 12:15:04
#22 George (Theofanidis) 100 (110784) 2016-10-09 18:21:26
#23 Bruns (Triton) 100 (400) 2016-11-14 11:43:39
#24 Martin (martinbucher) 100 (27363) 2016-11-16 16:20:15
#25 Creat1veM1ind (sokrates) 100 (2639) 2016-12-11 20:39:24
#26 D3d4lu5 (D3d4lu5) 100 (297709) 2017-06-18 15:13:59
#27 Alain Collignon (vexilla72) 100 (87833) 2017-11-08 07:56:23
#28 Holger (holger) 100 (812) 2017-12-21 14:01:20
#29 Mir Dim (mir0soft) 100 (72404) 2017-12-25 15:11:54
#30 H. Lautenschlager (helmi) 100 (32947) 2017-12-28 14:17:42
#31 Kurt Gebauer (Yokozuna) 100 (175433) 2018-01-05 01:18:53
#32 Nofre Tete (noffi) 100 (21921) 2018-02-04 22:01:09
#33 Bertold (bk) 100 (9673) 2018-03-18 18:07:51
#34 Nicolas (nicosPavlov) 100 (151166) 2018-03-24 16:25:37
#35 Michael (FoM) 100 (38953) 2019-01-11 01:24:29
#36 sarah b (silva) 100 (23218) 2019-01-24 20:15:54
#37 david (sexton) 100 (2801) 2019-08-12 20:25:17
You must be logged in to solve the challenge


New Year's Greetings — Part 2

[gutgesell-02] - 41 users already solved this challenge, 1 is working on it.
 
 
 

This series consists of five parts which are based on each other and that will be getting more and more complicated with each part. Part 4 contains a little New Year's greeting of the author and part 5 teaches us something about the weaknesses of this method. Part 2 modifies the encryption of part 1 a little bit.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2016-03-21 09:55
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#41) Achieved points (Global score) y-m-d - h:m:s

Szabó Zoltán (szabo.z87) 200 (55604) 2016-03-21 13:20:27
Robert (rm) 200 (56475) 2016-03-21 15:27:26
Rainer Zufall (kiekuk) 200 (56786) 2016-03-21 21:24:25
Michael Möller (michaelm) 200 (175129) 2016-03-21 22:09:24
#5 Armin Krauss (argh) 200 (185115) 2016-03-22 01:16:54
#6 Dominik M. (Sgt. Pepper) 150 (97919) 2016-03-22 19:01:38
#7 Fabian (XP-72) 150 (3707) 2016-03-22 23:46:17
#8 Bernhard Gruber (bgr) 133 (22889) 2016-03-23 11:44:28
#9 HolgerK (HolgerK) 133 (25776) 2016-03-23 19:21:52
#10 Viktor (Veselovský) 133 (153262) 2016-03-23 21:28:05
#11 Alain (Integral) 117 (207924) 2016-03-26 19:00:51
#12 Marco Manfredi (mkk9901) 117 (17686) 2016-03-26 20:21:38
#13 Em Doulgerakis (Greko) 108 (124033) 2016-04-02 18:19:16
#14 j.h. (haegarq) 105 (15252) 2016-04-11 15:15:37
#15 Andreas Frerichs (Ossili) 105 (33266) 2016-04-11 21:33:36
#16 zahir mohsen moradi (ariobarzan) 103 (99757) 2016-04-21 18:53:37
#17 Hans Joachim Girulat (joregi) 103 (36279) 2016-04-23 22:57:49
#18 Max Mustermann (MustermM) 102 (6661) 2016-05-12 16:47:45
#19 Martin (martinbucher) 102 (27363) 2016-05-15 18:53:46
#20 Bart den Hartog (Bart13) 101 (139176) 2016-06-28 00:18:52
#21 E.T (Ertheb) 101 (81809) 2016-07-21 13:13:52
#22 Christian (chrisadmin) 101 (2019) 2016-07-25 20:17:47
#23 Hans Peter (hanspeter) 101 (52256) 2016-09-17 12:14:09
#24 Meine Registrierung (TryC3) 101 (6045) 2016-10-05 11:52:07
#25 George (Theofanidis) 100 (110784) 2016-10-09 16:36:19
#26 Creat1veM1ind (sokrates) 100 (2639) 2016-12-08 19:32:30
#27 D3d4lu5 (D3d4lu5) 100 (297709) 2017-06-18 07:52:41
#28 Alain Collignon (vexilla72) 100 (87833) 2017-11-08 07:48:38
#29 Holger (holger) 100 (812) 2017-12-21 12:56:21
#30 H. Lautenschlager (helmi) 100 (32947) 2017-12-23 21:34:31
#31 Mir Dim (mir0soft) 100 (72404) 2017-12-25 09:40:14
#32 Kurt Gebauer (Yokozuna) 100 (175433) 2018-01-05 01:13:20
#33 Nofre Tete (noffi) 100 (21921) 2018-02-04 21:23:33
#34 Bertold (bk) 100 (9673) 2018-03-18 18:07:11
#35 Nicolas (nicosPavlov) 100 (151166) 2018-03-24 16:22:19
#36 S (Zyphe) 100 (10461) 2018-10-09 15:50:27
#37 Michael (FoM) 100 (38953) 2019-01-07 23:06:07
#38 sarah b (silva) 100 (23218) 2019-01-24 18:39:23
#39 Eugene (lim0n) 100 (47187) 2019-06-30 12:31:57
#40 david (sexton) 100 (2801) 2019-08-12 14:51:05
#41 Stephan (Stephje1978) 100 (26762) 2019-08-25 23:35:57
You must be logged in to solve the challenge


New Year's Greetings — Part 1

[gutgesell-01] - 44 users already solved this challenge, 14 are working on it.
 
 
 

This series consists of five parts which are based on each other and that will be getting more and more complicated with each part. Part 4 contains a little New Year's greeting of the author and part 5 teaches us something about the weaknesses of this method. Part 1 is the easiest part of this series.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2016-03-21 09:48
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#44) Achieved points (Global score) y-m-d - h:m:s

Szabó Zoltán (szabo.z87) 200 (55604) 2016-03-21 13:09:26
Robert (rm) 200 (56475) 2016-03-21 15:23:36
Rainer Zufall (kiekuk) 200 (56786) 2016-03-21 20:58:42
Michael Möller (michaelm) 200 (175129) 2016-03-21 21:28:11
#5 Armin Krauss (argh) 200 (185115) 2016-03-22 01:16:20
#6 Dominik M. (Sgt. Pepper) 150 (97919) 2016-03-22 18:45:50
#7 Fabian (XP-72) 150 (3707) 2016-03-22 23:02:07
#8 Bernhard Gruber (bgr) 133 (22889) 2016-03-23 10:48:31
#9 HolgerK (HolgerK) 133 (25776) 2016-03-23 18:41:22
#10 Viktor (Veselovský) 133 (153262) 2016-03-23 21:21:25
#11 Marco Manfredi (mkk9901) 120 (17686) 2016-03-25 13:34:46
#12 Alain (Integral) 117 (207924) 2016-03-26 18:34:26
#13 Em Doulgerakis (Greko) 108 (124033) 2016-04-02 17:11:36
#14 Martin (martinbucher) 105 (27363) 2016-04-09 09:56:20
#15 j.h. (haegarq) 105 (15252) 2016-04-11 14:35:23
#16 Andreas Frerichs (Ossili) 105 (33266) 2016-04-11 20:50:09
#17 zahir mohsen moradi (ariobarzan) 103 (99757) 2016-04-21 18:41:06
#18 Hans Joachim Girulat (joregi) 103 (36279) 2016-04-23 22:36:53
#19 Max Mustermann (MustermM) 102 (6661) 2016-05-12 16:27:55
#20 Bart den Hartog (Bart13) 101 (139176) 2016-06-28 00:02:20
#21 E.T (Ertheb) 101 (81809) 2016-07-21 12:57:07
#22 Christian (chrisadmin) 101 (2019) 2016-07-25 19:16:28
#23 Hans Peter (hanspeter) 101 (52256) 2016-09-17 12:13:33
#24 George (Theofanidis) 101 (110784) 2016-09-29 16:46:51
#25 Meine Registrierung (TryC3) 101 (6045) 2016-10-05 11:43:28
#26 Tom (dunklesToast) 100 (1526) 2016-10-25 19:45:04
#27 Bruns (Triton) 100 (400) 2016-11-14 11:15:23
#28 Michael (FoM) 100 (38953) 2016-12-01 12:02:18
#29 Creat1veM1ind (sokrates) 100 (2639) 2016-12-08 19:24:29
#30 Holti (Holti) 100 (6035) 2017-01-16 11:02:35
#31 D3d4lu5 (D3d4lu5) 100 (297709) 2017-06-18 07:36:19
#32 Alain Collignon (vexilla72) 100 (87833) 2017-11-08 07:35:54
#33 Holger (holger) 100 (812) 2017-12-21 11:11:57
#34 H. Lautenschlager (helmi) 100 (32947) 2017-12-23 18:54:46
#35 Mir Dim (mir0soft) 100 (72404) 2017-12-25 09:13:47
#36 Kurt Gebauer (Yokozuna) 100 (175433) 2018-01-05 01:12:18
#37 Nicolas (nicosPavlov) 100 (151166) 2018-01-13 09:49:01
#38 Nofre Tete (noffi) 100 (21921) 2018-01-20 21:17:40
#39 Bertold (bk) 100 (9673) 2018-03-18 18:06:11
#40 S (Zyphe) 100 (10461) 2018-10-09 15:37:33
#41 sarah b (silva) 100 (23218) 2019-01-24 18:31:36
#42 Eugene (lim0n) 100 (47187) 2019-06-30 11:47:54
#43 david (sexton) 100 (2801) 2019-07-13 17:18:28
#44 Stephan (Stephje1978) 100 (26762) 2019-08-25 23:20:48
You must be logged in to solve the challenge


Image Noise

[gerschuetz-02] - 100 users already solved this challenge, 19 are working on it.
 
 
 

Both images in this challenge seem to contain no information at all. Or do they trick us? Find the secret message.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2015-11-20 20:26
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#100) Achieved points (Global score) y-m-d - h:m:s

Armin Krauss (argh) 200 (185115) 2015-11-20 21:33:05
Viktor (Veselovský) 200 (153262) 2015-11-20 22:18:11
Robert (rm) 200 (56475) 2015-11-21 00:20:24
Kurt Gebauer (Yokozuna) 200 (175433) 2015-11-21 00:31:36
#5 Rainer Zufall (kiekuk) 200 (56786) 2015-11-21 10:31:52
#6 H. Lautenschlager (helmi) 200 (32947) 2015-11-21 10:52:53
#7 Szabó Zoltán (szabo.z87) 200 (55604) 2015-11-21 13:19:16
#8 Bart den Hartog (Bart13) 200 (139176) 2015-11-21 14:53:34
#9 Andreas Frerichs (Ossili) 200 (33266) 2015-11-21 20:19:22
#10 Michael Möller (michaelm) 200 (175129) 2015-11-21 20:20:32
#11 E.T (Ertheb) 150 (81809) 2015-11-22 09:56:03
#12 Bernhard Gruber (bgr) 150 (22889) 2015-11-22 18:36:46
#13 Karl Schutt (günter) 113 (41550) 2015-11-28 11:50:57
#14 curmudgeon (curmudgeon) 111 (1973) 2015-11-29 20:07:00
#15 Jacques Bedoin (JBAG) 109 (109) 2015-12-01 11:29:25
#16 Claude Vaillancourt (Cl3v3r) 109 (38351) 2015-12-01 18:39:53
#17 Joog (Joog) 107 (1208) 2015-12-04 12:35:52
#18 Jeremy Juenger (The_Shocker_12) 105 (3720) 2015-12-09 23:09:48
#19 S (Zyphe) 104 (10461) 2015-12-15 14:11:01
#20 Dominik M. (Sgt. Pepper) 104 (97919) 2015-12-15 17:42:33
#21 Corneli Keim (cryptina) 103 (703) 2015-12-19 11:37:03
#22 Stefan Noll (MisterTwister) 103 (438) 2015-12-29 12:08:28
#23 T (Wagner) 102 (16988) 2015-12-30 21:55:54
#24 Alain (Integral) 102 (207924) 2016-01-09 17:00:20
#25 Norbert Biermann (Norbert) 102 (45031) 2016-01-12 10:20:39
#26 Hans Joachim Girulat (joregi) 102 (36279) 2016-01-16 15:20:07
#27 Michael (soilfront) 102 (2617) 2016-01-24 14:01:06
#28 zahir mohsen moradi (ariobarzan) 101 (99757) 2016-01-27 22:25:36
#29 HolgerK (HolgerK) 101 (25776) 2016-02-11 00:34:22
#30 tamisrah (tamisrah) 101 (3134) 2016-02-13 21:54:47
#31 TrAsHeR (TrAsHeR) 101 (101) 2016-02-22 20:48:43
#32 Defekt75 (Defekt75) 101 (4325) 2016-02-23 23:44:13
#33 Enrico Geißler (enrico_37) 101 (221) 2016-02-27 22:17:27
#34 Creat1veM1ind (sokrates) 101 (2639) 2016-05-01 00:00:08
#35 Tim Fink (Magellan) 100 (4876) 2016-07-14 04:13:12
#36 Hank (hanky) 100 (22859) 2016-07-27 23:49:32
#37 Hajoe (Tintin-Muc) 100 (6923) 2016-08-02 21:30:26
#38 Erin Meier (Erin198212159) 100 (600) 2016-08-03 21:00:47
#39 Ty (Daddysharky) 100 (200) 2016-08-11 14:53:52
#40 Robert Kosten (Robert Kosten) 100 (2724) 2016-09-06 13:03:40
#41 Hans Peter (hanspeter) 100 (52256) 2016-09-17 12:17:36
#42 Darren (barr306) 100 (1056) 2016-10-27 23:46:12
#43 Yass (Yass) 100 (300) 2016-11-02 22:37:08
#44 Bruns (Triton) 100 (400) 2016-11-12 20:44:18
#45 zuben c3 (zuben-c3) 100 (24853) 2016-11-27 15:22:45
#46 Steffen (stmue) 100 (2911) 2016-11-29 10:56:27
#47 Nicolas (nicosPavlov) 100 (151166) 2016-12-08 13:06:32
#48 Michael (FoM) 100 (38953) 2016-12-12 09:52:43
#49 Ajay Prashant (Ajay_Prashant) 100 (2491) 2017-03-25 22:07:13
#50 Fred (ich_bims_fred) 100 (300) 2017-04-14 11:40:28
#51 Daniel Walder (ibex) 100 (14372) 2017-04-21 21:12:41
#52 chris (c2) 100 (51973) 2017-04-24 14:38:48
#53 Alain Collignon (vexilla72) 100 (87833) 2017-06-14 10:26:56
#54 D3d4lu5 (D3d4lu5) 100 (297709) 2017-06-20 11:40:20
#55 Maria (julesjulchen) 100 (3019) 2017-08-09 21:03:34
#56 Akonia (Akonia12) 100 (12153) 2017-08-15 12:17:51
#57 Kim H. S. (tenchijin) 100 (25468) 2017-08-21 09:06:23
#58 Leonardo Nichele de Aguiar (leonichele) 100 (200) 2017-08-26 18:55:09
#59 Saimon (Pires) 100 (100) 2017-08-26 19:01:04
#60 Michael (cavalleri89) 100 (200) 2017-08-26 19:05:33
#61 David (n1to) 100 (200) 2017-08-28 19:49:50
#62 Raquel Ferreira (rqfrr) 100 (100) 2017-08-31 23:20:47
#63 ayrtonbn (ayrton-01) 100 (200) 2017-09-02 01:22:47
#64 Hanspeter (hapela) 100 (1007) 2017-09-09 09:30:46
#65 J-L Morel (Rossignol) 100 (29425) 2017-09-12 19:16:55
#66 Holo (holo) 100 (200) 2017-10-17 01:24:55
#67 Holger (holger) 100 (812) 2017-12-21 11:22:16
#68 Nofre Tete (noffi) 100 (21921) 2018-02-05 22:19:37
#69 Mir Dim (mir0soft) 100 (72404) 2018-02-10 13:43:35
#70 Manu (manu87) 100 (2979) 2018-02-16 15:26:15
#71 Lara Riegelhofer (larrow_sparrow) 100 (2798) 2018-04-11 14:14:23
#72 Benjamin (200611736) 100 (10186) 2018-04-12 01:15:09
#73 Victor Cueva (Victoralin10) 100 (5282) 2018-04-29 13:34:31
#74 Christian Inci (ch100) 100 (9253) 2018-05-02 01:38:58
#75 John Smith (Froyo10) 100 (1747) 2018-06-18 09:25:38
#76 Diaconu Bogdan (bogdan_walle) 100 (1723) 2018-06-18 12:34:02
#77 Chisiu Simona (chisiu.simona) 100 (200) 2018-06-24 10:58:38
#78 Random Dude (rnd) 100 (90929) 2018-07-23 04:01:55
#79 j.h. (haegarq) 100 (15252) 2018-07-25 13:45:08
#80 Steve Vaillancourt (stvai2) 100 (15041) 2018-07-27 19:47:56
#81 Julian (Lemmynator) 100 (16666) 2018-08-02 23:53:16
#82 A (2h873hcue) 100 (301) 2018-09-05 12:35:27
#83 Ly Mib (lymib) 100 (400) 2018-09-10 21:10:54
#84 Javantea (Javantea) 100 (40816) 2018-10-08 04:24:28
#85 clyto (clytorock) 100 (3195) 2018-11-08 22:13:59
#86 Luigi Tomelli (archstanton) 100 (108345) 2018-12-20 09:56:26
#87 Clemens (16dombrowski) 100 (5136) 2018-12-20 21:02:36
#88 sarah b (silva) 100 (23218) 2019-01-05 10:14:54
#89 George (Theofanidis) 100 (110784) 2019-01-07 18:24:46
#90 David (Fokus_1_U) 100 (200) 2019-02-01 14:30:23
#91 Pierre Robier (tripleedged) 100 (5916) 2019-02-16 18:03:15
#92 Tom (toomderbaumarkt) 100 (600) 2019-02-20 14:30:47
#93 Felix Seifried (FS) 100 (500) 2019-02-20 14:31:07
#94 Tom (187 187 187 187) 100 (400) 2019-02-20 14:31:56
#95 r karoly (r_karoly) 100 (4078) 2019-05-05 11:15:53
#96 ENOENT (ENOENT) 100 (13478) 2019-06-01 21:43:50
#97 Mike (RogueRamblers) 100 (26411) 2019-06-29 01:54:53
#98 david (sexton) 100 (2801) 2019-07-03 21:51:49
#99 Jeff (Fountain) 100 (8788) 2019-07-14 02:31:05
#100 Dr. Peter Uelkes (RandyWaterhouse) 100 (9990) 2019-07-31 07:55:47
You must be logged in to solve the challenge


News from Castle Mansfeld

[gerschuetz-01] - 42 users already solved this challenge, 3 are working on it.
 
 
 

The story of the simple bookseller Paul from Eisleben and his beloved from the near Castle Mansfeld will be continued: A second postcard has been found.

Can you decipher the encrypted message?
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2015-11-13 12:43
Maximum number of attempts for this challenge: 15

All successful users of this challenge

Rank User (#42) Achieved points (Global score) y-m-d - h:m:s

Snake (snk) 200 (79889) 2015-11-13 15:30:00
Kurt Gebauer (Yokozuna) 200 (175433) 2015-11-13 19:34:00
Armin Krauss (argh) 200 (185115) 2015-11-13 22:41:00
Viktor (Veselovský) 200 (153262) 2015-11-13 22:52:00
#5 Michael Möller (michaelm) 150 (175129) 2015-11-14 13:08:00
#6 FirstLast (TheRational) 150 (1753) 2015-11-14 19:23:00
#7 Andreas Frerichs (Ossili) 150 (33266) 2015-11-14 21:45:46
#8 Robert (rm) 150 (56475) 2015-11-14 23:38:31
#9 KW (qwer*) 150 (13963) 2015-11-15 08:23:36
#10 Julia Bernotat (El Greco ) 133 (81129) 2015-11-15 21:20:49
#11 Bernhard Gruber (bgr) 125 (22889) 2015-11-16 19:25:35
#12 Martin (martinbucher) 113 (27363) 2015-11-21 11:15:54
#13 Bart den Hartog (Bart13) 111 (139176) 2015-11-21 19:34:49
#14 Rainer Zufall (kiekuk) 111 (56786) 2015-11-21 20:43:19
#15 Jan (xray) 103 (904) 2015-12-12 16:23:20
#16 Marc (rcll0891) 102 (24004) 2015-12-27 15:22:33
#17 Sebastian Slupina (Grandwizard) 102 (10866) 2016-01-02 17:00:56
#18 Hans Joachim Girulat (joregi) 102 (36279) 2016-01-04 18:37:11
#19 Szabó Zoltán (szabo.z87) 102 (55604) 2016-01-05 11:25:19
#20 Alain (Integral) 102 (207924) 2016-01-10 18:22:44
#21 Dusan (xxdradus) 101 (40236) 2016-01-19 16:05:27
#22 zahir mohsen moradi (ariobarzan) 101 (99757) 2016-01-28 09:33:00
#23 Alain Collignon (vexilla72) 101 (87833) 2016-02-05 19:06:39
#24 Joerg Schaeffler (DrAcula) 101 (2948) 2016-02-09 21:37:56
#25 HolgerK (HolgerK) 101 (25776) 2016-02-12 23:06:35
#26 Karl Schutt (günter) 101 (41550) 2016-02-21 15:46:22
#27 Michael (soilfront) 101 (2617) 2016-03-13 11:12:37
#28 Em Doulgerakis (Greko) 101 (124033) 2016-04-08 18:38:42
#29 Marcus (marcus) 101 (201) 2016-05-01 16:44:37
#30 Norbert Biermann (Norbert) 100 (45031) 2016-07-15 22:36:34
#31 Peter (Garnet) 100 (14234) 2016-10-05 10:24:07
#32 zuben c3 (zuben-c3) 100 (24853) 2016-11-29 19:16:54
#33 S (Zyphe) 100 (10461) 2017-01-17 23:16:51
#34 Dominik M. (Sgt. Pepper) 100 (97919) 2017-04-01 20:31:59
#35 Mir Dim (mir0soft) 100 (72404) 2017-04-03 13:48:42
#36 D3d4lu5 (D3d4lu5) 100 (297709) 2017-06-20 11:36:53
#37 Tom Tox (tox) 100 (17708) 2018-03-04 14:34:21
#38 sarah b (silva) 100 (23218) 2018-07-25 16:02:30
#39 Hans Peter (hanspeter) 100 (52256) 2018-11-15 07:37:07
#40 George (Theofanidis) 100 (110784) 2018-12-24 13:35:13
#41 Michael (FoM) 100 (38953) 2019-01-05 11:26:39
#42 Stephan (Stephje1978) 100 (26762) 2019-08-25 22:14:18
You must be logged in to solve the challenge


Weakened Granit — Part 3

[drobick-07] - 0 users already solved this challenge.
 
 
 

The challenges for the simplified GRANIT cipher, a method that can be done manually, serve as an exercise and use an intentionally simplified version of GRANIT.
Part 3 is a ciphertext-only challenge for which the second permutation key is known.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download the challenge.
Click here to download the additional file of the challenge.

Author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Published on: 2015-09-24 07:37
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


Weakened Granit — Part 2

[drobick-06] - 0 users already solved this challenge, 1 is working on it.