A team of computer scientists along with an Indian-origin student from the University of Texas at Austin has created a new highly advanced algorithm to generate a set of completely random numbers that will increase the security of encrypted data by several folds.
According to the scientists, the new method consumes very less computational resources and takes a lot lesser time in producing truly random numbers when compared to all other existing methods. Computer analysts believe that the new algorithm will make it even more tougher for hackers to break in as it will enhance the security of almost everything from banking, online transactions to military purposes, etc.
David Zuckerman, computer science professor revealed that he came across this problem nearly two decades ago and he is happy to solve the problem by designing a much efficient algorithm to enhance the security.
Zuckerman explained that the new methods takes two simple random numbers as inputs and then converts them into one sequence of truly random numbers.
He further added that weak random numbers like temperature readings and stock prices become predictable over time, however, truly random numbers have no sequences and they remain random with respect to time like a coin toss.
“When I heard about it, I couldn’t sleep,” said Yael Kalai, senior researcher working in cryptography at Microsoft Research New England. “I was so excited. I couldn’t believe it. I ran to the ( online ) archive to look at the paper. It’s really a masterpiece,” he added.
The new method will be used in data encryption. It will generate completely random keys making it hard for hackers to crack the sequence and obtain the keys for decrypting the data. Implementing true randomness in the keys has been the limiting factor in the encryption, but this can now the removed, believe researchers.
The new method will be presented at the annual Symposium on Theory of Computing (STOC) in Cambridge, Massachusetts, in June.