![]() |
Available news archives:
comp.lang.tcl
-
comp.lang.python
-
comp.security.firewalls
-
sci.crypt -
comp.lang.php -
comp.lang.javascript
|
|
sci.crypt archiveRe: 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>
>>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
Yes, but is b=a+12 it is also not hard to break. In fact b-a had better be
|