A 30-Year-Old Cryptographic Challenge Is About To Be Solved

An unexpected breakthrough could suddenly make quantum computers powerful enough to threaten cryptographic codes.

The Physics arXiv Blog iconThe Physics arXiv Blog
By The Physics arXiv Blog
Jan 10, 2023 3:11 PMJan 10, 2023 4:54 PM
cryptography
(Credit:faithie/Shutterstock)

Newsletter

Sign up for our email newsletter for the latest science news
 

In 1991, the cybersecurity company, RSA Laboratories in Bedford, Massachusetts published a list of 54 increasingly large numbers that it had created by multiplying two prime numbers together. It then challenged the computer science community to factorize them — to find the original prime numbers in each case. The company even offered cash prizes for some of the solutions.

The challenge was designed to assess state-of-the-art capabilities for factoring numbers. That’s important because factoring — or more precisely its difficulty— secures various public key cryptosystems. So advanced factoring capabilities make these cryptosystems less secure.

The challenge ended in 2007 but even today 31 of these RSA numbers remain unfactored. The largest is RSA-2048, so-called because of the number of bits required to represent it.

0 free articles left
Want More? Get unlimited access for as low as $1.99/month

Already a subscriber?

Register or Log In

0 free articlesSubscribe
Discover Magazine Logo
Want more?

Keep reading for as low as $1.99!

Subscribe

Already a subscriber?

Register or Log In

Stay Curious

Sign up for our weekly newsletter and unlock one more article for free.

 

View our Privacy Policy


Want more?
Keep reading for as low as $1.99!


Log In or Register

Already a subscriber?
Find my Subscription

More From Discover
Recommendations From Our Store
Stay Curious
Join
Our List

Sign up for our weekly science updates.

 
Subscribe
To The Magazine

Save up to 40% off the cover price when you subscribe to Discover magazine.

Copyright © 2024 Kalmbach Media Co.