Follow @Openwall on Twitter for new release announcements and other news
[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Date: Fri, 10 Aug 2012 14:09:24 -0500
From: "jfoug" <>
To: <>
Subject: RE: SRP

This protocol is trivially explained in

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

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


>From: Solar Designer []
>Here's our opportunity to start supporting SRP verifiers:

Powered by blists - more mailing lists

Confused about mailing lists and their use? Read about mailing lists on Wikipedia and check out these guidelines on proper formatting of your messages.