gnu-crypto-discuss
[Top][All Lists]
Advanced

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[GNU Crypto] Fast non primality test breakthrough


From: Giuseppe Mazzotta
Subject: [GNU Crypto] Fast non primality test breakthrough
Date: Sat, 12 Mar 2005 18:51:12 +0100
User-agent: Mozilla Thunderbird 0.7 (Windows/20040616)

Hello boys,

I am an italian Physics student and I have just seen your work...huge! I would like to give my contribution to this great project, but at the moment I haven't got time.

I have created a really fast non-primality test working on prime numbers showing in about 40% of cases (don't worry, this is a deterministic value) the absolute non-primality of a number; in other cases, you'll have to check in another way...

I will soon protect the source code under a GPL license and I would like your library to get advantage from this discovery. It is fairly probable that almost every cryptographic software in next years will use this breakthrough (at this moment, I am skeptic and I am convalidating results with eminent mathematical researchers) and I will absolutely publish everything in April. I'll post again on this mailing list then.

I have sent this email just to create some "whirls" around the thing, to hear people's points of view etc. and to see if it would be useful (I hope it is!).

Contact me to know more about it.




reply via email to

[Prev in Thread] Current Thread [Next in Thread]