The Friedman Ring Challenge by Norbert Biermann

Three months ago Norbert Biermann solved the challenge of George Lasry and is therefore the current bearer of the Friedman ring. Today I present Norbert’s new challenge. Whoever solves it will be his successor.

Deutsche Version

The first person to solve the current crypto puzzle creates the next one. The Friedman Ring works according to this simple principle. It is a game named after the cryptologists William and Elizebeth Friedman. It is modeled on the Iffland Ring, which has been awarded to actors for centuries.

Three months ago, the fifth round of the Friedman Ring game came to an end. The last puzzle so far came from George Lasry. Norbert Biermann was the first to solve it and thus became the new bearer of the Friedman Ring. Thomas Bosbach contributed significantly to the solution of the puzzle with his clues.

This results in the following list of bearers:

1. Frank Schwellinger
2. Anna Salpingidis und Christoph Tenzer
3. Armin Krauß
4. Christoph Tenzer
5. George Lasry
6. Norbert Biermann

There is a web page on the progress to date. The respective recipient of the Friedman ring commits himself to develop a crypto puzzle and to make it available to me. Whoever solves this puzzle first will be the new bearer.

Before I continue, I would like to point out my online lecture next Sunday at 6 pm (German time). Under the not entirely serious title “How to become a cyber criminal” I will give an entertaining overview on the topic of cybercrime. The organizer is again the ICCH group. As usual, Robert Saltzmann and Tom Perera have taken over the organization, for which I thank them very much. Participation is free of charge. The access link will be sent via the Cryptocollectors mailing list. If you are not subscribed to this list, please contact me and I will provide the link.

Norbert Biermann’s Challenge

Now let’s move on to the new Friedman Ring Challenge that Norbert sent me. Here it is:

Quelle/Source: Biermann

Here is a transcription:

NIGWM IIMHH LUENG ODSLN SLESI
ETALU ATSTA DLIEM OFHFR IEEEF
HISEO CNNST DWUEM NRIFE OAMAA
ONTCU TINDW ESEAT ENABD CYBDH
KCLIS ITTIA AUSTO KHPEG WNEOB
HIDWL EESRE SREED DNODT GOMNN
OFEFA FOTCT AFHHS REIFA NEOTS
NOECO EERTN RWMAD TAAAS RCTUP
UHHRY RDSAA INEIT LESNF ULDSI
GOFAO INTGW UHUAO DAORT BTEBV
AEWRB OETLH LURWR EOIPS CDTIH
TELEH WWVAA KLWOE FREEI DRRTI
PTNKA EIANL RJSAT IRHMU TUFAP
SSDNN OYTRT EMUHB WOOCT TSEVV
NTREE ENEMR RAETE I

Norbert has not yet provided any further information. But I am sure that he will give one or the other tip if my readers get stuck. In any case, many thanks to Norbert for this certainly very interesting challenge.

As often mentioned, one of the disadvantages of this game is that every reader hint published as a comment can help another codebreaker to win. Therefore I ask my readers not to be so selfish. If there is discussion in the forum about possible solutions, it makes things more exciting for everyone. Of course, I will acknowledge every comment that contributed to the solution accordingly.

The race is on!

If you want to add a comment, you need to add it to the German version here.
Follow @KlausSchmeh

Further reading: Christoph’s Chaotic Caesar Challenge

Linkedin: https://www.linkedin.com/groups/13501820
Facebook: https://www.facebook.com/groups/763282653806483/