"Randomness Theory Could Hold Key to Internet Security"

The question about whether there is an unbreakable code has been central to cryptography and efforts to maintain the security of personal information on the internet. In a new paper, titled "On One-Way Functions and Kolmogorov Complexity," Cornell Tech researchers identified a natural 'mother' problem with cryptography that could hold the key to whether all encryption schemes and digital signatures can be broken. The research also shows a connection between two areas of mathematics and computer science: cryptography and algorithmic information theory, also known as the theory of Kolmogorov complexity. This article continues to discuss the result of this study and its potential impact on internet security.

Science Daily reports "Randomness Theory Could Hold Key to Internet Security"