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: Mon Jan 16 2006 - 03:55:13 CET



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.



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