MysteryTwister C3
NUMBER OF ACTIVE MEMBERS:

11060
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 (338)

Ordered by date posted, the most recent appear first.

SIGABA CSP-889 — Part 3

[kopal-27] - 2 users already solved this challenge.
 
 
 

The SIGABA CSP-889 was a highly secure encryption machine used by the US for strategic communication in WWII. In this series of challenges, you are provided with a ciphertext and a partially-known plaintext, here with the length of 200 and 100 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: 2021-06-01 13:45
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) 20000 (399565) 2021-06-01 21:12:15
S Combes (jerva) 20000 (242717) 2021-06-02 12:03:55
You must be logged in to solve the challenge


SIGABA CSP-889 — Part 2

[kopal-26] - 2 users already solved this challenge.
 
 
 

The SIGABA CSP-889 was a highly secure encryption machine used by the US for strategic communication in WWII. In this series of challenges, you are provided with a ciphertext and a partially-known plaintext, here with the length of 270 and 120 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: 2021-06-01 13:35
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) 1824 (242717) 2021-06-03 06:45:44
George Lasry (george4096) 1613 (399565) 2021-06-05 14:08:00
You must be logged in to solve the challenge


SIGABA CSP-889 — Part 1

[kopal-25] - 2 users already solved this challenge.
 
 
 

The SIGABA CSP-889 was a highly secure encryption machine used by the US for strategic communication in WWII. In this series of challenges, you are provided with a ciphertext and a partially-known plaintext, here with the length of 320 and 120 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: 2021-06-01 13:18
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) 2000 (242717) 2021-06-02 10:40:32
George Lasry (george4096) 1725 (399565) 2021-06-03 22:50:04
You must be logged in to solve the challenge


Wheatstone Cryptograph — Part 2

[madness-05] - 3 users already solved this challenge.
 
 
 

The Wheatstone Cryptograph is a simple device that resembles a clock with two hands. For each hand there is a ring of symbols. In this challenge the key is a random permutation of the english alphabet. Are you able to decrypt 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: 2021-05-21 15:10
Maximum number of attempts for this challenge: 30

All successful users of this challenge

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

Eugene (lim0n) 2000 (178540) 2021-05-21 19:56:41
Kurt Gebauer (Yokozuna) 2000 (282608) 2021-05-22 01:51:39
George Lasry (george4096) 1547 (399565) 2021-05-27 21:18:02
You must be logged in to solve the challenge


Wheatstone Cryptograph — Part 1

[madness-04] - 30 users already solved this challenge, 1 is working on it.
 
 
 

The Wheatstone Cryptograph is a simple device that resembles a clock with two hands. For each hand there is a ring of symbols.
Are you able to decrypt 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: 2021-04-21 19:17
Maximum number of attempts for this challenge: 10

All successful users of this challenge

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

Em Doulgerakis (Greko) 200 (193799) 2021-04-21 23:31:35
Armin Krauss (argh) 200 (206965) 2021-04-21 23:36:27
Kurt Gebauer (Yokozuna) 200 (282608) 2021-04-22 02:19:26
Viktor (Veselovský) 200 (169444) 2021-04-22 02:20:36
#5 Eric (ExAstris) 200 (54941) 2021-04-22 06:01:24
#6 Eugene (lim0n) 200 (178540) 2021-04-22 12:34:35
#7 gordon (sir5) 200 (16181) 2021-04-22 12:55:16
#8 H. Lautenschlager (helmi) 200 (56470) 2021-04-22 14:01:36
#9 Alain Collignon (vexilla72) 200 (123666) 2021-04-22 15:14:19
#10 Michael Möller (michaelm) 150 (253196) 2021-04-22 19:50:52
#11 py0neer (py0neer) 150 (750) 2021-04-22 21:44:55
#12 Nofre Tete (noffi) 150 (26507) 2021-04-22 22:54:42
#13 George (Theofanidis) 150 (123216) 2021-04-23 00:31:11
#14 Snake (snk) 133 (187783) 2021-04-23 23:07:13
#15 Enigmatic (Enigmatic) 133 (11604) 2021-04-24 01:53:48
#16 Dominik M. (Sgt. Pepper) 125 (128575) 2021-04-25 12:55:25
#17 George Lasry (george4096) 125 (399565) 2021-04-25 16:37:30
#18 Luigi Tomelli (archstanton) 120 (127538) 2021-04-26 17:03:16
#19 Michael (FoM) 117 (57794) 2021-04-27 03:08:40
#20 Paul Taylor (thetinkitty) 117 (317) 2021-04-27 17:41:31
#21 Lane Williams (planetlane) 110 (34637) 2021-04-30 21:50:38
#22 Gábor (SirAbacus) 108 (5481) 2021-05-04 11:06:50
#23 Random Dude (rnd) 108 (103645) 2021-05-04 17:11:17
#24 JCR (Jericho) 106 (8470) 2021-05-09 10:32:34
#25 Claude Vaillancourt (Cl3v3r) 103 (44129) 2021-05-24 17:25:47
#26 Norbert Biermann (Norbert) 103 (47790) 2021-05-26 17:34:32
#27 sarah b (silva) 103 (47847) 2021-05-26 20:21:38
#28 Mike (RogueRamblers) 102 (75961) 2021-06-01 18:17:48
#29 Jhness (Jhness) 102 (102) 2021-06-05 23:53:43
#30 Somebody (Achidutzu) 102 (14883) 2021-06-09 16:01:36
You must be logged in to solve the challenge


The SZ42 Challenge — Part 11

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

The Lorenz SZ42, codenamed Tunny, was a German teleprinter encryption device used during WW2. This is the eleventh challenge in a series of 13 level-2 challenges with the SZ42. In this "key breaking" challenge you are provided with one ciphertext and the corresponding plaintext. Can you find the wheel patterns?
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: 2021-01-30 15:48
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

George Lasry (george4096) 1385 (399565) 2021-02-19 14:58:08
Kurt Gebauer (Yokozuna) 1307 (282608) 2021-03-11 11:39:16
Eugene (lim0n) 1269 (178540) 2021-04-01 08:15:04
You must be logged in to solve the challenge


The SZ42 Challenge — Part 10

[kopal-23] - 3 users already solved this challenge.
 
 
 

The Lorenz SZ42, codenamed Tunny, was a German teleprinter encryption device used during WW2. This is the tenth challenge in a series of 13 level-2 challenges with the SZ42. In this "key breaking" challenge you are provided with one ciphertext and the corresponding plaintext. Can you find the wheel patterns?
Update January 2021: The starting positions for the CHI wheels were added.
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: 2021-01-30 15:40
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

Eugene (lim0n) 2000 (178540) 2021-01-30 17:18:00
Kurt Gebauer (Yokozuna) 2000 (282608) 2021-01-30 17:40:00
George Lasry (george4096) 1660 (399565) 2021-02-02 19:40:00
You must be logged in to solve the challenge


Find the right route — Part 3

[veselovsky-19] - 16 users already solved this challenge, 3 are working on it.
 
 
 

This series deals with a grid — a basic tool cryptographers use to separate sequences of data into columns and rows. In this challenge you are given three grids where the first grid gives you hints to reveal the plaintext of the second grid. Are you able to find the right route?
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: 2020-12-26 18:24
Maximum number of attempts for this challenge: 15

All successful users of this challenge

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

Dominik M. (Sgt. Pepper) 200 (128575) 2020-12-26 19:53:41
Eugene (lim0n) 200 (178540) 2020-12-27 13:56:01
Armin Krauss (argh) 200 (206965) 2020-12-27 15:51:21
Kurt Gebauer (Yokozuna) 200 (282608) 2020-12-27 17:23:35
#5 S (Zyphe) 150 (13361) 2020-12-28 08:37:37
#6 Ines (bufo01) 150 (5676) 2020-12-28 15:15:43
#7 Michael (FoM) 125 (57794) 2020-12-30 02:32:24
#8 sarah b (silva) 108 (47847) 2021-01-08 15:35:18
#9 George (Theofanidis) 107 (123216) 2021-01-08 19:40:10
#10 Em Doulgerakis (Greko) 107 (193799) 2021-01-09 13:39:50
#11 D3d4lu5 (D3d4lu5) 103 (363488) 2021-01-24 21:22:26
#12 madness (madness) 102 (71592) 2021-02-18 02:35:33
#13 Hughes (hughes) 102 (8430) 2021-02-19 03:55:56
#14 Fabian (XP-72) 101 (4110) 2021-03-25 23:18:51
#15 gordon (sir5) 101 (16181) 2021-04-21 08:58:48
#16 Eric (ExAstris) 101 (54941) 2021-05-15 22:53:44
You must be logged in to solve the challenge


Find the right route — Part 2

[veselovsky-18] - 20 users already solved this challenge.
 
 
 

This series deals with a grid — a basic tool cryptographers use to separate sequences of data into columns and rows. In this challenge you are given four grids where the first grid gives you hints to reveal the plaintext of the second grid. Are you able to find the right route?
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: 2020-12-19 16:53
Maximum number of attempts for this challenge: 15

All successful users of this challenge

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

S (Zyphe) 200 (13361) 2020-12-19 20:13:14
Dominik M. (Sgt. Pepper) 200 (128575) 2020-12-19 20:13:43
Eugene (lim0n) 200 (178540) 2020-12-20 12:44:21
Em Doulgerakis (Greko) 111 (193799) 2020-12-27 19:25:00
#5 Ines (bufo01) 111 (5676) 2020-12-28 12:33:39
#6 Michael (FoM) 110 (57794) 2020-12-29 01:11:57
#7 sarah b (silva) 107 (47847) 2021-01-03 10:33:24
#8 George (Theofanidis) 106 (123216) 2021-01-03 20:42:31
#9 D3d4lu5 (D3d4lu5) 103 (363488) 2021-01-24 21:21:28
#10 Daniel Richter (TheHiveMind) 102 (11450) 2021-02-07 22:01:03
#11 madness (madness) 102 (71592) 2021-02-17 07:00:07
#12 Hughes (hughes) 102 (8430) 2021-02-18 01:34:05
#13 Jörg Schwarzwälder (secuso) 101 (2827) 2021-02-27 18:07:14
#14 Bernd (tryone144) 101 (8066) 2021-04-01 18:08:43
#15 Armin Krauss (argh) 101 (206965) 2021-04-02 11:45:05
#16 Claus Appelt (Konubixe) 101 (8066) 2021-04-07 21:51:16
#17 gordon (sir5) 101 (16181) 2021-04-08 10:30:59
#18 anonym404 (anonym404) 101 (2789) 2021-04-15 18:44:37
#19 Random Dude (rnd) 101 (103645) 2021-05-05 20:42:41
#20 Eric (ExAstris) 101 (54941) 2021-05-13 05:33:23
You must be logged in to solve the challenge


The SZ42 Challenge — Part 9

[kopal-22] - 4 users already solved this challenge.
 
 
 

The Lorenz SZ42, codenamed Tunny, was a German teleprinter encryption device used during WW2. This is the ninth challenge in a series of 13 level-2 challenges with the SZ42. In this "setting" challenge you are provided with only one ciphertext; the patterns for all the wheels are known as well as the starting positions for the CHI wheels. Can you find the starting positions for both the MU and PSI wheels and decrypt the ciphertext?
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: 2020-12-19 16:31
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

Kurt Gebauer (Yokozuna) 2000 (282608) 2020-12-19 18:28:53
Eugene (lim0n) 2000 (178540) 2020-12-20 11:05:51
H. Lautenschlager (helmi) 1444 (56470) 2021-01-01 11:23:23
George Lasry (george4096) 1200 (399565) 2021-05-27 21:20:34
You must be logged in to solve the challenge


The SZ42 Challenge — Part 8

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

The Lorenz SZ42, codenamed Tunny, was a German teleprinter encryption device used during WW2. This is the eighth challenge in a series of 13 level-2 challenges with the SZ42. In this "setting" challenge you are provided with only one ciphertext; the patterns for all the wheels are known as well as the starting positions for the CHI and PSI wheels. Can you find the starting positions for the MU wheels and decrypt the ciphertext?
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: 2020-10-31 16:06
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

Eugene (lim0n) 2000 (178540) 2020-10-31 20:54:38
Kurt Gebauer (Yokozuna) 2000 (282608) 2020-10-31 21:34:32
H. Lautenschlager (helmi) 2000 (56470) 2020-11-01 00:38:54
Snake (snk) 1456 (187783) 2020-11-11 21:46:53
#5 George Lasry (george4096) 1373 (399565) 2020-11-21 17:53:47
You must be logged in to solve the challenge


Find the right route — Part 1

[veselovsky-17] - 44 users already solved this challenge, 4 are working on it.
 
 
 

This series deals with a grid — a basic tool cryptographers use to separate sequences of data into columns and rows. In this challenge you are given two grids where the first grid gives you hints to reveal the plaintext of the second grid. Are you able to find the right route?
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: 2020-10-27 17:01
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

Dominik M. (Sgt. Pepper) 200 (128575) 2020-10-27 17:54:44
Armin Krauss (argh) 200 (206965) 2020-10-27 19:01:03
Kurt Gebauer (Yokozuna) 200 (282608) 2020-10-27 20:13:26
Snake (snk) 200 (187783) 2020-10-27 20:36:50
#5 H. Lautenschlager (helmi) 200 (56470) 2020-10-27 22:42:13
#6 Derek Hatton (alfred_noble) 200 (33998) 2020-10-28 01:45:26
#7 S (Zyphe) 200 (13361) 2020-10-28 08:56:33
#8 Ines (bufo01) 200 (5676) 2020-10-28 09:04:58
#9 Eugene (lim0n) 200 (178540) 2020-10-28 09:35:57
#10 sarah b (silva) 200 (47847) 2020-10-28 10:18:25
#11 Mike (RogueRamblers) 200 (75961) 2020-10-28 16:33:54
#12 Michael Möller (michaelm) 150 (253196) 2020-10-28 19:57:16
#13 Phil Taylor (philthy) 150 (650) 2020-10-29 11:47:09
#14 Lane Williams (planetlane) 125 (34637) 2020-10-30 22:52:59
#15 Alain Collignon (vexilla72) 113 (123666) 2020-11-03 20:09:33
#16 Steve (Samacian) 111 (23915) 2020-11-05 05:57:38
#17 Aliazer (Aliazer) 107 (12521) 2020-11-11 14:07:07
#18 Joerg G. (SnifferMaster) 105 (18376) 2020-11-16 18:04:14
#19 George (Theofanidis) 104 (123216) 2020-11-21 22:35:33
#20 Michael (FoM) 103 (57794) 2020-12-05 00:25:56
#21 Fabian (XP-72) 102 (4110) 2020-12-11 01:29:22
#22 Random Dude (rnd) 102 (103645) 2020-12-16 19:30:34
#23 Anabel Roschmann (Beltiona Mousa) 102 (4919) 2020-12-17 04:48:08
#24 Em Doulgerakis (Greko) 102 (193799) 2020-12-27 12:57:19
#25 D3d4lu5 (D3d4lu5) 102 (363488) 2020-12-29 19:40:47
#26 Arno (TryC3) 101 (6847) 2021-01-03 16:35:13
#27 Jean-Francois (Muskrat) 101 (19013) 2021-01-04 21:01:14
#28 Karl Schutt (günter) 101 (44374) 2021-02-07 15:03:00
#29 Daniel Richter (TheHiveMind) 101 (11450) 2021-02-07 21:27:16
#30 madness (madness) 101 (71592) 2021-02-17 06:13:02
#31 Hughes (hughes) 101 (8430) 2021-02-17 17:52:43
#32 Somebody (Achidutzu) 101 (14883) 2021-02-18 14:15:26
#33 Jörg Schwarzwälder (secuso) 101 (2827) 2021-02-27 14:17:34
#34 m (umsyt) 101 (9300) 2021-03-11 00:30:10
#35 Claus Appelt (Konubixe) 101 (8066) 2021-03-25 17:48:46
#36 Immo Weber (MandelToast) 101 (10362) 2021-03-25 20:37:49
#37 gordon (sir5) 101 (16181) 2021-04-06 12:58:57
#38 anonym404 (anonym404) 101 (2789) 2021-04-11 09:39:42
#39 Michael Ammon (Ammonym) 101 (10120) 2021-04-27 23:00:44
#40 Eric (ExAstris) 101 (54941) 2021-04-30 01:16:38
#41 JCR (Jericho) 101 (8470) 2021-05-10 22:57:09
#42 Luigi Tomelli (archstanton) 100 (127538) 2021-05-20 19:43:26
#43 George Lasry (george4096) 100 (399565) 2021-06-11 15:27:29
You must be logged in to solve the challenge


