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: John Savard <jsavard@excxn.aNOSPAMb.cdn.invalid>
Date: Wed Jan 18 2006 - 04:24:01 CET



On 16 Jan 2006 05:19:05 GMT, Unruh <unruh-spam@physics.ubc.ca> wrote, in


part:



>Choose ANY a and b such that a=b=5 mod 12



That's clearly wrong. Since n is "b mod a", and n is supposed to be a


number such that c = x^3 mod n is hard to crack, clearly n must not be


prime. And a and b must both be prime.



Thus, a must be big - and b must be much bigger.



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 Thu Jan 19 03:44:39 2006