New Algorithm Can Compromise Encryption
In a world where it is becoming harder and harder to seal the access to digital information, the most used strategy consists in the encryption of storage and transfer of data with advanced security algorithms. However, as it turns out, even those are becoming insecure.
Researchers from the University of Lorraine (France) and the Paris 6 Informatics Lab have solved a problem in the discrete logarithm, in which most of encryption systems used nowadays are based.
In algorithm theory, one of the greatest aspects still to be solved has now been cleared by the creation of a new algorithm, that compromises a variant of the discrete logarithm problem. This algorithm is being study since 1976, and this result has been presented in the international conference Eurocrypt 2014 held in Copenhagen, Denmark, last May. This discovery brings discredit to several encryption systems that, until now, were seen as safe enough. For now, this is still a theoretical result and is supposed that it will have influence in Smart Card systems and RFID chips.
Encryptions are nothing more than mathematical problems with severe difficulty, even though we have powerful computational capabilities and advanced algorithms. This new algorithm, described in this article, stands apart all other proposed so far to solve this problem, not only due to its high (and improved) complexity, but also because it is easily explained and understood by everyone.
Basically, considering the solving of discrete logarithm problems with increasing capacity, the time needed by this algorithm to solve them increases in a much lower rate than other algorithms previously presented. This way, solving a problem becomes much more easier, as less resources are required. It is predicted that a computer with actual processing capacity is enough to solve some of the problems that were, until now, impossible to solve in a viable timespan.