[11343] in cryptography@c2.net mail archive

home help back first fref pref prev next nref lref last post

Re: An authentication question

daemon@ATHENA.MIT.EDU (Matt Crawford)
Tue Aug 6 10:30:53 2002

Date: Tue, 06 Aug 2002 09:27:10 -0500
From: Matt Crawford <crawdad@fnal.gov>
In-reply-to: "05 Aug 2002 23:21:03 BST."
 <20020805222103.GB34063@colon.colondot.net>
To: Matthew Byng-Maddick <cryptography@lists.colondot.net>
Cc: cryptography@wasabisystems.com

> > In the second version, any random user (or script) could upload very large
> > files, wasting your bandwidth, and also CPU time when you check the sig. Or
> > lots and lots of really small files, which would swamp your CPU(s) trying
> > to check 500 sigs a second (makes for a good DDOS).
> 
> public key operations are significantly faster than private key ones. So it
> is far easier to check 500 sigs than to generate them in the first place.

If the sig is not going to be accepted anyway, there's no need to compute it.

---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@wasabisystems.com

home help back first fref pref prev next nref lref last post