![]() It's going to be years before everyone has made the move. "It's important to get ahead of the curve because the transition is likely to be very long, since we're talking about all software that encrypts or signs. But it is possible that we will build an efficient quantum computer in a few years," explains Pierre-Alain Fouque, professor at the University of Rennes 1, member of IRISA (Inria/CNRS/University of Rennes 1) and co-author of FALCON. They can do better than classical computers, but only for a given problem, built specifically. "We are still a long way from that, current quantum computers are not very expressive. In other words: what exists today will be broken by a sufficiently powerful quantum computer. ![]() However, rapid advances in quantum technology now make these machines much closer to us than they were in the mid-nineties, bringing current cryptographic protocols closer to their expiration date. Since then, many scientists have predicted the more or less distant arrival of a quantum computer capable of breaking a cryptographic protocol within a reasonable time. Thus, all devices using RSA or elliptic curves would become breakable by a third party if Shor's algorithm were ever programmed into a quantum computer. In 1994, the American mathematician Peter Shor shook up the world of computer security by discovering a technique (later named " Shor's algorithm") capable of considerably reducing the time needed to solve the difficult problems on which public key cryptography security is based, thus making it possible to efficiently break codes that generally resist for thousands of years.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |