from Hacker News

Ask HN: How can i verify perfect secrecy of a cryptosystem?

by sgy on 7/30/15, 5:36 PM with 16 comments

i'm playing with an encryption algorithm (demo: https://www.youtube.com/watch?v=h1kABn5dfXc). how can i prove it's information-theoretically secure?
  • by bmm6o on 7/30/15, 6:53 PM

    Your key is too short - it's not possible for it to be information-theoretically secure. That's just one of its obvious faults: it looks like it doesn't even work all of the time, the system generates a key instead of taking on as input, the data undergoes unnecessary expansion, etc etc etc.