[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: Canonical way to invoke the KDF?
On Nov 15, 2013, at 5:34 PM, Colin Percival <email@example.com> wrote:
> On 11/15/13 16:09, Ron Garret wrote:
>> Since we’re on this topic, I have a question/suggestion:
>>> The parameter N must be a power of 2 greater than 1.
>> It seems to me that it would be better to specify that the input parameter n should simply be a positive integer and have the computation of N=2^n be part of the scrypt algorithm. Is there a reason you didn’t do it that way?
> The scrypt algorithm is specified as operating on arbitrary N; it's just
> this particular implementation which is limited in the values it can
> I wanted the parameters of the function to match the definition of the
> algorithm it implements.
> Colin Percival
> Security Officer Emeritus, FreeBSD | The power to serve
> Founder, Tarsnap | www.tarsnap.com | Online backups for the truly paranoid