sci.crypt archive
A New Encryption Algorithm
From: <healyd@classicnet.net>
Date: Fri Jan 13 2006 - 21:09:26 CET
Date: Fri Jan 13 2006 - 21:09:26 CET
In protest of the NSA, I am submitting to you my newest math success:
The Sons of the Tsars encryption algorithm. This is being donated into
the public domain. This algorithm is faster than the Rabin Algorithm
and might give RSA a run for its money.
Choose any two primes such that a=b=5 mod 12. Let n=b mod a and c be
the cipher text and x be the plaintext. c=x^3 mod n. x=c^((a+1)/6)
mod n=c^((b+1)/6) mod n.
Received on Tue Jan 17 16:50:21 2006