The SZ42 Challenge — Part 7

[kopal-20] - 4 users already solved this challenge.
 
 
 

The Lorenz SZ42, codenamed Tunny, was a German teleprinter encryption device used during WW2. This is the seventh challenge in a series of 13 level-2 challenges with the SZ42. In this "setting" challenge you are provided with only one ciphertext; the patterns for all the wheels are known as well as the starting positions for the CHI and MU wheels. Can you find the starting positions for the PSI wheels and decrypt the ciphertext?
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: 2020-10-27 16:54
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

Kurt Gebauer (Yokozuna) 2000 (282608) 2020-10-27 19:33:17
Eugene (lim0n) 2000 (178540) 2020-10-28 06:31:49
George Lasry (george4096) 1353 (399565) 2020-11-21 17:18:37
H. Lautenschlager (helmi) 1333 (56470) 2020-11-26 19:24:05
You must be logged in to solve the challenge


The SZ42 Challenge — Part 6

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

The Lorenz SZ42, codenamed Tunny, was a German teleprinter encryption device used during WW2. This is the sixth challenge in a series of 13 level-2 challenges with the SZ42. In this "setting" challenge you are provided with only one ciphertext and the patterns for all five CHI wheels are known. Can you find the starting positions for the five CHI wheels?
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: 2020-10-02 20:09
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

Kurt Gebauer (Yokozuna) 2000 (282608) 2020-10-02 21:03:47
Eugene (lim0n) 2000 (178540) 2020-10-03 14:07:02
Nicolas (nicosPavlov) 2000 (257791) 2020-10-03 16:38:41
H. Lautenschlager (helmi) 2000 (56470) 2020-10-03 17:00:18
#5 George Lasry (george4096) 1286 (399565) 2020-11-21 17:07:35
You must be logged in to solve the challenge


The SZ42 Challenge — Part 5

[kopal-18] - 6 users already solved this challenge, 1 is working on it.
 
 
 

The Lorenz SZ42, codenamed Tunny, was a German teleprinter encryption device used during WW2. This is the fifth challenge in a series of 13 level-2 challenges with the SZ42. In this "setting" challenge you are provided with only one ciphertext and the patterns for CHI1 and CHI2 wheels are known. Can you find the starting positions for CHI1 and CHI2?
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: 2020-09-03 13:25
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

George Lasry (george4096) 2000 (399565) 2020-09-03 16:19:21
H. Lautenschlager (helmi) 2000 (56470) 2020-09-03 18:21:31
Eugene (lim0n) 2000 (178540) 2020-09-03 20:26:14
Nicolas (nicosPavlov) 2000 (257791) 2020-09-04 10:44:48
#5 Kurt Gebauer (Yokozuna) 2000 (282608) 2020-09-04 11:33:18
#6 Snake (snk) 1824 (187783) 2020-09-04 18:20:40
You must be logged in to solve the challenge


The SZ42 Challenge — Part 4

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

The Lorenz SZ42, codenamed Tunny, was a German teleprinter encryption device used during WW2. This is the fourth challenge in a series of 13 level-2 challenges with the SZ42. In this "setting" challenge you are provided with only one ciphertext and the patterns for CHI1 and CHI2 wheels are known. Can you find the starting positions for CHI1 and CHI2?
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: 2020-08-29 23:25
Maximum number of attempts for this challenge: 15

All successful users of this challenge

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

Kurt Gebauer (Yokozuna) 2000 (282608) 2020-08-30 00:14:50
Eugene (lim0n) 2000 (178540) 2020-08-30 12:42:34
H. Lautenschlager (helmi) 2000 (56470) 2020-08-30 12:53:38
George Lasry (george4096) 2000 (399565) 2020-08-30 17:19:16
#5 Armin Krauss (argh) 1725 (206965) 2020-09-01 21:57:52
#6 Nicolas (nicosPavlov) 1613 (257791) 2020-09-03 05:10:49
#7 Snake (snk) 1576 (187783) 2020-09-04 18:19:41
You must be logged in to solve the challenge


The SZ42 Challenge — Part 3

[kopal-16] - 7 users already solved this challenge.
 
 
 

The Lorenz SZ42, codenamed Tunny, was a German teleprinter encryption device used during WW2. This is the third challenge in a series of 13 level-2 challenges with the SZ42. Here, you are provided with 2 in-depth ciphertexts and a limitation is used. Can you recover the plaintexts?
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: 2020-08-15 21:26
Maximum number of attempts for this challenge: 15

All successful users of this challenge

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

Kurt Gebauer (Yokozuna) 2000 (282608) 2020-08-15 23:28:29
Nicolas (nicosPavlov) 2000 (257791) 2020-08-16 07:01:56
H. Lautenschlager (helmi) 2000 (56470) 2020-08-16 11:31:06
Eugene (lim0n) 2000 (178540) 2020-08-16 12:35:37
#5 Dominik M. (Sgt. Pepper) 2000 (128575) 2020-08-16 19:10:39
#6 Armin Krauss (argh) 1725 (206965) 2020-08-17 21:42:37
#7 George Lasry (george4096) 1576 (399565) 2020-08-21 21:02:59
You must be logged in to solve the challenge


The SZ42 Challenge — Part 2

[kopal-15] - 9 users already solved this challenge.
 
 
 

The Lorenz SZ42, codenamed Tunny, was a German teleprinter encryption device used during WW2. This is the second challenge in a series of 13 level-2 challenges with the SZ42. Here, you are provided with 4 in-depth ciphertexts and a limitation is used. Can you recover the plaintexts?
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: 2020-08-05 15:44
Maximum number of attempts for this challenge: 15

All successful users of this challenge

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

George Lasry (george4096) 2000 (399565) 2020-08-05 17:05:39
Armin Krauss (argh) 2000 (206965) 2020-08-05 20:46:23
Eugene (lim0n) 2000 (178540) 2020-08-05 21:28:35
Dominik M. (Sgt. Pepper) 2000 (128575) 2020-08-05 23:18:08
#5 Kurt Gebauer (Yokozuna) 2000 (282608) 2020-08-05 23:56:11
#6 H. Lautenschlager (helmi) 1485 (56470) 2020-08-15 12:53:52
#7 Nicolas (nicosPavlov) 1485 (257791) 2020-08-15 15:15:41
#8 S Combes (jerva) 1292 (242717) 2020-09-20 20:55:34
#9 Random Dude (rnd) 1178 (103645) 2021-04-03 15:40:16
You must be logged in to solve the challenge


The SZ42 Challenge — Part 1

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

The Lorenz SZ42, codenamed Tunny, was a German teleprinter encryption device used during WW2. This is the first challenge in a series of 13 Level-2 challenges with the SZ42. Here, you are provided with 8 in-depth ciphertexts. Can you recover the plaintexts?
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: 2020-07-22 23:20
Maximum number of attempts for this challenge: 15

All successful users of this challenge

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

Eugene (lim0n) 2000 (178540) 2020-07-23 16:28:56
Armin Krauss (argh) 2000 (206965) 2020-07-23 19:34:09
Dominik M. (Sgt. Pepper) 1613 (128575) 2020-07-27 14:04:16
Nicolas (nicosPavlov) 1576 (257791) 2020-07-28 11:57:43
#5 George Lasry (george4096) 1547 (399565) 2020-07-29 10:48:53
#6 Kurt Gebauer (Yokozuna) 1523 (282608) 2020-07-30 17:36:35
#7 H. Lautenschlager (helmi) 1373 (56470) 2020-08-13 20:47:47
#8 S Combes (jerva) 1270 (242717) 2020-09-20 10:56:05
#9 Random Dude (rnd) 1175 (103645) 2021-04-03 03:07:34
You must be logged in to solve the challenge


Lightweight Introduction to Lattices — Part 3

[dimitrov-esslinger-03] - 24 users already solved this challenge.
 
 
 

This is part 3 of the challenge series about lattice-based cryptography schemes. This challenge introduces an encryption scheme which uses systems of linear equations. Can you decrypt a message without knowing the key?
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download 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: 2020-07-16 12:58
Maximum number of attempts for this challenge: 15

All successful users of this challenge

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

Dominik M. (Sgt. Pepper) 2000 (128575) 2020-07-16 13:39:08
S (Zyphe) 2000 (13361) 2020-07-16 14:13:42
Kurt Gebauer (Yokozuna) 2000 (282608) 2020-07-16 14:34:01
H. Lautenschlager (helmi) 2000 (56470) 2020-07-16 14:42:10
#5 Snake (snk) 2000 (187783) 2020-07-16 15:07:38
#6 Viktor (Veselovský) 2000 (169444) 2020-07-16 22:00:42
#7 Eugene (lim0n) 2000 (178540) 2020-07-16 22:58:02
#8 Armin Krauss (argh) 2000 (206965) 2020-07-17 12:56:08
#9 Alain Collignon (vexilla72) 1824 (123666) 2020-07-17 18:39:14
#10 George (Theofanidis) 1824 (123216) 2020-07-17 19:54:10
#11 Silvia Kortmann (mikinsget) 1824 (20341) 2020-07-18 10:43:30
#12 Em Doulgerakis (Greko) 1725 (193799) 2020-07-19 11:13:43
#13 Nofre Tete (noffi) 1613 (26507) 2020-07-20 20:20:30
#14 DS (DS8279) 1576 (29732) 2020-07-22 12:14:13
#15 Derek Hatton (alfred_noble) 1406 (33998) 2020-08-01 17:46:10
#16 Marco Cinelli (Snap) 1324 (37769) 2020-08-18 16:34:40
#17 Tristan1473 (Tristan1473) 1315 (20432) 2020-08-22 12:53:25
#18 Polaris (Polaris) 1305 (32963) 2020-08-26 01:34:05
#19 Michael (FoM) 1201 (57794) 2020-12-21 03:51:15
#20 D3d4lu5 (D3d4lu5) 1198 (363488) 2020-12-29 19:46:17
#21 Gerd Wilts (gerdw) 1186 (50534) 2021-02-07 23:05:32
#22 Luigi Tomelli (archstanton) 1167 (127538) 2021-05-10 10:22:05
#23 Eric (ExAstris) 1166 (54941) 2021-05-17 03:53:50
#24 madness (madness) 1162 (71592) 2021-06-13 02:07:01
You must be logged in to solve the challenge


Lightweight Introduction to Lattices — Part 2

[dimitrov-esslinger-02] - 26 users already solved this challenge, 2 are working on it.
 
 
 

Lattice-based cryptography schemes are relevant for current post-quantum cryptography research. This challenge series accompanies the basic theory from a chapter of the CrypTool Book called "LIGHTWEIGHT INTRODUCTION TO LATTICES". This part of the challenge series uses vectors to hide a famous quote in modern art. Can you reveal it?
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download 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: 2020-06-23 23:05
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) 200 (282608) 2020-06-24 01:42:06
S (Zyphe) 200 (13361) 2020-06-24 09:52:41
Dominik M. (Sgt. Pepper) 200 (128575) 2020-06-24 09:55:36
Armin Krauss (argh) 200 (206965) 2020-06-24 10:00:32
#5 Snake (snk) 200 (187783) 2020-06-24 10:36:03
#6 H. Lautenschlager (helmi) 200 (56470) 2020-06-24 11:27:18
#7 Eugene (lim0n) 200 (178540) 2020-06-24 11:44:34
#8 Alain Collignon (vexilla72) 200 (123666) 2020-06-24 12:58:41
#9 Bernd (tryone144) 150 (8066) 2020-06-25 18:58:43
#10 Viktor (Veselovský) 120 (169444) 2020-06-28 11:13:28
#11 Nofre Tete (noffi) 104 (26507) 2020-07-20 21:59:39
#12 Derek Hatton (alfred_noble) 103 (33998) 2020-07-31 22:25:54
#13 Tristan1473 (Tristan1473) 102 (20432) 2020-08-22 12:31:09
#14 Polaris (Polaris) 102 (32963) 2020-08-26 01:24:11
#15 sarah b (silva) 102 (47847) 2020-08-28 09:38:17
#16 George (Theofanidis) 101 (123216) 2020-08-29 21:12:04
#17 Klaus (kumaus) 101 (22017) 2020-10-17 18:47:10
#18 Flo (sealth) 101 (25734) 2020-11-15 20:35:00
#19 Arno (TryC3) 101 (6847) 2020-12-16 18:50:05
#20 Michael (FoM) 101 (57794) 2020-12-18 23:24:27
#21 D3d4lu5 (D3d4lu5) 101 (363488) 2020-12-29 19:43:55
#22 Gerd Wilts (gerdw) 100 (50534) 2021-02-07 22:23:58
#23 Em Doulgerakis (Greko) 100 (193799) 2021-03-01 18:40:18
#24 Luigi Tomelli (archstanton) 100 (127538) 2021-05-18 18:27:09
#25 gordon (sir5) 100 (16181) 2021-05-19 07:26:36
#26 madness (madness) 100 (71592) 2021-06-13 01:32:23
You must be logged in to solve the challenge


Lightweight Introduction to Lattices — Part 1

[dimitrov-esslinger-01] - 36 users already solved this challenge, 6 are working on it.
 
 
 

Lattice-based cryptography schemes are relevant for current post-quantum cryptography research. This challenge series accompanies the basic theory from a chapter of the CrypTool Book called "LIGHTWEIGHT INTRODUCTION TO LATTICES". In this part of the challenge series we introduce systems of linear equations to find a hidden message in a picture.
Read more...

Click here to get to the corresponding forum topic to share your opinion.
Click here to download 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: 2020-05-16 16:03
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

