Uploaded September 2020 | Updated November 2026, 2 hours ago
#cryptology, #cryptography, #cryptanalysis
This is the last video of our first "Crypto Challenge Contest". For detailed descriptions of the rules, please watch the video :-)
In this video, we show the solutions of the last week's ciphertexts and we present the final best list as well as the winners of the two crypto books.
Rules (short version):
- You may break ciphertexts and win points. The one with the most points at the end of the contest wins a copy of Gaines’ book “Cryptanalysis: a study of ciphers and their solution”. Another winner will be randomly chosen from all other participants
- The contest is in no way connected to or sponsored by YouTube, Google, or Facebook
- Everyone (who is no CrypTool team member) is allowed to participate – you don’t need to be a subscriber of our channel or our Facebook page. Participation is for free
- At the end of the contest, we will delete all personal data (e.g. names and email addresses)
- The official start of the contest is the 14th August 2020
- Solutions may be sent until the release of the next contest video- The basic idea of the contest: having fun with solving crypto challenges :-)
If you are interested in learning the basics of cryptology, you should also have a look at our video series about basics of cryptology – also for beginners: youtu.be/jbumW7Ym03o
You may download the latest version of CrypTool 2 from here: cryptool.org/en/ct2/downloads
Like what I do 😄? Help fuel my crypto obsession 🎓 — buy me a coffee here☕— thx: buymeacoffee.com/cryptographyforeverybody
#cryptology, #cryptography, #cryptanalysis
This is the last video of our first "Crypto Challenge Contest". For detailed descriptions of the rules, please watch the video :-)
In this video, we show the solutions of the last week's ciphertexts and we present the final best list as well as the winners of the two crypto books.
Rules (short version):
- You may break ciphertexts and win points. The one with the most points at the end of the contest wins a copy of Gaines’ book “Cryptanalysis: a study of ciphers and their solution”. Another winner will be randomly chosen from all other participants
- The contest is in no way connected to or sponsored by YouTube, Google, or Facebook
- Everyone (who is no CrypTool team member) is allowed to participate – you don’t need to be a subscriber of our channel or our Facebook page. Participation is for free
- At the end of the contest, we will delete all personal data (e.g. names and email addresses)
- The official start of the contest is the 14th August 2020
- Solutions may be sent until the release of the next contest video- The basic idea of the contest: having fun with solving crypto challenges :-)
If you are interested in learning the basics of cryptology, you should also have a look at our video series about basics of cryptology – also for beginners: youtu.be/jbumW7Ym03o
You may download the latest version of CrypTool 2 from here: cryptool.org/en/ct2/downloads
Like what I do 😄? Help fuel my crypto obsession 🎓 — buy me a coffee here☕— thx: buymeacoffee.com/cryptographyforeverybody

![The Dining Cryptographers Problem – Did the NSA Pay?
#cryptology, #cryptography, #cryptanalysis
The dining cryptographers protocol is a cryptographic protocol invented by David Chaum in the 1980s (see [1]). It allows unconditional sender and recipient untraceability.
In the video, we describe the cryptographers problem as well as their protocol in detail. We will answer the question, if the NSA paid for their dinner or if a cryptographer paid – without revealing his identity :-). Finally, we visualize the protocol using CrypTool 2.
If you are interested in learning the fundaments of cryptology, let me invite you to have a look at our video series about the basics of cryptology, also for beginners: https://youtu.be/jbumW7Ym03o
You can download the latest version of CrypTool 2 from here: https://www.cryptool.org/en/ct2/downloads
[1] Chaum , David. The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of cryptology 1.1 (1988): 65 75.
Like what I do 😄? Help fuel my crypto obsession 🎓 — buy me a coffee here☕— thx: https://buymeacoffee.com/cryptographyforeverybody The Dining Cryptographers Problem – Did the NSA Pay?](https://i.ytimg.com/vi/DCGlOmgwY5U/mqdefault.jpg)








