[145269] in cryptography@c2.net mail archive
Re: [cryptography] What's the state of the art in factorization?
daemon@ATHENA.MIT.EDU (Paul Crowley)
Fri Jul 9 12:29:22 2010
Date: Fri, 23 Apr 2010 10:57:09 +0100
From: Paul Crowley <paul@ciphergoth.org>
To: Discussion of cryptography and related <cryptography@randombit.net>
CC: Zooko O'Whielacronx <zookog@gmail.com>,
tahoe-dev <tahoe-dev@allmydata.org>,
cryptography@metzdowd.com
In-Reply-To: <Pine.GSO.4.64.1004222214420.22359@ringding.cs.umd.edu>
Jonathan Katz wrote:
>>> [2] http://www.cs.umd.edu/~jkatz/papers/dh-sigs-full.pdf
> On the other hand, there is one published scheme that gives a slight
> improvement to our paper (it has fewer on-line computations): it is a
> paper by Chevallier-Mames in Crypto 2005 titled "An Efficient CDH-Based
> Signature Scheme with a Tight Security Reduction".
My preferred signature scheme is the second, DDH-based one in the linked
paper, since it produces shorter signatures - are there any proposals
which improve on that?
Incidentally, the paper doesn't note this but that second scheme has a
non-tight reduction to the discrete log problem in exactly the way that
Schnorr does.
--
__
\/ o\ Paul Crowley, paul@ciphergoth.org
/\__/ http://www.ciphergoth.org/
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com
