Sign In

Communications of the ACM

ACM TechNews

Record Set for Cryptographic Challenge

A representation of cryptography.

An international team of computer scientists has set a record for integer factorization


A team of computer scientists in France and the U.S. has set a record for integer factorization, a major challenge in the security of most public key cryptography currently in use.

The researchers used free software created by collaborators at INRIA Nancy in France to factor the largest integer of its form to date as part of the RSA Factoring Challenges.

The integer is the product of two prime numbers that each possess 125 decimal digits, which took 2,700 years of running powerful computer cores to execute, using tens of thousands of machines worldwide over several months.

The key the researchers cracked has 829 binary bits, while modern cryptographic practice stipulates that RSA keys should be 2,048 binary bits long at minimum.

The University of California, San Diego's Nadia Heninger said, "Achieving computational records regularly is necessary to update cryptographic security parameters and key size recommendations."

From University of California San Diego Jacobs School of Engineering
View Full Article


Abstracts Copyright © 2020 SmithBucklin, Washington, DC, USA


No entries found

Sign In for Full Access
» Forgot Password? » Create an ACM Web Account