Decoded message was: Re: Article on PGP uses Gnupg :)
Wed Jan 15 17:50:02 2003
-----BEGIN PGP SIGNED MESSAGE-----
Am Mittwoch, 15. Januar 2003 15:03 schrieb David Shaw:
> On Wed, Jan 15, 2003 at 12:16:23PM +0200, Charly Avital wrote:
> > Let's assume that both messges, before and after encryption, are real=
> > meaning that the cyphertext is the result of the plaintext encrypted=
> > that key.
> > Let's also assume that both pict files can be scanned and OCR'd into =
> > data material, would it be possible then to retrieve the secret key (=
> > passphrase)?
> That is known as a known-plaintext attack. All algorithms used in
> OpenPGP are resistant to such attacks.
All public key systems must be resistant to such attacks because everybod=
generate as much pair plain / cipher text as he liked.
But it's only a matter of time or storage capacity and energy to crack an=
key. but the univers isn't endless only 10^80 atoms a very small number=20
compared to a 1024 or 2048 bit key.
But used symetric keys aren't as much resistant. Nevertheless I think the=
are not many private messages worth the money needed to break the key.
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.2.1 (GNU/Linux)
-----END PGP SIGNATURE-----