Re: SERPENT in OpenPGP?

Jon Callas <jon@callas.org> Fri, 27 August 2010 20:08 UTC

Received: from hoffman.proper.com (localhost [127.0.0.1]) by hoffman.proper.com (8.14.4/8.14.3) with ESMTP id o7RK8j9G015429 (version=TLSv1/SSLv3 cipher=DHE-RSA-AES256-SHA bits=256 verify=NO); Fri, 27 Aug 2010 13:08:45 -0700 (MST) (envelope-from owner-ietf-openpgp@mail.imc.org)
Received: (from majordom@localhost) by hoffman.proper.com (8.14.4/8.13.5/Submit) id o7RK8jts015428; Fri, 27 Aug 2010 13:08:45 -0700 (MST) (envelope-from owner-ietf-openpgp@mail.imc.org)
X-Authentication-Warning: hoffman.proper.com: majordom set sender to owner-ietf-openpgp@mail.imc.org using -f
Received: from merrymeet.com (merrymeet.com [66.93.68.160]) by hoffman.proper.com (8.14.4/8.14.3) with ESMTP id o7RK8i4t015418 for <ietf-openpgp@imc.org>; Fri, 27 Aug 2010 13:08:45 -0700 (MST) (envelope-from jon@callas.org)
Received: from localhost (localhost [127.0.0.1]) by merrymeet.com (Postfix) with ESMTP id 0C4B42E09F for <ietf-openpgp@imc.org>; Fri, 27 Aug 2010 13:08:52 -0700 (PDT)
Received: from merrymeet.com ([127.0.0.1]) by localhost (host.domain.tld [127.0.0.1]) (amavisd-maia, port 10024) with ESMTP id 44430-08 for <ietf-openpgp@imc.org>; Fri, 27 Aug 2010 13:08:49 -0700 (PDT)
Received: from keys.merrymeet.com (keys.merrymeet.com [66.93.68.161]) (Authenticated sender: jon) by merrymeet.com (Postfix) with ESMTPA id 5454B2E071 for <ietf-openpgp@imc.org>; Fri, 27 Aug 2010 13:08:41 -0700 (PDT)
Received: from il0102a-dhcp109.apple.com ([17.201.27.237]) by keys.merrymeet.com (PGP Universal service); Fri, 27 Aug 2010 13:02:37 -0700
X-PGP-Universal: processed; by keys.merrymeet.com on Fri, 27 Aug 2010 13:02:37 -0700
Subject: Re: SERPENT in OpenPGP?
Mime-Version: 1.0 (Apple Message framework v1081)
From: Jon Callas <jon@callas.org>
In-Reply-To: <b75e8485838a16ee4d60c482582854d2@imap.dd24.net>
Date: Fri, 27 Aug 2010 13:08:31 -0700
Cc: Jon Callas <jon@callas.org>, OpenPGP Working Group <ietf-openpgp@imc.org>
Message-Id: <14881272-22F4-4232-80C5-D6AA0C9A723C@callas.org>
References: <1282856536.11340.29.camel@fermat.scientia.net> <3C0E8216-05E0-4E92-BC30-9B63CAEADF59@callas.org> <1282862498.18783.20.camel@fermat.scientia.net> <4C7761F4.1050507@iang.org> <EAF908F4-9812-4181-AE8D-616A29697530@sixdemonbag.org> <23AB7412-7309-4C95-B27A-E14119879CB9@callas.org> <b75e8485838a16ee4d60c482582854d2@imap.dd24.net>
To: Christoph Anton Mitterer <calestyo@scientia.net>
X-Mailer: Apple Mail (2.1081)
X-PGP-Encoding-Format: Partitioned
X-PGP-Encoding-Version: 2.0.2
X-Content-PGP-Universal-Saved-Content-Transfer-Encoding: quoted-printable
X-Content-PGP-Universal-Saved-Content-Type: text/plain; charset=us-ascii
Content-Type: text/plain; charset="us-ascii"
X-Virus-Scanned: Maia Mailguard
Content-Transfer-Encoding: 8bit
X-MIME-Autoconverted: from QUOTED-PRINTABLE to 8bit by hoffman.proper.com id o7RK8j4t015424
Sender: owner-ietf-openpgp@mail.imc.org
Precedence: bulk
List-Archive: <http://www.imc.org/ietf-openpgp/mail-archive/>
List-Unsubscribe: <mailto:ietf-openpgp-request@imc.org?body=unsubscribe>
List-ID: <ietf-openpgp.imc.org>

-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1

> At least to my (limited) understanding,... it seemed logical that it would
> be stronger.
> Imagine a quick factorising algorithm would be found,... RSA would be
> broken, but ElGamal not automatically,... (at least I've never heard about,
> that the factorisation problem can be transformed into the discrete
> logarithm problem).

It can. If there is a fast factoring algorithm, then there is also a fast discrete log algorithm.

	Jon


-----BEGIN PGP SIGNATURE-----
Version: PGP Universal 2.10.0 (Build 554)
Charset: us-ascii

wj8DBQFMeBndsTedWZOD3gYRAsB5AJwLSNja3YsDoTPr8AIOMscXtfSv6QCg3BSO
iIP/WjaPp5p0ykXlZZM/BUM=
=5lRB
-----END PGP SIGNATURE-----