Hello, hope all is well.
I was wondering if I might ask about hashing efficiency. I am reiteratively
hashing values. Basic algorithm is:
digestCntxt = PK11_CreateDigestContext(algorithm);
while (counter < configuredIterations)
{
PK11_DigestBegin(digestCntxt);
PK11_DigestOp(digestCntxt, input, inputLgth);
PK11_DigestFinal(digestCntxt, digest, &digestLgth, 32);
/* On next iteration, the digest becomes the input */
Copy(input, digest, 32);
}
PK11_DestroyContext(digestCntxt, PR_TRUE);
I was just wondering if this is the most efficient way. Obviously, the faster
it is, the more iterations can be configured, the longer it would take to
produce a look-up table, the more secure the solution.
Any comments most gratefully received.
Sam.
_______________________________________________
dev-tech-crypto mailing list
dev-tech-crypto@lists.mozilla.org
https://lists.mozilla.org/listinfo/dev-tech-crypto
