Re: A New Encryption Algorithm

healyd@classicnet.net writes:

>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.

So I choose b-a=12 (yes I am pretty sure that there are two such primes
such that a mod 12=5 and b=a+12 is also prime). Then n is 12 and the
encryption algorithm is trivial to break. (x must be less than 12 for there
to be a unique relation between x and c, and searching through 12 messages
is not hard. )

So, maybe you meant something different from what you said.
Received on Tue Jan 17 16:50:24 2006