Dominik M. (Sgt. Pepper) 200 (128575) 2020-05-16 16:52:00
Snake (snk) 200 (187783) 2020-05-16 20:07:33
Armin Krauss (argh) 200 (206965) 2020-05-16 20:32:03
Eugene (lim0n) 200 (178540) 2020-05-17 12:10:48
#5 Viktor (Veselovský) 200 (169444) 2020-05-17 14:15:42
#6 Nofre Tete (noffi) 150 (26507) 2020-05-18 00:57:46
#7 Mike (RogueRamblers) 133 (75961) 2020-05-18 22:27:35
#8 sarah b (silva) 120 (47847) 2020-05-20 20:02:05
#9 George (Theofanidis) 117 (123216) 2020-05-21 22:11:07
#10 Paula Olsen (paol) 117 (942) 2020-05-22 11:18:41
#11 Alain Collignon (vexilla72) 108 (123666) 2020-05-28 13:30:13
#12 Kurt Gebauer (Yokozuna) 108 (282608) 2020-05-28 13:59:54
#13 H. Lautenschlager (helmi) 108 (56470) 2020-05-28 14:20:02
#14 Benjamin Bartl (arenas) 105 (6347) 2020-06-07 13:24:39
#15 Stephan (Stephje1978) 103 (27064) 2020-06-20 01:42:13
#16 Bernd (tryone144) 102 (8066) 2020-06-25 17:44:57
#17 Em Doulgerakis (Greko) 102 (193799) 2020-07-02 23:25:26
#18 Derek Hatton (alfred_noble) 101 (33998) 2020-07-29 18:43:10
#19 Random Dude (rnd) 101 (103645) 2020-07-30 22:27:43
#20 Tristan1473 (Tristan1473) 101 (20432) 2020-08-22 08:46:32
#21 Polaris (Polaris) 101 (32963) 2020-08-24 22:54:36
#22 Klaus (kumaus) 101 (22017) 2020-10-17 18:03:41
#23 Flo (sealth) 101 (25734) 2020-11-15 19:48:12
#24 Michael (FoM) 101 (57794) 2020-12-02 00:24:15
#25 Arno (TryC3) 100 (6847) 2020-12-16 17:53:15
#26 D3d4lu5 (D3d4lu5) 100 (363488) 2020-12-29 19:42:36
#27 Gerd Wilts (gerdw) 100 (50534) 2021-02-07 20:07:50
#28 Daniel Richter (TheHiveMind) 100 (11450) 2021-02-07 23:35:50
#29 Hughes (hughes) 100 (8430) 2021-02-19 15:23:58
#30 m (umsyt) 100 (9300) 2021-03-11 16:29:20
#31 Thomban (thomban) 100 (100) 2021-03-23 12:08:46
#32 Gábor (SirAbacus) 100 (5481) 2021-05-05 15:32:25
#33 Luigi Tomelli (archstanton) 100 (127538) 2021-05-17 19:29:32
#34 gordon (sir5) 100 (16181) 2021-05-19 06:16:20
#35 Eric (ExAstris) 100 (54941) 2021-06-02 00:31:41
#36 madness (madness) 100 (71592) 2021-06-13 01:13:50
You must be logged in to solve the challenge


The Heavy T52 Sturgeon Challenge — Part 9

[kopal-13] - 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 new heavier challenges with T52. In this challenge, you need to recover a plaintext from a T52E ciphertext and a crib. 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: 2020-04-30 13:03
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

Michael Möller (michaelm) 15245 (253196) 2020-07-22 07:22:48
You must be logged in to solve the challenge


The Heavy T52 Sturgeon Challenge — Part 8

[kopal-12] - 0 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 new heavier challenges with T52. In this challenge, you need to recover a plaintext from a T52D ciphertext and a crib. The key is unknown.
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: 2020-04-24 16:56
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 Heavy T52 Sturgeon Challenge — Part 7

[kopal-11] - 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 new heavier challenges with T52. In this challenge, you need to recover a plaintext from a T52AB ciphertext and a crib. The key is unknown.
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: 2020-04-23 12:30
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) 16645 (253196) 2020-05-10 20:53:41
Nicolas (nicosPavlov) 14822 (257791) 2020-09-15 14:25:59
S Combes (jerva) 14427 (242717) 2021-01-10 14:34:22
You must be logged in to solve the challenge


The Heavy T52 Sturgeon Challenge — Part 6

[kopal-10] - 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 new heavier challenges with T52. In this challenge, you need to recover a plaintext from a T52D ciphertext and a crib. 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: 2020-04-22 15:06
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

Michael Möller (michaelm) 14677 (253196) 2020-10-19 09:11:58
You must be logged in to solve the challenge


The Heavy T52 Sturgeon Challenge — Part 5

[kopal-09] - 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 new heavier challenges with T52. In this challenge, you need to recover a plaintext from T52D ciphertexts "in-depth". You are also provided with cribs for each message. The key is unknown.
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: 2020-04-21 12:33
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) 18745 (282608) 2020-04-23 23:55:05
Nicolas (nicosPavlov) 14827 (257791) 2020-09-12 14:33:35
You must be logged in to solve the challenge


The Heavy T52 Sturgeon Challenge — Part 4

[kopal-08] - 4 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 new heavier challenges with T52. In this challenge, you need to recover a plaintext from T52E ciphertexts "in-depth". You are also provided with cribs for each message. 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: 2020-04-15 13:24
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

Michael Möller (michaelm) 17893 (253196) 2020-04-20 16:19:30
Kurt Gebauer (Yokozuna) 17893 (282608) 2020-04-20 21:51:42
George Lasry (george4096) 16705 (399565) 2020-05-02 11:16:22
Nicolas (nicosPavlov) 14928 (257791) 2020-08-19 06:43:45
You must be logged in to solve the challenge


Polyhomophonic Substitution — Part 3

[madness-03] - 14 users already solved this challenge.
 
 
 

This part of the challenge series introduces polyhomophonic substitution. In a polyhomophonic substitution cipher, each ciphertext symbol can represent one of several plaintext symbols, and each plaintext letter can be encrypted as one of several ciphertext letters. The key is a mapping from the set of plaintext symbols to the set of ciphertext symbols.
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: 2020-04-06 20:44
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 (206965) 2020-04-06 22:29:12
Snake (snk) 2000 (187783) 2020-04-07 08:54:32
Thomas (Thomas4897) 2000 (36141) 2020-04-07 14:25:54
Dominik M. (Sgt. Pepper) 2000 (128575) 2020-04-07 14:59:45
#5 Kurt Gebauer (Yokozuna) 2000 (282608) 2020-04-07 15:25:09
#6 Viktor (Veselovský) 2000 (169444) 2020-04-07 15:49:37
#7 J-L Morel (Rossignol) 1433 (42130) 2020-04-20 11:01:25
#8 D3d4lu5 (D3d4lu5) 1337 (363488) 2020-05-06 18:16:08
#9 George Lasry (george4096) 1310 (399565) 2020-05-14 23:52:33
#10 Norbert Biermann (Norbert) 1284 (47790) 2020-05-27 15:29:25
#11 Alain Collignon (vexilla72) 1199 (123666) 2020-09-16 08:49:49
#12 Michael (FoM) 1174 (57794) 2020-12-18 02:33:31
#13 Luigi Tomelli (archstanton) 1154 (127538) 2021-05-01 18:20:58
#14 Eric (ExAstris) 1151 (54941) 2021-05-29 19:54:05
You must be logged in to solve the challenge


The SIGABA Challenge — Part 6

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

The SIGABA was a highly secure encryption machine used by the US for strategic communications in WWII. As in the first five parts of this series of challenges, you are provided with a partial known-plaintext. However, in this part you get no 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: 2020-04-05 18:47
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

S Combes (jerva) 14326 (242717) 2021-02-07 21:35:56
You must be logged in to solve the challenge


Polyhomophonic Substitution — Part 2

[madness-02] - 19 users already solved this challenge.
 
 
 

This part of the challenge series is a warm-up with polyphonic substitution. In a polyphonic substitution cipher, more than one plaintext letter are encrypted to the same ciphertext symbol. The key is a mapping from the set of plaintext symbols to the set of ciphertext symbols.
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: 2020-03-28 15:09
Maximum number of attempts for this challenge: 15

All successful users of this challenge

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

Snake (snk) 2000 (187783) 2020-03-28 17:30:14
Armin Krauss (argh) 2000 (206965) 2020-03-28 22:07:46
Kurt Gebauer (Yokozuna) 2000 (282608) 2020-03-28 22:26:59
Alain Collignon (vexilla72) 2000 (123666) 2020-03-28 23:11:11
#5 Dominik M. (Sgt. Pepper) 2000 (128575) 2020-03-29 03:46:39
#6 J-L Morel (Rossignol) 2000 (42130) 2020-03-29 12:00:46
#7 Viktor (Veselovský) 2000 (169444) 2020-03-29 12:49:46
#8 Eugene (lim0n) 2000 (178540) 2020-03-29 14:49:22
#9 Thomas (Thomas4897) 1824 (36141) 2020-03-29 17:36:58
#10 sarah b (silva) 1824 (47847) 2020-03-29 21:05:46
#11 D3d4lu5 (D3d4lu5) 1307 (363488) 2020-05-06 18:15:02
#12 George Lasry (george4096) 1290 (399565) 2020-05-14 23:02:08
#13 Norbert Biermann (Norbert) 1270 (47790) 2020-05-26 19:48:41
#14 Nicolas (nicosPavlov) 1199 (257791) 2020-09-09 05:32:11
#15 Michael (FoM) 1173 (57794) 2020-12-14 13:48:24
#16 Em Doulgerakis (Greko) 1162 (193799) 2021-02-22 18:58:44
#17 Luigi Tomelli (archstanton) 1153 (127538) 2021-05-01 17:29:03
#18 Martin (martinbucher) 1152 (38365) 2021-05-15 17:14:36
#19 Eric (ExAstris) 1151 (54941) 2021-05-25 05:04:23
You must be logged in to solve the challenge


The SIGABA Challenge — Part 5

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

The SIGABA was a highly secure encryption machine used by the US for strategic communications in WWII. As in the first four parts of this series of challenges, you are provided with a partial known-plaintext, and some information about the key settings. However, in this part you get even less 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: 2020-03-26 13:03
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) 20000 (242717) 2020-03-26 13:34:12
Snake (snk) 20000 (187783) 2020-03-26 21:39:40
You must be logged in to solve the challenge


Polyhomophonic Substitution — Part 1

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

This part of the challenge series is a warm-up with homophonic substitution. In a homophonic substitution cipher, there are more than one ciphertext symbol for each plaintext symbol. The key is a mapping.
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: 2020-03-22 01:57
Maximum number of attempts for this challenge: 15

All successful users of this challenge

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

Viktor (Veselovský) 200 (169444) 2020-03-22 08:47:14
Eugene (lim0n) 200 (178540) 2020-03-22 10:06:44
Snake (snk) 200 (187783) 2020-03-22 10:09:36
Dominik M. (Sgt. Pepper) 200 (128575) 2020-03-22 12:48:30
#5 Kurt Gebauer (Yokozuna) 200 (282608) 2020-03-22 16:33:04
#6 Alain Collignon (vexilla72) 200 (123666) 2020-03-22 19:51:39
#7 Armin Krauss (argh) 200 (206965) 2020-03-22 20:28:19
#8 Michael Möller (michaelm) 200 (253196) 2020-03-22 20:48:55
#9 sarah b (silva) 150 (47847) 2020-03-23 15:05:33
#10 S (Zyphe) 150 (13361) 2020-03-23 17:35:58
#11 J-L Morel (Rossignol) 117 (42130) 2020-03-27 10:42:03
#12 Joerg G. (SnifferMaster) 117 (18376) 2020-03-27 14:06:09
#13 Thomas (Thomas4897) 113 (36141) 2020-03-29 17:27:02
#14 H. Lautenschlager (helmi) 110 (56470) 2020-03-31 13:37:04
#15 George (Theofanidis) 107 (123216) 2020-04-05 16:16:54
#16 Random Dude (rnd) 103 (103645) 2020-04-23 19:15:06
#17 D3d4lu5 (D3d4lu5) 102 (363488) 2020-05-06 18:13:51
#18 Mike (RogueRamblers) 102 (75961) 2020-05-14 01:28:22
#19 Norbert Biermann (Norbert) 102 (47790) 2020-05-24 18:25:37
#20 Em Doulgerakis (Greko) 101 (193799) 2020-07-04 13:03:54
#21 Nicolas (nicosPavlov) 101 (257791) 2020-09-06 10:24:26
#22 Polaris (Polaris) 101 (32963) 2020-09-21 00:29:57
#23 Klaus (kumaus) 100 (22017) 2020-10-16 19:24:43
#24 Lane Williams (planetlane) 100 (34637) 2020-10-31 22:57:15
#25 Derek Hatton (alfred_noble) 100 (33998) 2020-11-02 00:39:10
#26 Michael (FoM) 100 (57794) 2020-11-29 01:19:12
#27 Immo Weber (MandelToast) 100 (10362) 2021-03-25 00:26:52
#28 Luigi Tomelli (archstanton) 100 (127538) 2021-04-29 16:20:48
#29 Eric (ExAstris) 100 (54941) 2021-05-11 05:26:39
#30 Martin (martinbucher) 100 (38365) 2021-05-13 18:05:53
#31 George Lasry (george4096) 100 (399565) 2021-06-11 15:40:40
You must be logged in to solve the challenge


The SIGABA Challenge — Part 4

[lasry-29] - 5 users already solved this challenge.
 
 
 

The SIGABA was a highly secure encryption machine used by the US for strategic communications in WWII. As in the first three parts of this series of challenges, you are provided with a partial known-plaintext, and some information about the key settings. However, in this part you get even less 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: 2020-03-17 20:15
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

S Combes (jerva) 20000 (242717) 2020-03-17 20:56:40
Snake (snk) 18390 (187783) 2020-03-21 17:08:22
D3d4lu5 (D3d4lu5) 16438 (363488) 2020-04-08 18:24:55
Nicolas (nicosPavlov) 14472 (257791) 2020-11-17 09:28:05
#5 Em Doulgerakis (Greko) 14143 (193799) 2021-05-10 11:47:05
You must be logged in to solve the challenge


The SIGABA Challenge — Part 3

[lasry-28] - 6 users already solved this challenge.
 
 
 

The SIGABA was a highly secure encryption machine used by the US for strategic communications in WWII. As in part 1 and part 2 of this series of challenges, you are provided with a partial known-plaintext, and some information about the key settings. However, in this part you get even less 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: 2020-03-11 21:10
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

S Combes (jerva) 20000 (242717) 2020-03-11 22:43:44
Kurt Gebauer (Yokozuna) 18390 (282608) 2020-03-15 07:50:32
Snake (snk) 17290 (187783) 2020-03-21 19:19:23
D3d4lu5 (D3d4lu5) 16839 (363488) 2020-03-26 17:58:44
#5 Nicolas (nicosPavlov) 14732 (257791) 2020-08-24 04:19:56
#6 Em Doulgerakis (Greko) 14164 (193799) 2021-04-18 22:38:29
You must be logged in to solve the challenge


The SIGABA Challenge — Part 2

[lasry-27] - 8 users already solved this challenge.
 
 
 

The SIGABA was a highly secure encryption machine used by the US for strategic communications in WWII. As in part 1 of this series of challenges, you are provided with a partial known-plaintext, and some information about the key settings. However, in this part you get less 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: 2020-03-05 19:44
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

S Combes (jerva) 2000 (242717) 2020-03-05 23:35:49
Kurt Gebauer (Yokozuna) 1576 (282608) 2020-03-11 11:19:06
Dominik M. (Sgt. Pepper) 1406 (128575) 2020-03-21 19:54:11
Snake (snk) 1406 (187783) 2020-03-21 21:49:15
#5 D3d4lu5 (D3d4lu5) 1378 (363488) 2020-03-26 17:57:45
#6 Nicolas (nicosPavlov) 1199 (257791) 2020-08-16 05:07:29
#7 Eugene (lim0n) 1190 (178540) 2020-09-10 22:24:09
#8 Em Doulgerakis (Greko) 1152 (193799) 2021-04-17 16:43:37
You must be logged in to solve the challenge


The SIGABA Challenge — Part 1

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

The SIGABA was a highly secure encryption machine used by the US for strategic communications in WWII. It is believed that the German codebreakers were unable to make any inroads against SIGABA. In this part of the series of challenges, you are provided with a partial known-plaintext, and some information about the key settings.
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: 2020-02-29 12:29
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

