MysteryTwister C3
NUMBER OF ACTIVE MEMBERS:

9593
Follow us: Facebook Twitter
 



Level II Challenges (118)

Page 1 of the challenges in Level II, ordered by date posted (the most recent appear first).

Handycipher made in love — Part 2

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

Armin Krauss (argh) 2000 (185115) 2019-05-21 19:53:02
D3d4lu5 (D3d4lu5) 2000 (273573) 2019-05-21 22:37:28
Viktor (Veselovský) 2000 (151602) 2019-05-21 23:37:36
Kurt Gebauer (Yokozuna) 2000 (153663) 2019-05-22 04:17:23
#5 Alain Collignon (vexilla72) 2000 (87833) 2019-05-22 11:15:40
#6 Michael Möller (michaelm) 2000 (173129) 2019-05-22 12:28:56
#7 Danny Higgins (hamster147) 2000 (31494) 2019-05-22 12:46:19
#8 Dominik M. (Sgt. Pepper) 2000 (97919) 2019-05-22 15:03:47
#9 Eugene (lim0n) 1824 (22155) 2019-05-23 13:37:11
#10 George (Theofanidis) 1725 (106715) 2019-05-23 23:00:36
You must be logged in to solve the challenge


Homophonic Encryption — Part 4

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

Viktor (Veselovský) 2000 (151602) 2019-05-09 00:56:19
Snake (snk) 2000 (77889) 2019-05-09 14:10:58
Armin Krauss (argh) 2000 (185115) 2019-05-09 17:58:49
George Lasry (george4096) 2000 (299488) 2019-05-09 20:48:39
#5 D3d4lu5 (D3d4lu5) 1824 (273573) 2019-05-10 18:25:33
#6 E.T (Ertheb) 1613 (78180) 2019-05-13 19:52:53
#7 Random Dude (rnd) 1456 (83811) 2019-05-20 13:42:29
#8 Dominik M. (Sgt. Pepper) 1444 (97919) 2019-05-21 18:51:04
You must be logged in to solve the challenge


Homophonic Encryption — Part 3

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

Homophonic encryption is a modified version of the monoalphabetic substitution: One plaintext symbol can be substituted by more than one ciphertext symbol. In part 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 (#12) Achieved points (Global score) y-m-d - h:m:s

Viktor (Veselovský) 2000 (151602) 2019-05-09 00:41:40
Alain Collignon (vexilla72) 2000 (87833) 2019-05-09 10:44:10
Dominik M. (Sgt. Pepper) 2000 (97919) 2019-05-09 13:01:44
Snake (snk) 2000 (77889) 2019-05-09 13:48:05
#5 D3d4lu5 (D3d4lu5) 2000 (273573) 2019-05-09 17:16:18
#6 Armin Krauss (argh) 2000 (185115) 2019-05-09 17:34:33
#7 George Lasry (george4096) 2000 (299488) 2019-05-09 20:51:40
#8 Kurt Gebauer (Yokozuna) 1660 (153663) 2019-05-12 09:56:05
#9 E.T (Ertheb) 1613 (78180) 2019-05-13 19:39:06
#10 Random Dude (rnd) 1469 (83811) 2019-05-19 06:21:43
#11 Eugene (lim0n) 1469 (22155) 2019-05-19 07:57:08
#12 sarah b (silva) 1444 (18511) 2019-05-21 10:23:59
You must be logged in to solve the challenge


Homophonic Encryption — Part 2

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

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

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

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

All successful users of this challenge

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

George Lasry (george4096) 1725 (299488) 2019-05-10 22:02:30
Armin Krauss (argh) 1725 (185115) 2019-05-10 22:04:09
Snake (snk) 1725 (77889) 2019-05-10 22:29:03
Alain Collignon (vexilla72) 1725 (87833) 2019-05-10 23:47:11
#5 Viktor (Veselovský) 1725 (151602) 2019-05-11 00:58:36
#6 H. Lautenschlager (helmi) 1725 (32747) 2019-05-11 19:53:59
#7 Kurt Gebauer (Yokozuna) 1725 (153663) 2019-05-11 20:56:51
#8 E.T (Ertheb) 1613 (78180) 2019-05-13 19:28:56
#9 D3d4lu5 (D3d4lu5) 1576 (273573) 2019-05-14 06:05:32
#10 Eugene (lim0n) 1523 (22155) 2019-05-16 13:32:40
#11 sarah b (silva) 1485 (18511) 2019-05-18 19:57:39
#12 Random Dude (rnd) 1469 (83811) 2019-05-19 05:44:02
#13 George (Theofanidis) 1469 (106715) 2019-05-19 16:12:16
#14 Dominik M. (Sgt. Pepper) 1433 (97919) 2019-05-22 15:21:28
#15 Danny Higgins (hamster147) 1423 (31494) 2019-05-22 21:56:59
You must be logged in to solve the challenge


Homophonic Encryption — Part 1

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

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

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

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

All successful users of this challenge

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

Snake (snk) 0 (77889) 2019-05-04 20:15:46
Armin Krauss (argh) 2000 (185115) 2019-05-04 23:35:06
D3d4lu5 (D3d4lu5) 2000 (273573) 2019-05-05 04:23:38
Kurt Gebauer (Yokozuna) 2000 (153663) 2019-05-05 13:33:42
#5 H. Lautenschlager (helmi) 2000 (32747) 2019-05-05 13:50:31
#6 Dominik M. (Sgt. Pepper) 2000 (97919) 2019-05-05 15:17:09
#7 George (Theofanidis) 2000 (106715) 2019-05-05 19:47:28
#8 Marc (rcll0891) 1824 (24004) 2019-05-05 22:43:25
#9 Alain Collignon (vexilla72) 1824 (87833) 2019-05-06 11:43:14
#10 E.T (Ertheb) 1824 (78180) 2019-05-06 14:05:14
#11 Viktor (Veselovský) 1824 (151602) 2019-05-06 19:00:08
#12 Michael Möller (michaelm) 1725 (173129) 2019-05-06 22:40:30
#13 George Lasry (george4096) 1660 (299488) 2019-05-07 22:40:03
#14 sarah b (silva) 1523 (18511) 2019-05-12 10:44:07
#15 Eugene (lim0n) 1469 (22155) 2019-05-15 14:53:33
#16 Random Dude (rnd) 1444 (83811) 2019-05-17 03:56:02
#17 Danny Higgins (hamster147) 1398 (31494) 2019-05-22 17:04:47
You must be logged in to solve the challenge
 
 
powered by the CrypTool project  CrypTool

 

   +++    [11:29 - 24.05.2019] dokyriak solved the Level II challenge 'Cracking SHA1-Hashed Passwords'    +++    [11:16 - 24.05.2019] dokyriak solved the Level I challenge 'Factorization Cipher — Part 1'    +++    [23:00 - 23.05.2019] Theofanidis solved the Level II challenge 'Handycipher made in love — Part 2'    +++    [19:57 - 23.05.2019] joregi solved the Level I challenge 'Autokey Cipher'    +++    [15:18 - 23.05.2019] Biork solved the Level I challenge 'A modified homophonic cipher with reduced alphabets — Part 1'    +++