Re: A New Encryption Algorithm
Available news archives: comp.lang.tcl - comp.lang.python - comp.security.firewalls - sci.crypt - comp.lang.php - comp.lang.javascript
Google
 
Web news.hping.org


sci.crypt archive

Re: A New Encryption Algorithm

From: Unruh <unruh-spam@physics.ubc.ca>
Date: Sun Jan 15 2006 - 03:13:38 CET

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

>On 13 Jan 2006 16:09:39 -0800, "Tom St Denis" <tomstdenis@gmail.com>
>wrote, in part:

>>He wrote a=b=5 mod 12 which means a and b are congruent to 5 mod 12.

>Yes, I assume he meant that. If he meant that b was congruent to 5 mod
>12, and a equalled b, the cipher would indeed not be hard to break, but
>I think we should interpret what is said in the most reasonable way.

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.
Received on Tue Jan 17 16:50:39 2006