I wrote a program, stes[1], back in 2000 which did something similar (but less complex): it created a ciphertext C which could be decrypted to different plainte

I wrote a program, stes[1], back in 2000 which did something similar (but less complex): it created a ciphertext C which could be decrypted to different plaintexts dependent on key, so K1 produces P1, K2 produces P2, etc, and there was no way of proving there were or weren't any more keys. [1] see https://github.com/cabalamat/stes/blob/master/SPECIFICATION https://github.com/cabalamat/stes/blob/master/SPECIFICATION