Openwall GNU/*/Linux - a small security-enhanced Linux distro for servers
[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Date: Sat, 11 Aug 2012 06:06:01 +0400
From: Solar Designer <solar@...nwall.com>
To: john-dev@...ts.openwall.com
Subject: Re: SRP

On Fri, Aug 10, 2012 at 02:09:24PM -0500, jfoug wrote:
> Piece of cake to implement.  The bottleneck will be in the GMP expmod
> speeds.  But with N being only 256 bits, the expmod is very fast (but much
> slower than SHA1).  I used to do a lot of work with GMP (and some other fast
> exponentators), when I was coding on OpenPFGW.  For 256 bit size, and N
> being a 'non-special' number, GMP is about as fast it gets, for general
> purpose.

Great.  So can you be the one to implement this for us? :-)

Meanwhile, here's a followup post by Jeremy Spilman:

http://www.opine.me/srp-to-sha1/
"Is SRP using a 256-bit modulus fully reducible to SHA1?"

> Any chance of finding the leaked s, u, v data, to know if a format would be
> working properly?

I was not able to find the Blizzard leak quickly.  Maybe contact Jeremy
Spilman, who appears to be working on almost the same thing?

http://twitter.com/jspilman

You can try a Twitter DM if we can't find his e-mail address easily.

Alexander

Powered by blists - more mailing lists

Your e-mail address:

Powered by Openwall GNU/*/Linux - Powered by OpenVZ