|
|
| Applications |
| Mailing Lists |
| Miscellaneous |
| Operating Systems |
| Programming |
RE: PGP scripting...
Date: Tue Jan 21 2003 - 12:13:08 EST
I'm not sure I understand the point of this message. It seems that
you are saying that you can figure out the cleartext message by taking
the n possible cleartext messages and encrypting with the known public
key until you find the cipher text. That much makes sense, but since
we were talking about encryption of bulk data it seems that the number
of possible messages would be VERY large and such an approach would
not be workable.
It seems that your comment would even argue AGAINST the "two stage" system that you're talking about. The total number of possible symmetric keys would be much less than the total number of possible messages.
But then I'm a bit of a crypto ignoramus. If you (or someone) would elaborate a bit I would be grateful.
Breck
-----Original Message-----
From: Andre Mariën [mailto:andre.marien@ubizen.com]
Sent: Thursday, January 09, 2003 1:48 AM
Cc: secprog@securityfocus.com
Subject: Re: PGP scripting...
Tom Arseneault wrote:
> As for the usage of the key in encryption and decryption, public key
Please do not use public key encryption for bulk data, even if
you accept the long times. It is a bad idea. If there are n
possible messgaes, it only takes at most n trials to decrypt
the message, no matter your key size (if the encrypting key is known;
typically it is the public key and it is known).
This problem is justification in itself to have a two stage system
for encryption of bulk data.
(there is someone at counterpane that can explain it in more detail ;-)
Received on Wed Jan 22 14:28:57 2003
This archive was generated by hypermail 2.1.8 : Wed Aug 23 2006 - 14:02:45 EDT
|
Contact Us Legal Notices Order Services Online Pantek Home Privacy Policy IT news Site Map Pantek Library |