Main Page | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | File Members

TruncatedHashTemplate< T > Class Template Reference

#include <trunhash.h>

Inheritance diagram for TruncatedHashTemplate< T >:

HashTransformation Algorithm Clonable List of all members.

Detailed Description

template<class T>
class TruncatedHashTemplate< T >

construct new HashModule with smaller DigestSize() from existing one

Definition at line 19 of file trunhash.h.

Public Member Functions

 TruncatedHashTemplate (T hm, unsigned int digestSize)
 TruncatedHashTemplate (const byte *key, unsigned int keyLength, unsigned int digestSize)
 TruncatedHashTemplate (unsigned int digestSize)
void Update (const byte *input, unsigned int length)
 process more input
unsigned int DigestSize () const
 size of the hash returned by Final()
void TruncatedFinal (byte *digest, unsigned int digestSize)
 truncated version of Final()
bool TruncatedVerify (const byte *digest, unsigned int digestLength)
 truncated version of Verify()
virtual byte * CreateUpdateSpace (unsigned int &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
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, unsigned int 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, unsigned int 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, unsigned int digestSize, const byte *input, unsigned int length)
 truncated version of CalculateDigest()
virtual bool VerifyTruncatedDigest (const byte *digest, unsigned int digestLength, const byte *input, unsigned int 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

Protected Member Functions

void ThrowIfInvalidTruncatedSize (unsigned int size) const


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 537 of file cryptlib.h.

Referenced by PKCS5_PBKDF2_HMAC< T >::DeriveKey(), HashFilter::Put2(), 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 563 of file cryptlib.h.


The documentation for this class was generated from the following file:
Generated on Sat Aug 28 17:25:05 2004 for Crypto++ by doxygen 1.3.8