Hi Cryptogurus,
I'm just wondering something about something I saw in a protocol spec...
How to implement something like:
Y = X xor SHA-1(Z)
Where X is an arbitrary array of bits which may be longer or shorter than
the 160-bit output of SHA-1.
Do I have to process X by 160-bit chunks and truncate SHA-1 digest when
I encounter a final chunk < 160-bit?
Thanks,
- Xavier
---------------------
#exclude <windows.h>
/* :) */
______________________________________________________________________
OpenSSL Project http://www.openssl.org
User Support Mailing List [EMAIL PROTECTED]
Automated List Manager [EMAIL PROTECTED]
