[125179] in cryptography@c2.net mail archive
Re: Fwd: Protection mail at rest
daemon@ATHENA.MIT.EDU (Adam Aviv)
Tue Jun 3 11:25:11 2008
Date: Mon, 2 Jun 2008 22:56:54 -0400
From: "Adam Aviv" <aviv@cis.upenn.edu>
To: "Greg Black" <cryptography@mail.gbch.net>
Cc: cryptography@metzdowd.com
In-Reply-To: <nospam-1212460963.39336@joker.yaxom.com>
I agree with you, that this is not nearly fast enough.
However, this is 10 times faster then our original results, where we
were searching 100 emails in about the same amount of time. With
production code, some more optimization, esp. client side
optimizations (i.e. message caching when possible), and increased
parallelism, it may just be possible to reach the 4x faster searches a
heavy user like yourself would need. I am just not a good enough coder
to write it myself, but I believe that it can be done.
adam
On Mon, Jun 2, 2008 at 10:42 PM, Greg Black <cryptography@mail.gbch.net> wrote:
> On 2008-06-02, Adam Aviv wrote:
>
>> I recently implemented SSARES directly in python and also added
>> parallelism to the searching. We can now search the a large inbox
>> (1000+) messages in about 2-4 minutes.
>
> Not to rain on your parade, but 1,000 messages is *not* a large inbox
> and 2 to 4 minutes is a very long time to wait. You'd need to make this
> two orders of magnitude faster before it would have a hope of being
> interesting. (And for me, it would have to be at least four orders of
> magnitude faster before I could consider it to be useful.)
>
> Greg
>
--
Adam Aviv
Ph. D. Candidate
Computer and Information Science
University of Pennsylvania
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com
