https://github.com/jes/chess-steg

Steganography in chess games
https://github.com/jes/chess-steg

chess steganography

Last synced: about 2 months ago
JSON representation

Steganography in chess games

• Host: GitHub
• URL: https://github.com/jes/chess-steg
• Owner: jes
• Created: 2018-10-08T02:09:24.000Z (over 6 years ago)
• Default Branch: master
• Last Pushed: 2021-08-22T15:35:18.000Z (over 3 years ago)
• Last Synced: 2024-11-18T05:38:53.079Z (2 months ago)
• Topics: chess, steganography
• Language: JavaScript
• Homepage: https://incoherency.co.uk/chess-steg/
• Size: 129 KB
• Stars: 87
• Watchers: 6
• Forks: 5
• Open Issues: 1
• Metadata Files:
  • Readme: README

Awesome Lists containing this project

• awesome-anti-forensic - ChessSteg

README

        
This is a tool to encode/decode short messages as chess games.

Too unwieldy for large content, but I believe it technically has no limit on the amount of data

it can encode as it ignores draw by repetition and the 50 move rule. Perhaps it can break in some situation

where a player is left with playing a checkmate as his only legal move?

This game encodes the text "Hello, world!":

1. e3 b6 2. b3 Bb7 3. Nf3 Bxf3 4. Bd3 e6 5. h4 g6 6. b4 h5 7. gxf3 c5 8. Bb2 a5 9. Rh3 e5 10. c4 Bh6 11. Be2 Ke7 { White resigns. } 0-1

More information in my blog post: https://incoherency.co.uk/blog/stories/chess-steg.html

There is also now a (incompatible) Scala implementation of the same idea by someone called "carpetscheme": https://github.com/carpetscheme/scalachess-steg/

Please email [email protected] if you want.