The discussion centers on the concept of perfect data security and its feasibility. Participants reference the Entropy theorem, which establishes limits on lossless compression, and draw parallels to the notion that a theorem may exist proving the impossibility of achieving perfect data security. While one-time pads are mentioned as a theoretically perfect security method, their practical application is criticized for being inelegant and complex. The consensus leans towards the idea that absolute security is unattainable in practical scenarios.
PREREQUISITESSecurity analysts, cryptographers, and anyone interested in the theoretical foundations of data security and its practical limitations.
sid_galt said:Just like there is the Entropy theorem which proves that you can perform lossless compression only upto a certain limit, is there a theorem which proves that perfect Security of data is impossible?