Re: A New Encryption Algorithm

jsavard@excxn.aNOSPAMb.cdn.invalid (John Savard) writes:

>On 15 Jan 2006 02:13:38 GMT, Unruh <unruh-spam@physics.ubc.ca> wrote, in
>part:

>>Yes, but is b=a+12 it is also not hard to break. In fact b-a had better be
>>pretty large for this to be a reasonable cypher.

>Yes, but you could say the same thing about RSA; if p-q = 2 it would
>fall quickly to Fermat factorization. I didn't see anything in his post
>that implied b=a+12.

Choose ANY a and b such that a=b=5 mod 12
The point is that if a and b are close to each other then it is obvious
from the encryped messages c<b mod a that this is true, and it is easy to
break. (Note that b mod a is also always a multiple of 12)

>John Savard
>http://www.quadibloc.com/index.html
>_________________________________________
>Usenet Zone Free Binaries Usenet Server
>More than 140,000 groups
>Unlimited download
>http://www.usenetzone.com to open account
Received on Tue Jan 17 16:50:42 2006