Inheritance diagram for PK_MessageAccumulatorImpl< HASH_ALGORITHM >:
Public Member Functions | |
| HashTransformation & | AccessHash () |
| virtual HashTransformation & | AccessHash ()=0 |
| void | Update (const byte *input, size_t length) |
| process more input | |
| unsigned int | DigestSize () const |
| should not be called on PK_MessageAccumulator | |
| void | TruncatedFinal (byte *digest, size_t digestSize) |
| should not be called on PK_MessageAccumulator | |
| HashTransformation & | Ref () |
| return a reference to this object, useful for passing a temporary object to a function that takes a non-const reference | |
| virtual byte * | CreateUpdateSpace (size_t &size) |
| request space to write input into | |
| virtual void | Final (byte *digest) |
| compute hash for current message, then restart for a new message | |
| virtual void | Restart () |
| discard the current state, and restart with a new message | |
| unsigned int | TagSize () const |
| same as DigestSize() | |
| virtual unsigned int | BlockSize () const |
| block size of underlying compression function, or 0 if not block based | |
| virtual unsigned int | OptimalBlockSize () const |
| input to Update() should have length a multiple of this for optimal speed | |
| virtual unsigned int | OptimalDataAlignment () const |
| returns how input should be aligned for optimal performance | |
| virtual void | CalculateDigest (byte *digest, const byte *input, size_t length) |
| use this if your input is in one piece and you don't want to call Update() and Final() separately | |
| virtual bool | Verify (const byte *digest) |
| verify that digest is a valid digest for the current message, then reinitialize the object | |
| virtual bool | VerifyDigest (const byte *digest, const byte *input, size_t length) |
| use this if your input is in one piece and you don't want to call Update() and Verify() separately | |
| virtual void | CalculateTruncatedDigest (byte *digest, size_t digestSize, const byte *input, size_t length) |
| truncated version of CalculateDigest() | |
| virtual bool | TruncatedVerify (const byte *digest, size_t digestLength) |
| truncated version of Verify() | |
| virtual bool | VerifyTruncatedDigest (const byte *digest, size_t digestLength, const byte *input, size_t length) |
| truncated version of VerifyDigest() | |
| virtual std::string | AlgorithmName () const |
| returns name of this algorithm, not universally implemented yet | |
| virtual Clonable * | Clone () const |
| this is not implemented by most classes yet | |
Public Attributes | |
| SecByteBlock | m_recoverableMessage |
| SecByteBlock | m_representative |
| SecByteBlock | m_presignature |
| SecByteBlock | m_semisignature |
| Integer | m_k |
| Integer | m_s |
| bool | m_empty |
Protected Member Functions | |
| void | ThrowIfInvalidTruncatedSize (size_t size) const |
Protected Attributes | |
| HASH_ALGORITHM | m_object |
Detailed Description
template<class HASH_ALGORITHM>
class PK_MessageAccumulatorImpl< HASH_ALGORITHM >
Definition at line 302 of file pubkey.h.
Member Function Documentation
| virtual void HashTransformation::Final | ( | byte * | digest | ) | [inline, virtual, inherited] |
compute hash for current message, then restart for a new message
- Precondition:
- size of digest == DigestSize().
Definition at line 545 of file cryptlib.h.
Referenced by PKCS5_PBKDF2_HMAC< T >::DeriveKey(), and HMAC_Base::TruncatedFinal().
| virtual bool HashTransformation::Verify | ( | const byte * | digest | ) | [inline, virtual, inherited] |
verify that digest is a valid digest for the current message, then reinitialize the object
Default implementation is to call Final() and do a bitwise comparison between its output and digest.
Definition at line 575 of file cryptlib.h.
The documentation for this class was generated from the following file:
Generated on Mon Aug 9 2010 15:57:48 for Crypto++ by
1.7.1