Fast math encryption challenge
<FONT SIZE=2>The American Institute of Mathematics is hosting a workshop March 24-28, 2003, to develop ways to improve processes of automatically factoring very large numbers. The meeting is being called in response to a recent discovery of a fast method of detecting large primes. This technique could weaken the encryption techniques underlying secure Internet transactions, which rely on the assumption that there is no easy method of factoring integers hundreds of digits in length.</FONT>
The American Institute of Mathematics is hosting a workshop March 24-28, 2003, to develop ways to improve processes of automatically factoring very large numbers. The meeting is being called in response to a recent discovery of a fast method of detecting large primes.
This technique could weaken the encryption techniques underlying secure Internet transactions, which rely on the assumption that there is no easy method of factoring integers hundreds of digits in length.
This technique could weaken the encryption techniques underlying secure Internet transactions, which rely on the assumption that there is no easy method of factoring integers hundreds of digits in length.
NEXT STORY: Domain name sale pending