Programmers solve encryption problems 20 years ago

Ron Rivest designed encryption for a 1999 time capsule last century. Ron Rivest, R in RSA, a public key cryptography algorithm, and two others ,Adi Shamir and Leonard Adleman, won the Turing Prize in 2002 for their contributions to rsA algorithms. The encryption method he designed for time capsules is not complex, and mainly considers computational complexity, involving a square operation of about 80 trillion times.

Based on his 1999 computer computing power and Moore’s Law, he estimated that it would take 35 years to work out the answer to the question.

But in 2015, Bernard Fabrot, a self-taught programmer, discovered that he could work out the answer in a shorter period of time using the free software GNU Multiple Precision Library, and he started using a CPU core from a home PC. The heart performs calculations 24 hours a day, 7 days a week, and the results take 3 and a half years.

Programmers solve encryption problems 20 years ago

At the same time, a team of cryptophage experts, using FPGA chips that execute specific algorithms much more efficiently than high-end CPUs, took two months to work out the results. But when they informed Professor Rivest, they were told that someone had finished first.

Professor Rivest said it was a surprising coincidence that he admitted that he overestimated the difficulty of the problem and did not anticipate a technological breakthrough like the FPGA.

Add a Comment

Your email address will not be published. Required fields are marked *