S Combes (jerva) 2000 (242717) 2020-02-29 17:14:45
Dominik M. (Sgt. Pepper) 1576 (128575) 2020-03-06 02:41:04
Kurt Gebauer (Yokozuna) 1523 (282608) 2020-03-08 05:38:58
Snake (snk) 1373 (187783) 2020-03-21 14:15:47
#5 D3d4lu5 (D3d4lu5) 1349 (363488) 2020-03-26 17:55:38
#6 Nicolas (nicosPavlov) 1198 (257791) 2020-08-13 13:47:40
#7 Eugene (lim0n) 1190 (178540) 2020-09-06 18:11:16
#8 Em Doulgerakis (Greko) 1153 (193799) 2021-04-06 09:39:40
You must be logged in to solve the challenge


The LoRa Cipher: Logic Randomness — Part 1

[theofanidis-10] - 19 users already solved this challenge.
 
 
 

LoRa calculates the ciphertext by using a logic expression as key. The ciphertext unusually contains large bitstreams too. Could you find the logic expression from a given ciphertext?
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: 2020-02-19 20:31
Maximum number of attempts for this challenge: 15

All successful users of this challenge

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

Viktor (Veselovský) 2000 (169444) 2020-02-19 22:35:21
Kurt Gebauer (Yokozuna) 2000 (282608) 2020-02-20 02:32:51
Dominik M. (Sgt. Pepper) 2000 (128575) 2020-02-20 04:28:34
Eugene (lim0n) 2000 (178540) 2020-02-20 08:26:23
#5 Alain Collignon (vexilla72) 2000 (123666) 2020-02-20 08:50:23
#6 madness (madness) 2000 (71592) 2020-02-20 16:41:35
#7 Snake (snk) 2000 (187783) 2020-02-20 17:26:23
#8 Armin Krauss (argh) 2000 (206965) 2020-02-20 20:27:17
#9 Derek Hatton (alfred_noble) 1613 (33998) 2020-02-24 17:03:34
#10 Mir Dim (mir0soft) 1576 (79760) 2020-02-25 07:51:23
#11 pcback (langkhach11112) 1502 (4860) 2020-02-28 16:00:00
#12 H. Lautenschlager (helmi) 1444 (56470) 2020-03-03 18:52:35
#13 George Lasry (george4096) 1330 (399565) 2020-03-21 21:04:03
#14 sarah b (silva) 1327 (47847) 2020-03-23 08:49:21
#15 D3d4lu5 (D3d4lu5) 1244 (363488) 2020-05-12 23:50:49
#16 Marco Cinelli (Snap) 1230 (37769) 2020-05-30 15:17:23
#17 Em Doulgerakis (Greko) 1164 (193799) 2020-12-29 16:24:22
#18 Luigi Tomelli (archstanton) 1147 (127538) 2021-05-25 18:35:49
#19 Eric (ExAstris) 1147 (54941) 2021-05-26 03:14:48
You must be logged in to solve the challenge


Differential Cryptanalysis — Part 2

[kopal-bender-02] - 3 users already solved this challenge.
 
 
 

This challenge series introduces in detail the handling of the differential cryptanalysis (DCA). In the first two challenges you have to decrypt encrypted images and enter the code shown in the images. The second challenge requires filtering.
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: 2020-01-28 15:22
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

Eugene (lim0n) 2000 (178540) 2020-01-29 05:52:19
Dominik M. (Sgt. Pepper) 2000 (128575) 2020-01-29 11:13:43
Kurt Gebauer (Yokozuna) 1824 (282608) 2020-01-30 00:15:28
You must be logged in to solve the challenge


Polyphonic Substitution Cipher — Part 2

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

This is part two of the two polyphonic cipher challenges, where again two or more plaintext letters correspond to one cipher symbol. Can you solve such a 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: 2020-01-14 15:20
Maximum number of attempts for this challenge: 10

All successful users of this challenge

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

Kurt Gebauer (Yokozuna) 2000 (282608) 2020-01-14 20:46:51
Snake (snk) 2000 (187783) 2020-01-14 21:48:19
Eugene (lim0n) 2000 (178540) 2020-01-15 11:18:08
George Lasry (george4096) 1824 (399565) 2020-01-16 00:47:13
#5 sarah b (silva) 1523 (47847) 2020-01-22 11:31:33
#6 George (Theofanidis) 1284 (123216) 2020-03-04 21:43:19
#7 madness (madness) 1281 (71592) 2020-03-07 13:38:01
#8 Thomas (Thomas4897) 1273 (36141) 2020-03-11 18:43:43
#9 Dominik M. (Sgt. Pepper) 1256 (128575) 2020-03-24 18:22:46
#10 Viktor (Veselovský) 1251 (169444) 2020-03-29 18:09:04
#11 D3d4lu5 (D3d4lu5) 1222 (363488) 2020-05-06 18:17:24
#12 Alain Collignon (vexilla72) 1177 (123666) 2020-09-14 01:19:07
#13 Martin (martinbucher) 1165 (38365) 2020-11-18 16:11:41
#14 Michael (FoM) 1161 (57794) 2020-12-12 23:30:41
#15 Em Doulgerakis (Greko) 1153 (193799) 2021-02-21 22:39:40
#16 Luigi Tomelli (archstanton) 1146 (127538) 2021-05-06 13:33:01
#17 Eric (ExAstris) 1144 (54941) 2021-05-24 00:45:44
You must be logged in to solve the challenge


Christmas Challenge 2019: Differential Cryptanalysis — Part 1

[kopal-bender-01] - 3 users already solved this challenge.
 
 
 

This challenge series introduces in detail the handling of the differential cryptanalysis (DCA). In the first two challenges you have to decrypt encrypted images and enter the code shown in the images. The first challenge needs no filtering, as only valid plaintext-ciphertext pairs are delivered.
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-12-22 21: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

Eugene (lim0n) 1660 (178540) 2019-12-26 16:31:43
Kurt Gebauer (Yokozuna) 1523 (282608) 2019-12-30 03:08:38
Dominik M. (Sgt. Pepper) 1456 (128575) 2020-01-03 18:30:14
You must be logged in to solve the challenge


Polyphonic Substitution Cipher — Part 1

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

In a polyphonic cipher, two or more plaintext letters correspond to one ciphertext symbol.
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-11-21 13:18
Maximum number of attempts for this challenge: 10

All successful users of this challenge

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

sarah b (silva) 2000 (47847) 2019-11-22 10:56:16
Bart den Hartog (Bart13) 1725 (148936) 2019-11-23 15:02:52
George Lasry (george4096) 1725 (399565) 2019-11-23 17:29:00
Snake (snk) 1725 (187783) 2019-11-23 21:47:29
#5 D3d4lu5 (D3d4lu5) 1725 (363488) 2019-11-23 22:47:12
#6 Kurt Gebauer (Yokozuna) 1547 (282608) 2019-11-28 02:28:03
#7 Eugene (lim0n) 1423 (178540) 2019-12-05 17:45:31
#8 Danny Higgins (hamster147) 1349 (39638) 2019-12-18 00:49:54
#9 Random Dude (rnd) 1337 (103645) 2019-12-20 18:42:25
#10 George (Theofanidis) 1229 (123216) 2020-03-01 20:01:11
#11 madness (madness) 1226 (71592) 2020-03-07 18:57:10
#12 Thomas (Thomas4897) 1223 (36141) 2020-03-11 18:24:02
#13 Dominik M. (Sgt. Pepper) 1216 (128575) 2020-03-24 17:35:47
#14 Viktor (Veselovský) 1213 (169444) 2020-03-30 00:37:50
#15 Alain Collignon (vexilla72) 1169 (123666) 2020-09-03 11:31:59
#16 Martin (martinbucher) 1164 (38365) 2020-10-03 09:21:08
#17 Michael (FoM) 1155 (57794) 2020-12-11 15:27:14
#18 Em Doulgerakis (Greko) 1147 (193799) 2021-02-21 13:18:25
#19 Luigi Tomelli (archstanton) 1141 (127538) 2021-05-03 18:39:04
#20 Eric (ExAstris) 1140 (54941) 2021-05-23 23:37:14
You must be logged in to solve the challenge


Cipher ID — Part 1

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

Determine which type of classic cipher was used to generate each of 500 ciphertext messages. The ciphers used in this challenge are simple substitution, columnar transposition, Vigenère, Playfair, and Hill.
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-11-19 12:00
Maximum number of attempts for this challenge: 20

All successful users of this challenge

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

Bart den Hartog (Bart13) 2000 (148936) 2019-11-19 13:05:00
Viktor (Veselovský) 2000 (169444) 2019-11-19 14:41:45
D3d4lu5 (D3d4lu5) 2000 (363488) 2019-11-20 00:40:59
Armin Krauss (argh) 2000 (206965) 2019-11-20 10:40:28
#5 Eugene (lim0n) 1725 (178540) 2019-11-21 17:34:47
#6 George Lasry (george4096) 1660 (399565) 2019-11-22 23:30:33
#7 Kurt Gebauer (Yokozuna) 1613 (282608) 2019-11-23 22:20:16
#8 Snake (snk) 1444 (187783) 2019-12-02 11:48:55
#9 sakis55555 sakis (sakis55555) 1252 (1352) 2020-02-02 00:25:04
#10 George (Theofanidis) 1252 (123216) 2020-02-02 08:21:12
#11 sarah b (silva) 1248 (47847) 2020-02-06 10:29:55
#12 madness (madness) 1230 (71592) 2020-02-27 23:03:53
#13 Mike (RogueRamblers) 1195 (75961) 2020-05-12 02:33:57
#14 Em Doulgerakis (Greko) 1153 (193799) 2020-12-27 11:28:04
#15 Random Dude (rnd) 1143 (103645) 2021-04-10 22:59:57
You must be logged in to solve the challenge


The Heavy T52 Sturgeon Challenge — Part 3

[kopal-07] - 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 new heavier challenges with T52. In this challenge, you need to recover a plaintext from one T52C ciphertext. The key is unknown.
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-10-26 18:50
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) 14126 (242717) 2020-12-29 18:50:16
George Lasry (george4096) 14125 (399565) 2020-12-31 12:43:06
You must be logged in to solve the challenge


The Heavy T52 Sturgeon Challenge — Part 2

[kopal-06] - 0 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 new heavier challenges with T52. In this challenge, you need to recover a plaintext from one T52AB ciphertext. The key is unknown.
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-10-09 12: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


The Heavy T52 Sturgeon Challenge — Part 1

[kopal-05] - 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 new heavier challenges with T52. In this challenge, you need to recover the plaintexts from T52D ciphertexts "in-depth". The key is unknown.
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-09-30 17:57
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) 14576 (399565) 2020-04-25 19:03:07
You must be logged in to solve the challenge


A Cloaked Substitution Cipher — Part 2

