News for hackers. Stuff that matters.
Re:Finding Mona Lisa in the Game of Life by waltbosz on Friday March 13, 2020 @04:06PM (#22570436)
I should explain ... the extent of my knowledge of data compression is pretty nil.

I could tell you how run length encoding works, but that's about it.

More than anything, it's a fantasy compression scheme.

I was originally inspired by rainbow tables (https://en.wikipedia.org/wiki/Rainbow_table) . The idea would be some sort of compression where there would be a table of uncompressed data blobs that map to some sort of hash key. The compressed file would be a sequence of the key.

If you're reading this and you have a working knowledge of data compression, I imagine this is throwing off all sorts of red flags in your head. Feel free to explain why it wouldn't work.

Re:Finding Mona Lisa in the Game of Life by ALittleLight on Friday March 13, 2020 @06:47PM (#22571536)
I could see Game of Life as part of a DIY steganography scheme. E.g. I tweet a picture and have some numerals in my tweet called N. You download the picture and convert it via an agreed on protocol to a game of life board, then advance the board by N times. Then you convert the board back to bits and then to text, and find somewhere in the text a "Message begins: XXX. Message ends." Sequence.

I wonder if you would be able to hide messages in superficially normal pictures like that.

Re:Finding Mona Lisa in the Game of Life by gus_massa on Friday March 13, 2020 @05:35PM (#22571066)
Wikipedia is always is good start and it is better written than what I can type just now. Take a look specially at the "limitations" section. https://en.wikipedia.org/wiki/Lossless_compression#Limitatio...