The Existence of True One Way Functions Depends on Komogorov Complexity

cryptographers long wondered whether there's a less adhak approach, or at least it is questional tere there exist some problem that tells us if toptography is possible. Now pass and ane leo have shown that the answer is yes. The existence of true one way functions depends on one of the oldest and most central problems in computer science - komogorov complexity. It concerns how hard it is to tell the difference between random strings of numbers and strings that contain some information.