[kallick-27] - 14 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 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 (#14) Achieved points (Global score) y-m-d - h:m:s

D3d4lu5 (D3d4lu5) 2000 (363488) 2019-08-26 00:10:35
Viktor (Veselovský) 2000 (169444) 2019-08-26 01:43:23
Snake (snk) 2000 (187783) 2019-08-26 01:58:38
Eugene (lim0n) 2000 (178540) 2019-08-26 12:30:26
#5 Kurt Gebauer (Yokozuna) 2000 (282608) 2019-08-26 15:17:12
#6 George (Theofanidis) 1576 (123216) 2019-08-31 00:32:21
#7 Alain Collignon (vexilla72) 1523 (123666) 2019-09-02 11:16:49
#8 sarah b (silva) 1523 (47847) 2019-09-02 13:12:48
#9 Armin Krauss (argh) 1523 (206965) 2019-09-02 18:56:22
#10 Bart den Hartog (Bart13) 1502 (148936) 2019-09-03 08:22:15
#11 George Lasry (george4096) 1385 (399565) 2019-09-14 13:17:41
#12 Random Dude (rnd) 1290 (103645) 2019-10-12 06:28:34
#13 Em Doulgerakis (Greko) 1252 (193799) 2019-11-08 13:51:58
#14 madness (madness) 1192 (71592) 2020-02-25 00:03:25
You must be logged in to solve the challenge


A Cloaked Substitution Cipher — Part 1

[kallick-26] - 15 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 (#15) Achieved points (Global score) y-m-d - h:m:s

Snake (snk) 2000 (187783) 2019-08-21 19:03:44
D3d4lu5 (D3d4lu5) 2000 (363488) 2019-08-21 19:03:46
Michael Möller (michaelm) 2000 (253196) 2019-08-21 23:36:41
Eugene (lim0n) 1824 (178540) 2019-08-22 12:59:50
#5 Kurt Gebauer (Yokozuna) 1824 (282608) 2019-08-23 09:06:13
#6 Bart den Hartog (Bart13) 1725 (148936) 2019-08-24 00:59:12
#7 Viktor (Veselovský) 1660 (169444) 2019-08-24 17:35:25
#8 George (Theofanidis) 1660 (123216) 2019-08-24 19:27:39
#9 Armin Krauss (argh) 1576 (206965) 2019-08-26 16:24:17
#10 sarah b (silva) 1523 (47847) 2019-08-28 12:59:17
#11 Alain Collignon (vexilla72) 1444 (123666) 2019-09-02 15:05:22
#12 George Lasry (george4096) 1357 (399565) 2019-09-14 16:21:30
#13 Random Dude (rnd) 1286 (103645) 2019-10-10 02:25:14
#14 Em Doulgerakis (Greko) 1262 (193799) 2019-10-25 20:45:39
#15 madness (madness) 1193 (71592) 2020-02-19 04:28:42
You must be logged in to solve the challenge


The T52 Sturgeon Challenge — Part 12

[lasry-25] - 7 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 (#7) Achieved points (Global score) y-m-d - h:m:s

D3d4lu5 (D3d4lu5) 1660 (363488) 2019-08-14 16:54:59
Kurt Gebauer (Yokozuna) 1523 (282608) 2019-08-18 15:58:58
Michael Möller (michaelm) 1196 (253196) 2020-01-27 22:15:31
Snake (snk) 1181 (187783) 2020-03-23 23:23:18
#5 Nicolas (nicosPavlov) 1159 (257791) 2020-07-28 16:06:37
#6 S Combes (jerva) 1143 (242717) 2020-12-30 23:21:59
#7 Mike (RogueRamblers) 1132 (75961) 2021-06-21 01:26:25
You must be logged in to solve the challenge


The T52 Sturgeon Challenge — Part 11

[lasry-24] - 7 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 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 (#7) Achieved points (Global score) y-m-d - h:m:s

D3d4lu5 (D3d4lu5) 1660 (363488) 2019-08-14 17:05:47
Kurt Gebauer (Yokozuna) 1523 (282608) 2019-08-18 15:58:07
Michael Möller (michaelm) 1197 (253196) 2020-01-26 10:12:37
Snake (snk) 1181 (187783) 2020-03-22 20:17:10
#5 Nicolas (nicosPavlov) 1159 (257791) 2020-07-29 03:02:52
#6 S Combes (jerva) 1143 (242717) 2020-12-30 16:24:32
#7 Mike (RogueRamblers) 1132 (75961) 2021-06-21 01:20:50
You must be logged in to solve the challenge


The T52 Sturgeon Challenge — Part 10

[lasry-23] - 5 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 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 (#5) Achieved points (Global score) y-m-d - h:m:s

Kurt Gebauer (Yokozuna) 1485 (282608) 2019-08-20 03:56:48
Michael Möller (michaelm) 1198 (253196) 2020-01-23 21:42:35
Snake (snk) 1181 (187783) 2020-03-23 16:25:18
Nicolas (nicosPavlov) 1159 (257791) 2020-07-24 11:17:51
#5 S Combes (jerva) 1143 (242717) 2020-12-30 16:22:54
You must be logged in to solve the challenge


The T52 Sturgeon Challenge — Part 9

[lasry-22] - 5 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 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 (#5) Achieved points (Global score) y-m-d - h:m:s

Kurt Gebauer (Yokozuna) 1456 (282608) 2019-08-21 22:34:20
Michael Möller (michaelm) 1209 (253196) 2019-12-27 10:38:15
Snake (snk) 1181 (187783) 2020-03-20 17:08:26
Nicolas (nicosPavlov) 1160 (257791) 2020-07-23 10:42:30
#5 S Combes (jerva) 1142 (242717) 2021-01-10 15:04:47
You must be logged in to solve the challenge


The T52 Sturgeon Challenge — Part 8

[lasry-21] - 7 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 (#7) Achieved points (Global score) y-m-d - h:m:s

D3d4lu5 (D3d4lu5) 1660 (363488) 2019-08-14 06:40:22
Kurt Gebauer (Yokozuna) 1523 (282608) 2019-08-18 16:55:50
Michael Möller (michaelm) 1198 (253196) 2020-01-22 21:11:55
Snake (snk) 1181 (187783) 2020-03-22 13:03:26
#5 Nicolas (nicosPavlov) 1160 (257791) 2020-07-22 12:05:00
#6 S Combes (jerva) 1143 (242717) 2020-12-30 08:06:00
#7 Mike (RogueRamblers) 1132 (75961) 2021-06-21 01:44:40
You must be logged in to solve the challenge


The T52 Sturgeon Challenge — Part 7

[lasry-20] - 5 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 (#5) Achieved points (Global score) y-m-d - h:m:s

D3d4lu5 (D3d4lu5) 1725 (363488) 2019-08-13 16:29:12
Kurt Gebauer (Yokozuna) 1613 (282608) 2019-08-15 03:30:25
Snake (snk) 1181 (187783) 2020-03-23 09:59:53
Nicolas (nicosPavlov) 1158 (257791) 2020-08-02 04:21:22
#5 Michael Möller (michaelm) 1157 (253196) 2020-08-07 20:58:39
You must be logged in to solve the challenge


The T52 Sturgeon Challenge — Part 6

[lasry-19] - 4 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 (#4) Achieved points (Global score) y-m-d - h:m:s

D3d4lu5 (D3d4lu5) 1725 (363488) 2019-08-13 00:21:56
Kurt Gebauer (Yokozuna) 1613 (282608) 2019-08-15 14:53:37
Snake (snk) 1181 (187783) 2020-03-22 22:48:36
Nicolas (nicosPavlov) 1158 (257791) 2020-08-01 16:24:05
You must be logged in to solve the challenge


The T52 Sturgeon Challenge — Part 5

[lasry-18] - 4 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 (#4) Achieved points (Global score) y-m-d - h:m:s

D3d4lu5 (D3d4lu5) 1824 (363488) 2019-08-12 16:35:58
Kurt Gebauer (Yokozuna) 1660 (282608) 2019-08-13 23:24:00
Snake (snk) 1181 (187783) 2020-03-20 17:07:07
Nicolas (nicosPavlov) 1158 (257791) 2020-08-05 14:47:04
You must be logged in to solve the challenge


The T52 Sturgeon Challenge — Part 4

[lasry-17] - 9 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 (#9) Achieved points (Global score) y-m-d - h:m:s

Kurt Gebauer (Yokozuna) 1725 (282608) 2019-07-25 18:49:21
D3d4lu5 (D3d4lu5) 1385 (363488) 2019-08-11 20:05:00
Alain Collignon (vexilla72) 1256 (123666) 2019-10-01 18:59:20
Luigi Tomelli (archstanton) 1203 (127538) 2019-12-22 13:48:06
#5 Michael Möller (michaelm) 1201 (253196) 2019-12-28 11:47:25
#6 Snake (snk) 1177 (187783) 2020-03-19 22:22:52
#7 Dominik M. (Sgt. Pepper) 1176 (128575) 2020-03-27 15:39:42
#8 Nicolas (nicosPavlov) 1157 (257791) 2020-07-21 11:44:51
#9 S Combes (jerva) 1152 (242717) 2020-09-08 17:05:30
You must be logged in to solve the challenge


The T52 Sturgeon Challenge — Part 3

[lasry-16] - 11 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 (#11) Achieved points (Global score) y-m-d - h:m:s

Kurt Gebauer (Yokozuna) 2000 (282608) 2019-07-23 07:38:03
D3d4lu5 (D3d4lu5) 1824 (363488) 2019-07-24 06:19:13
Alain Collignon (vexilla72) 1256 (123666) 2019-10-01 14:41:57
Random Dude (rnd) 1238 (103645) 2019-10-21 21:48:09
#5 Luigi Tomelli (archstanton) 1204 (127538) 2019-12-19 13:52:50
#6 H. Lautenschlager (helmi) 1203 (56470) 2019-12-22 20:03:03
#7 Michael Möller (michaelm) 1180 (253196) 2020-03-08 15:55:33
#8 Snake (snk) 1178 (187783) 2020-03-18 22:24:04
#9 Nicolas (nicosPavlov) 1158 (257791) 2020-07-19 04:58:23
#10 S Combes (jerva) 1151 (242717) 2020-09-13 20:41:17
#11 Mike (RogueRamblers) 1131 (75961) 2021-06-17 01:02:56
You must be logged in to solve the challenge


The T52 Sturgeon Challenge — Part 2

[lasry-15] - 14 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 (#14) Achieved points (Global score) y-m-d - h:m:s

Kurt Gebauer (Yokozuna) 2000 (282608) 2019-07-23 00:55:17
D3d4lu5 (D3d4lu5) 1824 (363488) 2019-07-24 06:18:14
Alain Collignon (vexilla72) 1256 (123666) 2019-10-01 11:47:41
Random Dude (rnd) 1238 (103645) 2019-10-20 20:34:27
#5 H. Lautenschlager (helmi) 1212 (56470) 2019-12-01 22:01:22
#6 Luigi Tomelli (archstanton) 1208 (127538) 2019-12-11 18:04:06
#7 Michael Möller (michaelm) 1193 (253196) 2020-01-19 18:06:17
#8 Snake (snk) 1178 (187783) 2020-03-18 22:23:05
#9 Dominik M. (Sgt. Pepper) 1175 (128575) 2020-03-30 23:52:11
#10 Nobody (nobody) 1164 (42945) 2020-06-04 12:23:23
#11 Nicolas (nicosPavlov) 1158 (257791) 2020-07-15 14:49:31
#12 S Combes (jerva) 1152 (242717) 2020-09-10 07:36:41
#13 Mike (RogueRamblers) 1131 (75961) 2021-06-16 00:47:43
#14 George (Theofanidis) 1131 (123216) 2021-06-20 14:04:45
You must be logged in to solve the challenge


The T52 Sturgeon Challenge — Part 1

[lasry-14] - 15 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 (#15) Achieved points (Global score) y-m-d - h:m:s

Kurt Gebauer (Yokozuna) 1725 (282608) 2019-07-16 04:47:40
D3d4lu5 (D3d4lu5) 1725 (363488) 2019-07-16 17:31:02
Bart den Hartog (Bart13) 1444 (148936) 2019-07-26 16:40:28
Alain Collignon (vexilla72) 1247 (123666) 2019-10-01 11:45:38
#5 Random Dude (rnd) 1232 (103645) 2019-10-19 17:45:53
#6 H. Lautenschlager (helmi) 1211 (56470) 2019-11-25 18:14:29
#7 Luigi Tomelli (archstanton) 1204 (127538) 2019-12-10 14:42:26
#8 Michael Möller (michaelm) 1202 (253196) 2019-12-17 21:35:46
#9 Snake (snk) 1176 (187783) 2020-03-18 20:53:02
#10 Dominik M. (Sgt. Pepper) 1174 (128575) 2020-03-27 14:26:11
#11 Nobody (nobody) 1163 (42945) 2020-06-02 22:56:49
#12 Nicolas (nicosPavlov) 1157 (257791) 2020-07-15 13:20:13
#13 S Combes (jerva) 1151 (242717) 2020-09-08 17:03:27
#14 Mike (RogueRamblers) 1131 (75961) 2021-06-08 19:03:01
#15 George (Theofanidis) 1130 (123216) 2021-06-15 23:06:13
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 (36141) 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 (363488) 2019-06-26 12:28:07
You must be logged in to solve the challenge


Handycipher made in love — Part 2

[kallick-24] - 17 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 (#17) Achieved points (Global score) y-m-d - h:m:s

Armin Krauss (argh) 2000 (206965) 2019-05-21 19:53:02
D3d4lu5 (D3d4lu5) 2000 (363488) 2019-05-21 22:37:28
Viktor (Veselovský) 2000 (169444) 2019-05-21 23:37:36
Kurt Gebauer (Yokozuna) 2000 (282608) 2019-05-22 04:17:23
#5 Alain Collignon (vexilla72) 2000 (123666) 2019-05-22 11:15:40
#6 Michael Möller (michaelm) 2000 (253196) 2019-05-22 12:28:56
#7 Danny Higgins (hamster147) 2000 (39638) 2019-05-22 12:46:19
#8 Dominik M. (Sgt. Pepper) 2000 (128575) 2019-05-22 15:03:47
#9 Eugene (lim0n) 1824 (178540) 2019-05-23 13:37:11
#10 George (Theofanidis) 1725 (123216) 2019-05-23 23:00:36
#11 Random Dude (rnd) 1469 (103645) 2019-05-31 23:52:30
#12 E.T (Ertheb) 1324 (81809) 2019-06-23 17:55:08
#13 Bart den Hartog (Bart13) 1244 (148936) 2019-08-11 23:04:07
#14 Silvia Kortmann (mikinsget) 1152 (20341) 2020-07-04 16:11:25
#15 Nicolas (nicosPavlov) 1147 (257791) 2020-08-26 07:12:20
#16 Em Doulgerakis (Greko) 1136 (193799) 2021-01-22 18:34:44
#17 madness (madness) 1128 (71592) 2021-06-17 18:13:56
You must be logged in to solve the challenge


Homophonic Encryption — Part 4

[kopal-04] - 28 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 (#28) Achieved points (Global score) y-m-d - h:m:s

Viktor (Veselovský) 2000 (169444) 2019-05-09 00:56:19
Snake (snk) 2000 (187783) 2019-05-09 14:10:58
Armin Krauss (argh) 2000 (206965) 2019-05-09 17:58:49
George Lasry (george4096) 2000 (399565) 2019-05-09 20:48:39
#5 D3d4lu5 (D3d4lu5) 1824 (363488) 2019-05-10 18:25:33
#6 E.T (Ertheb) 1613 (81809) 2019-05-13 19:52:53
#7 Random Dude (rnd) 1456 (103645) 2019-05-20 13:42:29
#8 Dominik M. (Sgt. Pepper) 1444 (128575) 2019-05-21 18:51:04
#9 sarah b (silva) 1321 (47847) 2019-06-12 14:03:49
#10 Stephan (Stephje1978) 1254 (27064) 2019-07-20 19:51:56
#11 Bart den Hartog (Bart13) 1251 (148936) 2019-07-23 02:41:07
#12 Gerd Wilts (gerdw) 1246 (50534) 2019-07-27 22:50:35
#13 Danny Higgins (hamster147) 1207 (39638) 2019-09-28 23:53:20
#14 Em Doulgerakis (Greko) 1198 (193799) 2019-10-21 19:24:28
#15 George (Theofanidis) 1196 (123216) 2019-10-27 20:00:15
#16 Alain Collignon (vexilla72) 1180 (123666) 2019-12-22 12:16:59
#17 madness (madness) 1170 (71592) 2020-02-10 11:37:44
#18 Thomas (Thomas4897) 1167 (36141) 2020-02-28 18:57:12
#19 J-L Morel (Rossignol) 1162 (42130) 2020-03-31 18:24:56
#20 Eugene (lim0n) 1161 (178540) 2020-04-07 14:18:21
#21 Derek Hatton (alfred_noble) 1140 (33998) 2020-11-02 21:47:30
#22 Michael (FoM) 1138 (57794) 2020-12-04 17:55:52
#23 Mike (RogueRamblers) 1134 (75961) 2021-02-08 17:02:56
#24 Lane Williams (planetlane) 1131 (34637) 2021-04-01 21:35:05
#25 gordon (sir5) 1129 (16181) 2021-05-12 12:00:48
#26 Martin (martinbucher) 1129 (38365) 2021-05-13 16:47:53
#27 Luigi Tomelli (archstanton) 1129 (127538) 2021-05-16 17:49:42
#28 Eric (ExAstris) 1129 (54941) 2021-05-19 03:49:58
You must be logged in to solve the challenge


Homophonic Encryption — Part 3

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

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 (#29) Achieved points (Global score) y-m-d - h:m:s

Viktor (Veselovský) 2000 (169444) 2019-05-09 00:41:40
Alain Collignon (vexilla72) 2000 (123666) 2019-05-09 10:44:10
Dominik M. (Sgt. Pepper) 2000 (128575) 2019-05-09 13:01:44
Snake (snk) 2000 (187783) 2019-05-09 13:48:05
#5 D3d4lu5 (D3d4lu5) 2000 (363488) 2019-05-09 17:16:18
#6 Armin Krauss (argh) 2000 (206965) 2019-05-09 17:34:33
#7 George Lasry (george4096) 2000 (399565) 2019-05-09 20:51:40
#8 Kurt Gebauer (Yokozuna) 1660 (282608) 2019-05-12 09:56:05
#9 E.T (Ertheb) 1613 (81809) 2019-05-13 19:39:06
#10 Random Dude (rnd) 1469 (103645) 2019-05-19 06:21:43
#11 Eugene (lim0n) 1469 (178540) 2019-05-19 07:57:08
#12 sarah b (silva) 1444 (47847) 2019-05-21 10:23:59
#13 Danny Higgins (hamster147) 1312 (39638) 2019-06-15 09:29:43
#14 George (Theofanidis) 1310 (123216) 2019-06-15 23:35:10
#15 Stephan (Stephje1978) 1254 (27064) 2019-07-20 19:44:17
#16 Bart den Hartog (Bart13) 1251 (148936) 2019-07-23 01:31:01
#17 Gerd Wilts (gerdw) 1246 (50534) 2019-07-27 22:34:51
#18 Em Doulgerakis (Greko) 1198 (193799) 2019-10-20 22:10:48
#19 madness (madness) 1170 (71592) 2020-02-10 10:31:39
#20 Thomas (Thomas4897) 1167 (36141) 2020-02-29 08:11:06
#21 J-L Morel (Rossignol) 1162 (42130) 2020-03-31 17:34:46
#22 Derek Hatton (alfred_noble) 1140 (33998) 2020-11-02 19:28:52
#23 Michael (FoM) 1138 (57794) 2020-12-04 17:34:08
#24 Mike (RogueRamblers) 1134 (75961) 2021-01-31 01:22:41
#25 Lane Williams (planetlane) 1131 (34637) 2021-04-01 20:55:27
#26 gordon (sir5) 1129 (16181) 2021-05-12 11:50:10
#27 Martin (martinbucher) 1129 (38365) 2021-05-13 16:36:41
#28 Luigi Tomelli (archstanton) 1129 (127538) 2021-05-14 18:17:35
#29 Eric (ExAstris) 1129 (54941) 2021-05-19 02:13:17
You must be logged in to solve the challenge


Homophonic Encryption — Part 2

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

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 (#30) Achieved points (Global score) y-m-d - h:m:s

George Lasry (george4096) 1725 (399565) 2019-05-10 22:02:30
Armin Krauss (argh) 1725 (206965) 2019-05-10 22:04:09
Snake (snk) 1725 (187783) 2019-05-10 22:29:03
Alain Collignon (vexilla72) 1725 (123666) 2019-05-10 23:47:11
#5 Viktor (Veselovský) 1725 (169444) 2019-05-11 00:58:36
#6 H. Lautenschlager (helmi) 1725 (56470) 2019-05-11 19:53:59
#7 Kurt Gebauer (Yokozuna) 1725 (282608) 2019-05-11 20:56:51
#8 E.T (Ertheb) 1613 (81809) 2019-05-13 19:28:56
#9 D3d4lu5 (D3d4lu5) 1576 (363488) 2019-05-14 06:05:32
#10 Eugene (lim0n) 1523 (178540) 2019-05-16 13:32:40
#11 sarah b (silva) 1485 (47847) 2019-05-18 19:57:39
#12 Random Dude (rnd) 1469 (103645) 2019-05-19 05:44:02
#13 George (Theofanidis) 1469 (123216) 2019-05-19 16:12:16
#14 Dominik M. (Sgt. Pepper) 1433 (128575) 2019-05-22 15:21:28
#15 Danny Higgins (hamster147) 1423 (39638) 2019-05-22 21:56:59
#16 Stephan (Stephje1978) 1254 (27064) 2019-07-20 18:47:10
#17 Bart den Hartog (Bart13) 1251 (148936) 2019-07-23 00:42:48
#18 Gerd Wilts (gerdw) 1246 (50534) 2019-07-27 23:58:09
#19 Em Doulgerakis (Greko) 1197 (193799) 2019-10-22 22:15:01
#20 madness (madness) 1170 (71592) 2020-02-10 21:13:23
#21 Thomas (Thomas4897) 1167 (36141) 2020-02-28 18:19:21
#22 J-L Morel (Rossignol) 1162 (42130) 2020-03-30 19:13:06
#23 Derek Hatton (alfred_noble) 1140 (33998) 2020-11-02 23:44:54
#24 Michael (FoM) 1138 (57794) 2020-12-04 02:17:07
#25 Mike (RogueRamblers) 1134 (75961) 2021-01-31 01:44:55
#26 Lane Williams (planetlane) 1131 (34637) 2021-04-01 16:42:11
#27 gordon (sir5) 1129 (16181) 2021-05-12 11:34:13
#28 Martin (martinbucher) 1129 (38365) 2021-05-13 15:22:49
#29 Luigi Tomelli (archstanton) 1129 (127538) 2021-05-13 20:11:20
#30 Eric (ExAstris) 1129 (54941) 2021-05-19 02:48:11
You must be logged in to solve the challenge


Homophonic Encryption — Part 1

[kopal-01] - 35 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 15:22
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

Snake (snk) 2000 (187783) 2019-05-04 20:15:46
Armin Krauss (argh) 2000 (206965) 2019-05-04 23:35:06
D3d4lu5 (D3d4lu5) 2000 (363488) 2019-05-05 04:23:38
Kurt Gebauer (Yokozuna) 2000 (282608) 2019-05-05 13:33:42
#5 H. Lautenschlager (helmi) 2000 (56470) 2019-05-05 13:50:31
#6 Dominik M. (Sgt. Pepper) 2000 (128575) 2019-05-05 15:17:09
#7 George (Theofanidis) 1824 (123216) 2019-05-05 19:47:28
#8 Marc (rcll0891) 1824 (24004) 2019-05-05 22:43:25
#9 Alain Collignon (vexilla72) 1824 (123666) 2019-05-06 11:43:14
#10 E.T (Ertheb) 1824 (81809) 2019-05-06 14:05:14
#11 Viktor (Veselovský) 1725 (169444) 2019-05-06 19:00:08
#12 Michael Möller (michaelm) 1725 (253196) 2019-05-06 22:40:30
#13 George Lasry (george4096) 1660 (399565) 2019-05-07 22:40:03
#14 sarah b (silva) 1523 (47847) 2019-05-12 10:44:07
#15 Eugene (lim0n) 1469 (178540) 2019-05-15 14:53:33
#16 Random Dude (rnd) 1444 (103645) 2019-05-17 03:56:02
#17 Danny Higgins (hamster147) 1391 (39638) 2019-05-22 17:04:47
#18 Hans Joachim Girulat (joregi) 1261 (36278) 2019-07-09 15:30:08
#19 Stephan (Stephje1978) 1249 (27064) 2019-07-20 19:47:49
#20 Bart den Hartog (Bart13) 1247 (148936) 2019-07-22 23:32:57
#21 Gerd Wilts (gerdw) 1243 (50534) 2019-07-27 20:56:08
#22 Em Doulgerakis (Greko) 1197 (193799) 2019-10-21 10:10:45
#23 Jasmin (Miles) 1176 (8987) 2020-01-08 01:58:05
#24 madness (madness) 1170 (71592) 2020-02-10 10:30:43
#25 Thomas (Thomas4897) 1166 (36141) 2020-02-28 18:14:54
#26 J-L Morel (Rossignol) 1162 (42130) 2020-03-29 17:10:19
#27 Martin (martinbucher) 1156 (38365) 2020-05-17 12:33:58
#28 Nicolas (nicosPavlov) 1146 (257791) 2020-08-23 05:43:56
#29 Derek Hatton (alfred_noble) 1140 (33998) 2020-11-02 23:57:15
#30 Lane Williams (planetlane) 1140 (34637) 2020-11-03 18:58:58
#31 Michael (FoM) 1138 (57794) 2020-12-02 20:22:33
#32 Mike (RogueRamblers) 1134 (75961) 2021-01-30 19:02:17
#33 Luigi Tomelli (archstanton) 1129 (127538) 2021-05-11 17:51:28
#34 gordon (sir5) 1129 (16181) 2021-05-12 11:30:59
#35 Eric (ExAstris) 1128 (54941) 2021-05-19 02:37:40
You must be logged in to solve the challenge


Handycipher made in love — Part 1

[theofanidis-09] - 22 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 (#22) Achieved points (Global score) y-m-d - h:m:s

Armin Krauss (argh) 2000 (206965) 2019-02-16 14:52:29
D3d4lu5 (D3d4lu5) 2000 (363488) 2019-02-16 16:30:13
Michael Möller (michaelm) 2000 (253196) 2019-02-16 18:53:09
George Lasry (george4096) 2000 (399565) 2019-02-16 21:36:16
#5 Alain Collignon (vexilla72) 2000 (123666) 2019-02-16 22:05:39
#6 Viktor (Veselovský) 2000 (169444) 2019-02-16 23:50:47
#7 Kurt Gebauer (Yokozuna) 2000 (282608) 2019-02-17 05:12:50
#8 Dominik M. (Sgt. Pepper) 1824 (128575) 2019-02-17 16:28:10
#9 Snake (snk) 1824 (187783) 2019-02-17 19:03:26
#10 Rainer Zufall (kiekuk) 1406 (56786) 2019-03-04 14:32:25
#11 sarah b (silva) 1281 (47847) 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 (39638) 2019-05-19 22:53:22
#15 Eugene (lim0n) 1233 (178540) 2019-05-23 14:09:42
#16 Random Dude (rnd) 1227 (103645) 2019-05-31 13:45:56
#17 E.T (Ertheb) 1216 (81809) 2019-06-19 17:29:41
#18 Bart den Hartog (Bart13) 1199 (148936) 2019-07-29 05:55:03
#19 Silvia Kortmann (mikinsget) 1144 (20341) 2020-07-03 12:30:53
#20 Nicolas (nicosPavlov) 1139 (257791) 2020-08-25 18:38:22
#21 Em Doulgerakis (Greko) 1130 (193799) 2021-01-22 17:19:59
#22 madness (madness) 1124 (71592) 2021-06-17 04:01:37
You must be logged in to solve the challenge


Monoalphabetic Substitution with Nostradamus Flavor

[theofanidis-08] - 28 users already solved this challenge, 3 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 (#28) Achieved points (Global score) y-m-d - h:m:s

Armin Krauss (argh) 2000 (206965) 2019-02-16 13:26:09
D3d4lu5 (D3d4lu5) 2000 (363488) 2019-02-16 15:57:07
Dominik M. (Sgt. Pepper) 2000 (128575) 2019-02-16 19:22:15
George Lasry (george4096) 2000 (399565) 2019-02-16 21:43:46
#5 Viktor (Veselovský) 2000 (169444) 2019-02-16 23:02:15
#6 Alain Collignon (vexilla72) 2000 (123666) 2019-02-16 23:07:32
#7 Kurt Gebauer (Yokozuna) 2000 (282608) 2019-02-17 06:54:14
#8 Snake (snk) 1824 (187783) 2019-02-17 17:11:33
#9 Luigi Tomelli (archstanton) 1660 (127538) 2019-02-19 13:04:04
#10 Lane Williams (planetlane) 1660 (34637) 2019-02-19 16:02:06
#11 Random Dude (rnd) 1660 (103645) 2019-02-19 17:26:52
#12 Karl Schutt (günter) 1660 (44374) 2019-02-19 18:42:32
#13 sarah b (silva) 1613 (47847) 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 (36278) 2019-06-07 22:57:11
#18 Michael (FoM) 1217 (57794) 2019-06-18 17:17:19
#19 Bart den Hartog (Bart13) 1185 (148936) 2019-09-11 18:27:40
#20 Derek Hatton (alfred_noble) 1160 (33998) 2020-01-29 23:02:28
#21 Thomas (Thomas4897) 1156 (36141) 2020-03-01 18:09:54
#22 Eugene (lim0n) 1155 (178540) 2020-03-06 13:47:39
#23 Mike (RogueRamblers) 1147 (75961) 2020-05-18 02:13:45
#24 Somebody (Achidutzu) 1146 (14883) 2020-06-07 20:54:40
#25 Nicolas (nicosPavlov) 1140 (257791) 2020-08-23 12:05:05
#26 Em Doulgerakis (Greko) 1132 (193799) 2020-12-28 17:35:53
#27 J-L Morel (Rossignol) 1131 (42130) 2021-01-15 16:45:37
#28 Eric (ExAstris) 1126 (54941) 2021-04-21 22:27:39
You must be logged in to solve the challenge


Cryptanalysis Hacking Puzzles — Part 2

[martins-02] - 141 users already solved this challenge, 37 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 (#141) Achieved points (Global score) y-m-d - h:m:s

Armin Krauss (argh) 200 (206965) 2019-01-09 15:41:27
Dominik M. (Sgt. Pepper) 200 (128575) 2019-01-09 16:25:16
sarah b (silva) 200 (47847) 2019-01-09 20:37:52
Alain Collignon (vexilla72) 200 (123666) 2019-01-10 08:00:54
#5 Random Dude (rnd) 200 (103645) 2019-01-10 13:53:12
#6 D3d4lu5 (D3d4lu5) 150 (363488) 2019-01-10 22:13:00
#7 S (Zyphe) 133 (13361) 2019-01-11 17:15:04
#8 George (Theofanidis) 133 (123216) 2019-01-11 18:10:41
#9 Michael Möller (michaelm) 125 (253196) 2019-01-12 22:07:19
#10 0e85dc6eaf (0e85dc6eaf) 125 (125) 2019-01-13 13:05:43
#11 j.h. (haegarq) 114 (15352) 2019-01-16 06:17:43
#12 E.T (Ertheb) 107 (81809) 2019-01-22 21:08:13
#13 Lane Williams (planetlane) 105 (34637) 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 (402) 2019-03-01 01:12:17
#20 Sergey (vkaser) 102 (902) 2019-03-05 14:17:35
#21 Ulrich Dorobeck (Papageno) 102 (3927) 2019-03-06 16:31:58
#22 Rainer Zufall (kiekuk) 102 (56786) 2019-03-07 09:54:57
#23 Viktor (Veselovský) 102 (169444) 2019-03-10 11:36:16
#24 Snake (snk) 102 (187783) 2019-03-10 13:49:10
#25 Somebody (Achidutzu) 102 (14883) 2019-03-11 15:41:55
#26 Michael (FoM) 102 (57794) 2019-03-14 15:40:07
#27 Thiago Araujo Pereira (thiagoap) 101 (701) 2019-03-21 14:22:15
#28 Joerg G. (SnifferMaster) 101 (18376) 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 (8430) 2019-04-29 10:49:10
#35 E41614001 (E41614001) 101 (6130) 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 (5496) 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 (47790) 2019-05-17 16:29:31
#43 Manfred (katatonius) 101 (2394) 2019-05-28 11:38:13
#44 Hans Joachim Girulat (joregi) 101 (36278) 2019-05-28 22:20:25
#45 Eugene (lim0n) 101 (178540) 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 (401) 2019-06-15 23:20:52
#49 Malte Spiegelberg (Caunthol) 101 (601) 2019-06-16 16:04:18
#50 Danny Higgins (hamster147) 101 (39638) 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 Gerd Wilts (gerdw) 101 (50534) 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 (148936) 2019-07-16 00:48:18
#58 kokn3t (kokn3t) 101 (101) 2019-07-22 07:02:11
#59 Kurt Gebauer (Yokozuna) 100 (282608) 2019-07-29 22:37:44
#60 M Koch (Mako) 100 (200) 2019-07-31 17:48:37
#61 J-L Morel (Rossignol) 100 (42130) 2019-08-10 17:49:09
#62 Stephan (Stephje1978) 100 (27064) 2019-08-11 19:22:23
#63 H. Lautenschlager (helmi) 100 (56470) 2019-08-15 23:15:04
#64 Denilson (denilson) 100 (900) 2019-08-23 02:24:37
#65 Alexander Berezhnoy (bereal) 100 (200) 2019-08-24 10:49:40
#66 loseroido (loseroido) 100 (200) 2019-08-28 12:15:45
#67 Mike (RogueRamblers) 100 (75961) 2019-08-29 00:43:08
#68 João Souza (jahjoao) 100 (300) 2019-09-05 19:25:21
#69 Marco (Pacius95) 100 (100) 2019-09-09 18:18:03
#70 zxcnxc (zxcnxc) 100 (100) 2019-09-10 17:43:23
#71 Daniel Walder (ibex) 100 (14672) 2019-09-20 22:47:08
#72 Julian (Lemmynator) 100 (20822) 2019-10-10 11:20:01
#73 Em Doulgerakis (Greko) 100 (193799) 2019-10-19 15:54:34
#74 pcback (langkhach11112) 100 (4860) 2019-10-25 04:45:05
#75 Aris (ArisCrypto) 100 (400) 2019-10-25 16:59:41
#76 knittin (girl) 100 (100) 2019-11-03 07:08:08
#77 ROHIT (blacksnow123) 100 (100) 2019-11-08 13:06:51
#78 POORNAPRAGNA (fiery_wizard) 100 (100) 2019-11-08 13:13:13
#79 Timm Knape (itmm) 100 (5847) 2019-11-10 18:48:57
#80 Hans Peter (hanspeter) 100 (52356) 2019-11-17 14:47:27
#81 Terence (tec) 100 (8237) 2019-11-26 11:58:57
#82 Karl Schutt (günter) 100 (44374) 2019-12-20 15:51:55
#83 Ayushi Panth (Butterfly) 100 (100) 2019-12-30 12:44:33
#84 CHRIS (TWISM) 100 (500) 2020-01-03 21:45:24
#85 Pastor (Pastor) 100 (100) 2020-01-05 01:11:16
#86 Naomi (alittlebitbehind) 100 (100) 2020-01-18 18:28:21
#87 Jasmin (Miles) 100 (8987) 2020-01-19 23:29:19
#88 Dave (foldingChair) 100 (2085) 2020-01-29 12:37:39
#89 Xaav (xaav) 100 (1100) 2020-02-06 17:02:15
#90 clyto (clytorock) 100 (3595) 2020-02-08 01:00:09
#91 Dusan (xxdradus) 100 (40436) 2020-02-14 11:06:51
#92 Helium3 (He3) 100 (100) 2020-02-19 16:33:33
#93 madness (madness) 100 (71592) 2020-02-24 08:05:41
#94 Mir Dim (mir0soft) 100 (79760) 2020-02-29 10:58:16
#95 Kim (GlobalHeJiminy) 100 (300) 2020-03-05 22:04:03
#96 Thomas (Thomas4897) 100 (36141) 2020-03-07 07:54:08
#97 Kaspar (f.kaspar) 100 (200) 2020-03-09 14:08:00
#98 mglarragan (mglarragan) 100 (3774) 2020-03-17 18:45:27
#99 Anabel Roschmann (Beltiona Mousa) 100 (4919) 2020-03-18 04:27:11
#100 Pascal Cotret (Pa0x73cal) 100 (100) 2020-03-21 11:55:44
#101 cworstell (ace2) 100 (6270) 2020-03-21 23:37:16
#102 Gergely Simon (george314) 100 (17850) 2020-05-01 23:50:16
#103 Martin (Ehmpunkt) 100 (1100) 2020-06-06 14:20:04
#104 Will Bonasera (Vermentis) 100 (4789) 2020-06-19 20:41:26
#105 Georgius Stolte (HazmatsFear) 100 (16071) 2020-07-11 09:45:46
#106 DS (DS8279) 100 (29732) 2020-07-22 15:45:57
#107 Nofre Tete (noffi) 100 (26507) 2020-08-02 10:04:04
#108 Ryan (RyanCTF) 100 (100) 2020-08-07 17:54:36
#109 Sanfo David Agyo (Holmes555) 100 (700) 2020-08-07 17:55:43
#110 Kevin Shepherd (kshepherd) 100 (2391) 2020-08-25 12:31:06
#111 David Shepherd (dshepherd) 100 (2189) 2020-08-25 12:32:50
#112 Leonhard (leonharx) 100 (2972) 2020-09-10 18:03:10
#113 Bernd (tryone144) 100 (8066) 2020-09-11 22:26:01
#114 E41714060 (E41714060) 100 (3450) 2020-09-16 05:03:55
#115 E41714028 (E41714028) 100 (6018) 2020-09-16 05:09:07
#116 Polaris (Polaris) 100 (32963) 2020-09-19 14:53:25
#117 Klaus (kumaus) 100 (22017) 2020-10-16 22:32:52
#118 Ashish Agarwal (CRLannister) 100 (100) 2020-10-27 06:30:44
#119 E41714032 (E41714032) 100 (3450) 2020-10-29 06:51:35
#120 Ines (bufo01) 100 (5676) 2020-10-30 09:42:21
#121 Enigmatic (Enigmatic) 100 (11604) 2020-10-31 00:42:24
#122 Jeason Tom (E41714045) 100 (5235) 2020-10-31 14:40:57
#123 E41714007 (E41714007) 100 (7504) 2020-10-31 15:10:15
#124 mystery_to3 (mystery_to3) 100 (3350) 2020-11-01 09:55:38
#125 E41714008 (E41714008..) 100 (2367) 2020-11-03 12:55:46
#126 William Duncan (Williand2) 100 (800) 2020-12-10 16:15:56
#127 Chris Murray (christopherm8) 100 (700) 2020-12-31 03:01:15
#128 Hank (hanky) 100 (24373) 2021-02-02 16:47:19
#129 Alexander W. Janssen (itnomad) 100 (10782) 2021-02-14 10:33:04
#130 Jörg Schwarzwälder (secuso) 100 (2827) 2021-02-27 12:07:09
#131 amir (V5November) 100 (13344) 2021-02-28 20:37:16
#132 m (umsyt) 100 (9300) 2021-03-13 17:32:55
#133 Immo Weber (MandelToast) 100 (10362) 2021-03-24 16:15:57
#134 imad (imad) 100 (3687) 2021-03-30 23:16:59
#135 Michael Ammon (Ammonym) 100 (10120) 2021-04-25 22:54:48
#136 Eric (ExAstris) 100 (54941) 2021-04-30 00:04:57
#137 JCR (Jericho) 100 (8470) 2021-05-05 20:55:38
#138 gordon (sir5) 100 (16181) 2021-05-11 16:31:10
#139 Luigi Tomelli (archstanton) 100 (127538) 2021-05-19 19:50:42
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] - 5 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 (#5) Achieved points (Global score) y-m-d - h:m:s

Armin Krauss (argh) 1824 (206965) 2018-12-10 15:47:26
Viktor (Veselovský) 1613 (169444) 2018-12-13 15:15:16
D3d4lu5 (D3d4lu5) 1315 (363488) 2019-01-14 08:37:31
Eugene (lim0n) 1163 (178540) 2019-10-30 12:18:39
#5 Snake (snk) 1160 (187783) 2019-11-14 21:04:35
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 (36141) 2018-12-11 15:50:54
Viktor (Veselovský) 2000 (169444) 2018-12-11 15:52:01
You must be logged in to solve the challenge


Cryptanalysis Hacking Puzzles — Part 1

[martins-01] - 26 users already solved this challenge, 27 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 (#26) Achieved points (Global score) y-m-d - h:m:s

Viktor (Veselovský) 200 (169444) 2018-10-26 22:47:28
D3d4lu5 (D3d4lu5) 200 (363488) 2018-10-27 08:18:21
Dominik M. (Sgt. Pepper) 200 (128575) 2018-10-27 14:30:52
Random Dude (rnd) 150 (103645) 2018-10-28 01:43:34
#5 Snake (snk) 150 (187783) 2018-10-28 17:45:23
#6 E.T (Ertheb) 150 (81809) 2018-10-28 18:58:04
#7 Armin Krauss (argh) 117 (206965) 2018-11-01 19:25:26
#8 Rainer Zufall (kiekuk) 113 (56786) 2018-11-03 12:57:49
#9 Kurt Gebauer (Yokozuna) 113 (282608) 2018-11-03 15:32:07
#10 H. Lautenschlager (helmi) 113 (56470) 2018-11-03 17:33:23
#11 Alain Collignon (vexilla72) 111 (123666) 2018-11-04 11:04:29
#12 Hans Peter (hanspeter) 108 (52356) 2018-11-08 18:35:37
#13 Johnatan (RazorBest) 103 (1105) 2018-12-03 17:38:42
#14 Michael (FoM) 102 (57794) 2018-12-27 19:40:37
#15 S (Zyphe) 101 (13361) 2019-01-13 16:47:18
#16 v1k1ng (v1k1ng) 101 (101) 2019-01-21 22:25:16
#17 Hughes (hughes) 101 (8430) 2019-04-30 09:51:16
#18 Hans Joachim Girulat (joregi) 100 (36278) 2019-05-28 15:38:03
#19 Eugene (lim0n) 100 (178540) 2019-06-12 11:03:04
#20 david (sexton) 100 (2801) 2019-07-01 10:52:43
#21 J-L Morel (Rossignol) 100 (42130) 2019-08-10 17:08:53
#22 Luigy (Luigy) 100 (402) 2020-02-09 16:44:05
#23 Mike (RogueRamblers) 100 (75961) 2020-05-18 23:47:00
#24 DS (DS8279) 100 (29732) 2020-09-04 16:00:34
#25 Enigmatic (Enigmatic) 100 (11604) 2020-10-31 06:27:00
#26 Luigi Tomelli (archstanton) 100 (127538) 2021-05-18 10:12:16
You must be logged in to solve the challenge


Breaking a Filter Generator

[cli-03] - 19 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 (#19) Achieved points (Global score) y-m-d - h:m:s

Kurt Gebauer (Yokozuna) 1824 (282608) 2018-09-26 21:06:06
Viktor (Veselovský) 1725 (169444) 2018-09-27 22:20:26
roehm (roehm) 1725 (5399) 2018-09-28 00:56:29
D3d4lu5 (D3d4lu5) 1725 (363488) 2018-09-28 02:01:18
#5 Alain Collignon (vexilla72) 1660 (123666) 2018-09-28 16:19:20
#6 S Combes (jerva) 1660 (242717) 2018-09-29 13:49:15
#7 Nicolas (nicosPavlov) 1469 (257791) 2018-10-06 07:29:57
#8 E.T (Ertheb) 1385 (81809) 2018-10-15 13:04:25
#9 George Lasry (george4096) 1330 (399565) 2018-10-27 02:15:58
#10 Random Dude (rnd) 1318 (103645) 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 (148936) 2019-08-06 16:56:35
#14 Eugene (lim0n) 1161 (178540) 2019-08-30 12:17:05
#15 Snake (snk) 1156 (187783) 2019-10-05 09:29:41
#16 Noam Gutterman (Noam528) 1150 (1150) 2019-12-02 11:44:58
#17 madness (madness) 1138 (71592) 2020-04-27 13:55:25
#18 Em Doulgerakis (Greko) 1122 (193799) 2021-03-07 14:14:24
#19 Luigi Tomelli (archstanton) 1119 (127538) 2021-06-04 19:29:37
You must be logged in to solve the challenge


Autokey Cipher

[cli-02] - 134 users already solved this challenge, 7 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 (#134) Achieved points (Global score) y-m-d - h:m:s

Snake (snk) 200 (187783) 2018-09-25 16:08:04
Viktor (Veselovský) 200 (169444) 2018-09-25 22:11:53
Michael Möller (michaelm) 200 (253196) 2018-09-25 22:32:51
Kurt Gebauer (Yokozuna) 200 (282608) 2018-09-26 02:53:02
#5 Armin Krauss (argh) 200 (206965) 2018-09-26 09:50:09
#6 H. Lautenschlager (helmi) 150 (56470) 2018-09-26 19:27:39
#7 Random Dude (rnd) 150 (103645) 2018-09-26 20:28:17
#8 Em Doulgerakis (Greko) 150 (193799) 2018-09-26 20:50:58
#9 Alain Collignon (vexilla72) 150 (123666) 2018-09-27 11:05:50
#10 Dominik M. (Sgt. Pepper) 150 (128575) 2018-09-27 11:50:12
#11 Nicolas (nicosPavlov) 133 (257791) 2018-09-27 18:41:45
#12 D3d4lu5 (D3d4lu5) 133 (363488) 2018-09-28 06:16:40
#13 Murat Kaya (mksecurity) 133 (133) 2018-09-28 08:50:51
#14 Joerg G. (SnifferMaster) 125 (18376) 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 (123216) 2018-09-29 17:44:10
#18 sarah b (silva) 117 (47847) 2018-10-01 10:03:13
#19 S (Zyphe) 114 (13361) 2018-10-01 16:30:16
#20 Lane Williams (planetlane) 113 (34637) 2018-10-02 18:45:46
#21 Jörg Schwarzwälder (secuso) 113 (2827) 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 (127538) 2018-10-09 09:55:33
#28 Nofre Tete (noffi) 106 (26507) 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 (5496) 2018-10-14 23:31:28
#32 j.h. (haegarq) 104 (15352) 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 (3595) 2018-11-03 13:42:10
#39 Hans Peter (hanspeter) 102 (52356) 2018-11-08 18:43:25
#40 madness (madness) 102 (71592) 2018-11-15 02:30:32
#41 steven (steven18) 102 (3091) 2018-11-25 13:56:37
#42 Karl Schutt (günter) 101 (44374) 2018-12-02 08:45:33
#43 Johnatan (RazorBest) 101 (1105) 2018-12-03 18:06:20
#44 zuben c3 (zuben-c3) 101 (27154) 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 (57794) 2019-01-15 01:34:57
#54 mglarragan (mglarragan) 101 (3774) 2019-01-20 11:02:50
#55 Oliver H (AlfheriH) 101 (804) 2019-02-23 15:07:06
#56 George Lasry (george4096) 101 (399565) 2019-02-23 20:06:46
#57 Raudah (Sandouk) 101 (301) 2019-03-05 20:33:00
#58 Ulrich Dorobeck (Papageno) 101 (3927) 2019-03-05 22:32:20
#59 Somebody (Achidutzu) 101 (14883) 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 (8430) 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 (47790) 2019-05-17 16:43:09
#69 Martin (LordMartin) 100 (402) 2019-05-21 15:39:54
#70 Hans Joachim Girulat (joregi) 100 (36278) 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 (39638) 2019-06-19 12:01:06
#75 Mike (RogueRamblers) 100 (75961) 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 Gerd Wilts (gerdw) 100 (50534) 2019-07-06 22:40:34
#79 Malte Spiegelberg (Caunthol) 100 (601) 2019-07-11 19:27:05
#80 Bart den Hartog (Bart13) 100 (148936) 2019-07-15 23:54:28
#81 ajg (ludimus) 100 (12114) 2019-07-29 00:04:29
#82 robot (imnotarobot) 100 (100) 2019-08-01 02:07:35
#83 Gerben Blom (Gerben) 100 (6566) 2019-08-10 12:01:51
#84 Stephan (Stephje1978) 100 (27064) 2019-08-17 19:02:34
#85 Alexander Berezhnoy (bereal) 100 (200) 2019-08-24 15:36:17
#86 Igor (Doring) 100 (900) 2019-09-11 07:17:38
#87 Julian (Lemmynator) 100 (20822) 2019-09-16 19:19:21
#88 Anon (Blue112) 100 (500) 2019-09-22 14:41:48
#89 Eugene (lim0n) 100 (178540) 2019-09-22 16:24:36
#90 David (dvd) 100 (3813) 2019-09-25 16:45:45
#91 Derek Hatton (alfred_noble) 100 (33998) 2019-10-02 15:14:57
#92 Eric (ExAstris) 100 (54941) 2019-10-26 01:36:12
#93 Aris (ArisCrypto) 100 (400) 2019-10-26 16:04:55
#94 Alain Terieur (Alain) 100 (6510) 2019-11-02 15:38:30
#95 Timm Knape (itmm) 100 (5847) 2019-11-10 20:27:51
#96 Jasmin (Miles) 100 (8987) 2019-11-17 14:53:11
#97 0bliviate (0bliviate) 100 (8634) 2019-11-19 21:26:11
#98 Terence (tec) 100 (8237) 2019-11-26 12:41:59
#99 Gábor (SirAbacus) 100 (5481) 2019-12-12 05:26:58
#100 Martin (martinbucher) 100 (38365) 2019-12-22 20:09:10
#101 CHRIS (TWISM) 100 (500) 2020-01-03 21:34:07
#102 Roman Seefeld (Antares) 100 (15543) 2020-01-08 18:47:13
#103 Sam (Degu) 100 (100) 2020-01-10 15:45:56
#104 Chris (Narga) 100 (600) 2020-02-03 17:52:46
#105 Luigy (Luigy) 100 (402) 2020-02-09 16:49:38
#106 r karoly (r_karoly) 100 (4278) 2020-02-11 20:45:07
#107 Mir Dim (mir0soft) 100 (79760) 2020-02-29 11:39:47
#108 Dusan (xxdradus) 100 (40436) 2020-02-29 14:10:13
#109 george (george90) 100 (100) 2020-03-03 10:49:27
#110 Thomas (Thomas4897) 100 (36141) 2020-03-07 07:14:50
#111 Matthias Thomas (vollhonk) 100 (800) 2020-03-08 11:35:47
#112 J-L Morel (Rossignol) 100 (42130) 2020-03-29 15:53:52
#113 cworstell (ace2) 100 (6270) 2020-04-15 04:50:25
#114 py0neer (py0neer) 100 (750) 2020-06-15 10:52:20
#115 Georgius Stolte (HazmatsFear) 100 (16071) 2020-07-17 20:43:02
#116 DS (DS8279) 100 (29732) 2020-08-04 23:04:55
#117 Will Bonasera (Vermentis) 100 (4789) 2020-08-05 07:23:46
#118 Leonhard (leonharx) 100 (2972) 2020-09-10 18:16:44
#119 Polaris (Polaris) 100 (32963) 2020-09-20 15:34:57
#120 Klaus (kumaus) 100 (22017) 2020-10-17 21:38:28
#121 Ines (bufo01) 100 (5676) 2020-10-18 15:00:34
#122 Nicky (Wokini) 100 (18494) 2020-11-30 10:04:50
#123 Ronny (kadenbach) 100 (1100) 2021-01-05 19:00:34
#124 Jean-Francois (Muskrat) 100 (19013) 2021-01-06 14:53:15
#125 Alexander W. Janssen (itnomad) 100 (10782) 2021-01-13 21:07:01
#126 amir (V5November) 100 (13344) 2021-01-16 16:31:35
#127 Hank (hanky) 100 (24373) 2021-02-02 18:23:09
#128 m (umsyt) 100 (9300) 2021-03-11 20:08:02
#129 Enigmatic (Enigmatic) 100 (11604) 2021-03-17 21:35:25
#130 Silvia Kortmann (mikinsget) 100 (20341) 2021-03-20 20:07:17
#131 gordon (sir5) 100 (16181) 2021-04-08 11:12:44
#132 Michael Ammon (Ammonym) 100 (10120) 2021-04-25 22:43:01
#133 JCR (Jericho) 100 (8470) 2021-05-03 20:26:42
#134 Claus Appelt (Konubixe) 100 (8066) 2021-05-04 20:58:42
You must be logged in to solve the challenge


Modular Sequences

[cli-01] - 57 users already solved this challenge, 28 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 (#57) Achieved points (Global score) y-m-d - h:m:s

Em Doulgerakis (Greko) 200 (193799) 2018-09-25 15:30:49
Snake (snk) 200 (187783) 2018-09-25 17:05:31
Viktor (Veselovský) 200 (169444) 2018-09-25 21:39:20
Kurt Gebauer (Yokozuna) 200 (282608) 2018-09-26 02:12:29
#5 Armin Krauss (argh) 200 (206965) 2018-09-26 09:53:20
#6 H. Lautenschlager (helmi) 150 (56470) 2018-09-26 17:43:13
#7 Random Dude (rnd) 150 (103645) 2018-09-26 20:55:07
#8 Dominik M. (Sgt. Pepper) 150 (128575) 2018-09-27 11:43:26
#9 Alain Collignon (vexilla72) 150 (123666) 2018-09-27 12:26:17
#10 D3d4lu5 (D3d4lu5) 133 (363488) 2018-09-28 06:52:02
#11 S (Zyphe) 114 (13361) 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 (127538) 2018-10-11 14:59:10
#15 Rainer Zufall (kiekuk) 103 (56786) 2018-11-01 19:44:48
#16 Hans Peter (hanspeter) 102 (52356) 2018-11-15 07:33:53
#17 madness (madness) 102 (71592) 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 (18376) 2018-11-22 14:48:02
#21 Johnatan (RazorBest) 101 (1105) 2018-12-05 11:00:20
#22 Michael (FoM) 101 (57794) 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 (22017) 2019-03-19 16:35:44
#27 Darchicourt (Darki) 101 (3308) 2019-04-09 13:56:41
#28 Hughes (hughes) 100 (8430) 2019-04-30 13:12:00
#29 Luth (Luthorien) 100 (800) 2019-05-15 13:13:01
#30 Norbert Biermann (Norbert) 100 (47790) 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 (27064) 2019-07-16 20:26:31
#34 Bart den Hartog (Bart13) 100 (148936) 2019-07-22 05:03:16
#35 Chung Nguyen Huy Hoang (CNHHoang) 100 (700) 2019-08-03 06:41:55
#36 Derek Hatton (alfred_noble) 100 (33998) 2019-09-24 17:50:27
#37 Eugene (lim0n) 100 (178540) 2019-09-30 11:53:08
#38 Danny Higgins (hamster147) 100 (39638) 2019-10-09 17:33:46
#39 Terence (tec) 100 (8237) 2019-11-27 04:49:50
#40 Martin (martinbucher) 100 (38365) 2019-12-20 17:11:53
#41 mks (audra) 100 (600) 2019-12-30 07:04:32
#42 Luigy (Luigy) 100 (402) 2020-02-10 01:35:51
#43 Karl Schutt (günter) 100 (44374) 2020-03-17 15:52:42
#44 Mike (RogueRamblers) 100 (75961) 2020-03-24 01:03:57
#45 Karaldo (Karaldo) 100 (500) 2020-04-17 11:38:10
#46 Nofre Tete (noffi) 100 (26507) 2020-05-29 01:37:46
#47 Jeason Tom (E41714045) 100 (5235) 2020-09-16 03:36:46
#48 Yulia (Yulia) 100 (100) 2020-09-16 13:44:16
#49 George (Theofanidis) 100 (123216) 2020-10-20 16:35:38
#50 sarah b (silva) 100 (47847) 2020-10-26 09:19:39
#51 Bernd (tryone144) 100 (8066) 2020-11-24 21:48:21
#52 Lorenzo (Casalino) 100 (800) 2020-12-06 01:41:28
#53 Fabian (XP-72) 100 (4110) 2020-12-11 15:52:22
#54 DS (DS8279) 100 (29732) 2020-12-20 22:37:18
#55 Jörg Schwarzwälder (secuso) 100 (2827) 2021-02-28 12:58:08
#56 m (umsyt) 100 (9300) 2021-03-11 20:02:55
You must be logged in to solve the challenge


Trendy Messenger

[minihold-03] - 31 users already solved this challenge, 2 are 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 (#31) Achieved points (Global score) y-m-d - h:m:s

D3d4lu5 (D3d4lu5) 2000 (363488) 2018-06-13 01:04:34
Kurt Gebauer (Yokozuna) 2000 (282608) 2018-06-13 11:25:42
Dominik M. (Sgt. Pepper) 1824 (128575) 2018-06-13 14:33:57
Viktor (Veselovský) 1725 (169444) 2018-06-14 19:05:40
#5 Alain Collignon (vexilla72) 1547 (123666) 2018-06-19 07:44:33
#6 George (Theofanidis) 1523 (123216) 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 (54941) 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 (20341) 2018-06-29 10:26:04
#13 Armin Krauss (argh) 1398 (206965) 2018-06-29 14:25:48
#14 Nicolas (nicosPavlov) 1330 (257791) 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 (193799) 2018-07-30 16:34:08
#18 Karl Schutt (günter) 1278 (44374) 2018-08-06 05:43:46
#19 Javantea (Javantea) 1218 (40816) 2018-10-10 03:19:11
#20 Random Dude (rnd) 1212 (103645) 2018-10-22 22:43:50
#21 kilink (kilink) 1200 (8053) 2018-11-19 00:27:26
#22 Snake (snk) 1199 (187783) 2018-11-23 16:13:11
#23 Rainer Zufall (kiekuk) 1199 (56786) 2018-11-23 21:37:49
#24 Luigi Tomelli (archstanton) 1191 (127538) 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 (178540) 2019-05-13 11:02:50
#28 Bart den Hartog (Bart13) 1153 (148936) 2019-07-22 17:30:41
#29 Bernd (tryone144) 1131 (8066) 2020-04-26 16:38:14
#30 madness (madness) 1131 (71592) 2020-04-27 16:40:02
#31 Marco Cinelli (Snap) 1129 (37769) 2020-06-05 09:37:44
You must be logged in to solve the challenge


Fastest in the West

[minihold-01] - 30 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 (#30) Achieved points (Global score) y-m-d - h:m:s

Kurt Gebauer (Yokozuna) 2000 (282608) 2018-06-13 03:24:07
D3d4lu5 (D3d4lu5) 2000 (363488) 2018-06-13 07:45:23
Alain Collignon (vexilla72) 2000 (123666) 2018-06-13 10:36:19
Dominik M. (Sgt. Pepper) 1824 (128575) 2018-06-14 13:22:36
#5 Viktor (Veselovský) 1725 (169444) 2018-06-14 16:21:58
#6 George (Theofanidis) 1660 (123216) 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 (54941) 2018-06-21 18:56:13
#11 Alain (Integral) 1485 (207924) 2018-06-22 00:15:18
#12 Snake (snk) 1469 (187783) 2018-06-22 22:48:21
#13 Armin Krauss (argh) 1398 (206965) 2018-06-29 15:27:43
#14 Nicolas (nicosPavlov) 1391 (257791) 2018-07-01 04:20:26
#15 Christophe BORELLY (cb34) 1385 (12358) 2018-07-02 11:31:03
#16 George Lasry (george4096) 1367 (399565) 2018-07-04 23:19:04
#17 Em Doulgerakis (Greko) 1288 (193799) 2018-07-30 15:10:17
#18 Michael Möller (michaelm) 1233 (253196) 2018-09-16 15:06:39
#19 Random Dude (rnd) 1212 (103645) 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 (127538) 2018-12-16 10:43:50
#23 Kasia (kasia-tutej) 1187 (53366) 2018-12-31 16:12:51
#24 Bart den Hartog (Bart13) 1153 (148936) 2019-07-22 21:37:01
#25 Eugene (lim0n) 1152 (178540) 2019-08-01 14:43:32
#26 Dr. Peter Uelkes (RandyWaterhouse) 1150 (9990) 2019-08-18 12:10:20
#27 Karl Schutt (günter) 1139 (44374) 2020-01-01 12:07:46
#28 madness (madness) 1135 (71592) 2020-02-28 17:56:18
#29 Marco Cinelli (Snap) 1129 (37769) 2020-06-06 16:02:43
#30 DS (DS8279) 1121 (29732) 2020-12-20 11:20:19
You must be logged in to solve the challenge


Summer Job

[minihold-02] - 45 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 (#45) Achieved points (Global score) y-m-d - h:m:s

Kurt Gebauer (Yokozuna) 2000 (282608) 2018-06-12 21:37:26
E.T (Ertheb) 2000 (81809) 2018-06-12 21:48:19
Viktor (Veselovský) 2000 (169444) 2018-06-12 23:34:15
D3d4lu5 (D3d4lu5) 2000 (363488) 2018-06-13 06:19:26
#5 Alain Collignon (vexilla72) 1824 (123666) 2018-06-13 15:53:42
#6 Dominik M. (Sgt. Pepper) 1725 (128575) 2018-06-14 22:17:14
#7 George (Theofanidis) 1613 (123216) 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 (54941) 2018-06-22 04:38:27
#11 Alain (Integral) 1469 (207924) 2018-06-23 10:16:28
#12 Silvia Kortmann (mikinsget) 1433 (20341) 2018-06-26 01:36:50
#13 Armin Krauss (argh) 1406 (206965) 2018-06-28 20:33:36
#14 George Lasry (george4096) 1367 (399565) 2018-07-04 22:04:09
#15 Snake (snk) 1330 (187783) 2018-07-13 21:05:10
#16 Nicolas (nicosPavlov) 1327 (257791) 2018-07-15 05:49:19
#17 Mihail (plexor) 1324 (16827) 2018-07-16 09:04:57
#18 Em Doulgerakis (Greko) 1294 (193799) 2018-07-27 15:28:14
#19 Karl Schutt (günter) 1279 (44374) 2018-08-04 21:30:42
#20 Hans Joachim Girulat (joregi) 1278 (36278) 2018-08-05 17:41:25
#21 Andrei Gasparovici (fullofvim) 1261 (1861) 2018-08-18 07:52:36
#22 Random Dude (rnd) 1217 (103645) 2018-10-13 03:24:44
#23 Rainer Zufall (kiekuk) 1206 (56786) 2018-11-03 12:37:24
#24 Hans Peter (hanspeter) 1204 (52356) 2018-11-08 18:53:31
#25 kilink (kilink) 1200 (8053) 2018-11-18 22:14:22
#26 Luigi Tomelli (archstanton) 1191 (127538) 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 (26507) 2019-01-08 21:53:11
#30 zuben c3 (zuben-c3) 1184 (27154) 2019-01-11 10:59:35
#31 Eugene (lim0n) 1161 (178540) 2019-05-12 13:21:42
#32 Marco Cinelli (Snap) 1160 (37769) 2019-05-21 13:00:26
#33 Gerd Wilts (gerdw) 1153 (50534) 2019-07-14 17:26:39
#34 Bart den Hartog (Bart13) 1153 (148936) 2019-07-16 05:21:53
#35 Karl (Aureon) 1143 (2534) 2019-10-30 10:44:19
#36 Lane Williams (planetlane) 1139 (34637) 2019-12-25 21:18:35
#37 Andrei Palangean (palangeanad) 1136 (1136) 2020-02-10 11:55:24
#38 madness (madness) 1132 (71592) 2020-04-21 03:46:01
#39 Bernd (tryone144) 1126 (8066) 2020-08-09 20:09:41
#40 Polaris (Polaris) 1126 (32963) 2020-08-10 01:00:10
#41 Derek Hatton (alfred_noble) 1122 (33998) 2020-11-14 20:15:52
#42 Nicky (Wokini) 1122 (18494) 2020-11-17 13:57:34
#43 DS (DS8279) 1122 (29732) 2020-11-19 21:40:39
#44 Somebody (Achidutzu) 1117 (14883) 2021-04-25 21:14:06
#45 Claude Vaillancourt (Cl3v3r) 1116 (44129) 2021-05-23 19:22:30
You must be logged in to solve the challenge


Weakened ElsieFour — Part 2

[rotthaler-08] - 0 users already solved this challenge, 2 are 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] - 4 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 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 (#4) Achieved points (Global score) y-m-d - h:m:s

George (Theofanidis) 1200 (123216) 2018-10-06 20:53:41
Michael Möller (michaelm) 1176 (253196) 2019-01-02 09:55:59
D3d4lu5 (D3d4lu5) 1138 (363488) 2019-11-28 19:27:00
Eugene (lim0n) 1115 (178540) 2021-05-10 19:34:04
You must be logged in to solve the challenge


Number Sequence — Part 10

[strauss-01] - 100 users already solved this challenge, 17 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 (#100) Achieved points (Global score) y-m-d - h:m:s

Armin Krauss (argh) 200 (206965) 2018-04-18 18:25:13
Kurt Gebauer (Yokozuna) 200 (282608) 2018-04-18 20:22:55
H. Lautenschlager (helmi) 200 (56470) 2018-04-18 20:29:36
Viktor (Veselovský) 200 (169444) 2018-04-18 20:31:10
#5 Nofre Tete (noffi) 200 (26507) 2018-04-18 22:28:44
#6 Snake (snk) 200 (187783) 2018-04-19 10:02:11
#7 Lucio (lcalderonc) 150 (1251) 2018-04-19 19:24:03
#8 Dominik M. (Sgt. Pepper) 150 (128575) 2018-04-19 22:11:26
#9 S (Zyphe) 150 (13361) 2018-04-19 23:07:58
#10 D3d4lu5 (D3d4lu5) 133 (363488) 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 (123216) 2018-05-27 17:04:16
#21 Danny Higgins (hamster147) 102 (39638) 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 (15352) 2018-06-06 08:38:06
#26 Georgius Stolte (HazmatsFear) 102 (16071) 2018-06-06 20:55:45
#27 Alain Collignon (vexilla72) 102 (123666) 2018-06-07 16:49:46
#28 Kim H. S. (tenchijin) 102 (25468) 2018-06-07 22:01:45
#29 Nicolas (nicosPavlov) 102 (257791) 2018-06-10 05:55:54
#30 jack (jack_) 102 (303) 2018-06-18 16:58:32
#31 Random Dude (rnd) 101 (103645) 2018-07-07 05:49:00