On Tue, May 22, 2001 at 08:38:28AM -0700, David Honig wrote:
> At 08:00 PM 5/21/01 -0500, Aimee Farr wrote:
> >http://papers.ssrn.com/sol3/papers.cfm?abstract_id=266153
>
> Summary: toss your key and let them brute force your diary in the future.
>
> Problem: a brute force attack searches on *average* half the key space.
> But you might be unlucky and eager 'historians' might find your key sooner.
>
> Solution: repeat the process N times sequentially. Even if one key is
> found 'early', its unlikely that all will.
Nice addition to the protocol. I hadn't thought of that.
Yes, the paper isn't that novel; it's very derivative. The one interesting
twist was relying on an algorithm where the factoring can't be easily
parallelized.
-Declan
