YMN The Young Mathematicians' Network
Serving the Community of Young Mathematicians
Sections: Front Page   Job Search   Grad Life   Career   Work and Family Life   Editors   Misc   Research   Teaching   Undergrad Life   Events   News
Display: Sort:
Big news in Number Theory | 1 comment (1 topical, 0 hidden)
[new] Still slower than Rubin-Miller (none / 0) (#1)
by SeminoleNo1 on Fri Aug 30, 2002 at 03:18:52 AM PDT

It is supposedly still much slower than Rubin-Miller, but maybe someone will be inspired by it to produce a faster one.

Still, R-M only "verifies" probablistic primes, so for solidified security, this is good news -- if you can afford or need the time.





Big news in Number Theory | 1 comment (1 topical, 0 hidden)
Display: Sort:

Menu
create account
FAQ
Search
Recent Comments

Login
Make a new account
Username:
Password:

SourceForge Logo Powered by Scoop
All trademarks and copyrights on this page are owned by their respective companies. Comments are owned by the Poster. The Rest

create account | faq | search