# A mighty number falls

##### May 21, 2007

Mathematicians and number buffs have their records. And today, an international team has broken a long-standing one in an impressive feat of calculation.

On March 6, computer clusters from three institutions – the EPFL, the University of Bonn and NTT in Japan -- reached the end of eleven months of strenuous calculation, churning out the prime factors of a well-known, hard-to-factor number that is a whopping 307 digits long.

"This is the largest 'special' hard-to-factor number factored to date," explains EPFL cryptology professor Arjen Lenstra. (The number is 'special' because it has a special mathematical form -- it is close to a power of two.) The news of this feat will grab the attention of information security experts and may eventually lead to changes in encryption techniques.

Although it is relatively easy to identify huge prime numbers, factoring, or breaking a number down into its prime components, is extremely difficult. RSA encryption, named for the three individuals who devised the technique (Ronald Rivest, Adi Shamir and Leonard Adleman), takes advantage of this. Using the RSA method, information is encrypted using a large composite number, usually 1024 bits in size, created by multiplying together two 150-or-so digit prime numbers. Only someone who knows those two numbers, the "keys", can read the message. Because there is a vast supply of large prime numbers, it's easy to come up with unique keys. Information encrypted this way is secure, because no one has ever been able to factor these huge numbers. At least not yet.

The most recent factoring record is RSA200, a 200-digit 'non-special' number whose two prime factors were identified in 2005 after 18 months of calculations that took over a half century of computer time.

The international team factored the current 307-digit behemoth using the "special number field sieve," a method devised in the late 1980s by Lenstra (then at Bellcore), his brother Hendrik, then a professor at UC Berkeley, English mathematician John Pollard and Mark Manasse from DEC. The 11-month job took a century of computer time.

A feat like this would have been unthinkable back in 1990 when Lenstra started applying number theory and distributed computing to the task of breaking factoring records. Increased computer power and refined computational techniques have raised the bar, and will continue to do so. "We have more powerful computers, we have come up with better ways to map the algorithm onto the architecture, and we take better advantage of cache behavior," Lenstra explains.

Is the writing on the wall for 1024-bit encryption" "The answer to that question is an unqualified yes," says Lenstra. For the moment the standard is still secure, because it is much more difficult to factor a number made up of two huge prime numbers, such as an RSA number, than it is to factor a number like this one that has a special mathematical form. But the clock is definitely ticking. "Last time, it took nine years for us to generalize from a special to a non-special hard-to factor number (155 digits). I won't make predictions, but let's just say it might be a good idea to stay tuned."

Source: Ecole Polytechnique Fédérale de Lausanne

Explore further: Researchers crack unassailable encryption algorithm in two hours

## Related Stories

#### Researchers crack unassailable encryption algorithm in two hours

May 20, 2014

(Phys.org) —A protocol based on "discrete logarithms", deemed as one of the candidates for the Internet's future security systems, was decrypted by EPFL researchers. Allegedly tamper-proof, it could only stand up to the ...

## Recommended for you

#### Study of accreditation exams reveals biases actually favor women in STEM positions

July 29, 2016

(Phys.org)—A pair of researchers with the Paris School of Economics in France has conducted an analysis of competitive exam results that are used as a basis for hiring teachers in that country and has found that there exists ...

#### Researchers scan most complete heterodontosaurus skeleton ever found

July 29, 2016

The ESRF had an extraordinary and ancient visitor this week: the most complete fossil skeleton ever found of the small plant-eating dinosaur, heterondontosaurus tucki, which roamed the earth 200 million years ago. This exceptional ...

#### Sudden extinction of Neanderthals followed population peak

July 26, 2016

Neanderthals once populated the entire European continent. Around 45,000 years ago, Homo neanderthalensis was the predominant human species in Europe. Archaeological findings show that there were also several settlements ...

#### Experimentation suggests Vikings could have used sunstone to navigate

July 27, 2016

(Phys.org)—A team of researchers from several institutions in Hungary has conducted experiments meant to test the possibility that the Vikings actually did use sunstones to navigate. In their paper published in Proceedings ...

#### Mexico finds water tunnels under Pakal tomb in Palenque

July 25, 2016

Archaeologists at the Mayan ruin site of Palenque said Monday they have discovered an underground water tunnel built under the Temple of Inscriptions, which houses the tomb of an ancient ruler named Pakal.

#### DNA analyses reveal genetic identities of world's first farmers

July 25, 2016

Conducting the first large-scale, genome-wide analyses of ancient human remains from the Near East, an international team led by Harvard Medical School has illuminated the genetic identities and population dynamics of the ...