Team of Computer Scientists Has Set a New Record for Decoding Encryption Keys
An international group of computer scientists had set a new record for two important computational problems, which can be the basis for almost all the public-key cryptography that’s currently used in the real world.
Public-key cryptography is used in a variety of applications, including encrypting sensitive and confidential information and digital signatures. In public-key cryptography, keys are available in pairs, one public, and one private, and the safety of the encryption or digital signature scheme depends on the truth that it’s believed to be computationally intractable to calculate the private key from the public key. Factoring and discrete logarithm are two of those fundamental problems which are believed to be challenging to resolve.
The group factored the largest key yet, a 795-bit integer, and in addition, computed a separate logarithm of a 795-bit integer. In total, it took them around 35 million hours of computation time.
The key sizes damaged by this file computation usually are not usually utilized in observe by fashionable cryptographic purposes. Nonetheless, attaining standard computational information is important to replace cryptographic safety parameters and key measurement suggestions.
Since both the computational information for factoring and discrete log have been achieved concurrently for the same size integers and on the same computational hardware, this work influences the understanding of the scientific group on the related issue of those two issues. It was usually believed that the discrete logarithm downside was a minimum of ten times more difficult than factoring. This work shows that the difference is much less, on the order of a factor of three.