Bad Crypto: Chessography and Weak Randomness of Chess Games
Martin Stanek

TL;DR
This paper critically evaluates the Chessography encryption scheme, revealing its flaws, redundancy, and unjustified security claims, while also highlighting insufficient randomness in chess game positions.
Contribution
It provides a detailed critique of Chessography, demonstrating its security flaws and analyzing the randomness in chess game positions.
Findings
Chessography encryption scheme is incorrect and redundant.
Security claims based on chess complexity are unjustified.
Final chess positions exhibit insufficient randomness.
Abstract
This short communication shows that the Chessography encryption scheme is incorrect, redundant, and the the security claims based on the complexity of chess games are unjustified. It also demonstrates an insufficient randomness in the final chess game positions, which could be of separate interest.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
