|
|
|
|
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 (#12) |
Achieved points (Global score) |
y-m-d - h:m:s |
|
|
Armin Krauss (argh)
|
2000 (206664) |
2020-04-06 22:29:12 |
|
Snake (snk)
|
2000 (187650) |
2020-04-07 08:54:32 |
|
Thomas (Thomas4897)
|
2000 (35941) |
2020-04-07 14:25:54 |
|
Dominik M. (Sgt. Pepper)
|
2000 (127349) |
2020-04-07 14:59:45 |
#5 |
Kurt Gebauer (Yokozuna)
|
2000 (274906) |
2020-04-07 15:25:09 |
#6 |
Viktor (Veselovský)
|
2000 (169244) |
2020-04-07 15:49:37 |
#7 |
J-L Morel (Rossignol)
|
1433 (41038) |
2020-04-20 11:01:25 |
#8 |
D3d4lu5 (D3d4lu5)
|
1337 (359988) |
2020-05-06 18:16:08 |
#9 |
George Lasry (george4096)
|
1310 (369910) |
2020-05-14 23:52:33 |
#10 |
Norbert Biermann (Norbert)
|
1284 (47687) |
2020-05-27 15:29:25 |
#11 |
Alain Collignon (vexilla72)
|
1199 (122384) |
2020-09-16 08:49:49 |
#12 |
Michael (FoM)
|
1174 (53292) |
2020-12-18 02:33:31 |
|
|
|
|
|
You must be logged in to solve the challenge |