Hello,
I would like to implement TLS PRF with CryptoPP.
So I need to use HMAC<>, though what is unclear is the effect of final
in relation to setKey. Do I have to call setKey for every new hash
generation ? Is there an efficient way to implement this PRF ?
I have to compute the different A(i) recursively and calling final() is
obviously not the way to do it.
In the same track I planned to use HMAC to compute padding data. The
padding data would be the A(i) stored in sequence and A(0) would be the
message MAC. So I have the same problem as for PRF computation. I need
to get the digest out of the object and do another update using the digest.
A last question. I see bigendian as template arguments in many places.
What does it mean ? I am using a little endian machine. Any impact on
performance ? Where would I have to worry about endianess ?
The biggest weakness of this library is its terse documentation.
