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

Whirlpool Class Reference

#include <whrlpool.h>

Inheritance diagram for Whirlpool:

IteratedHashWithStaticTransform< word64, BigEndian, 64, 64, Whirlpool > ClonableImpl< Whirlpool, AlgorithmImpl< IteratedHash< word64, BigEndian, T_BlockSize >, Whirlpool > > AlgorithmImpl< IteratedHash< word64, BigEndian, T_BlockSize >, Whirlpool > IteratedHash< word64, BigEndian, T_BlockSize > IteratedHashBase2< word64, BigEndian, HashTransformation > IteratedHashBase< word64, HashTransformation > HashTransformation Algorithm Clonable List of all members.

Detailed Description

Whirlpool

512 Bit Hash

Definition at line 14 of file whrlpool.h.

Public Types

typedef BigEndian ByteOrderClass
typedef IteratedHashBase<
word64, HashTransformation
>::HashWordType 
HashWordType

Public Member Functions

void TruncatedFinal (byte *hash, unsigned int size)
 truncated version of Final()
unsigned int DigestSize () const
 size of the hash returned by Final()
ClonableClone () const
 this is not implemented by most classes yet
std::string AlgorithmName () const
 returns name of this algorithm, not universally implemented yet
 IteratedHashBase ()
unsigned int BlockSize () const
 block size of underlying compression function, or 0 if not block based
unsigned int OptimalBlockSize () const
 input to Update() should have length a multiple of this for optimal speed
unsigned int OptimalDataAlignment () const
 returns how input should be aligned for optimal performance
void Update (const byte *input, unsigned int length)
 process more input
byte * CreateUpdateSpace (unsigned int &size)
 request space to write input into
void Restart ()
 discard the current state, and restart with a new message
virtual void Final (byte *digest)
 compute hash for current message, then restart for a new message
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 TruncatedVerify (const byte *digest, unsigned int digestLength)
 truncated version of Verify()
virtual bool VerifyTruncatedDigest (const byte *digest, unsigned int digestLength, const byte *input, unsigned int length)
 truncated version of VerifyDigest()

Static Public Member Functions

static void InitState (HashWordType *state)
static void Transform (word64 *digest, const word64 *data)
static const char * StaticAlgorithmName ()
static void CorrectEndianess (HashWordType *out, const HashWordType *in, unsigned int byteCount)

Static Public Attributes

static CompileAssert<((BLOCKSIZE
&(BLOCKSIZE-1))==0) 
cryptopp_assert___LINE__ )

Protected Member Functions

 IteratedHashWithStaticTransform ()
void HashEndianCorrectedBlock (const word64 *data)
virtual void HashEndianCorrectedBlock (const HashWordType *data)=0
void Init ()
 IteratedHash ()
void HashBlock (const HashWordType *input)
virtual void HashBlock (const word64 *input)=0
void SetBlockSize (unsigned int blockSize)
void SetStateSize (unsigned int stateSize)
word64 GetBitCountHi () const
word64 GetBitCountLo () const
virtual unsigned int HashMultipleBlocks (const word64 *input, unsigned int length)
void PadLastBlock (unsigned int lastBlockSize, byte padFirst=0x80)
void ThrowIfInvalidTruncatedSize (unsigned int size) const

Protected Attributes

SecBlock< word64 > m_data
SecBlock< word64 > m_digest


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 PSSR_MEM_Base::ComputeMessageRepresentative(), PKCS1v15_SignatureMessageEncodingMethod::ComputeMessageRepresentative(), EMSA5Pad< T >::ComputeMessageRepresentative(), PKCS5_PBKDF2_HMAC< T >::DeriveKey(), DefaultEncryptor::FirstPut(), HashFilter::Put2(), PSSR_MEM_Base::RecoverMessageFromRepresentative(), HMAC_Base::TruncatedFinal(), ZlibCompressor::WritePoststreamTail(), and Gzip::WritePoststreamTail().

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.

Referenced by HashVerificationFilter::LastPut(), Gunzip::ProcessPoststreamTail(), and PSSR_MEM_Base::RecoverMessageFromRepresentative().


The documentation for this class was generated from the following files:
Generated on Sun Jul 3 00:21:13 2005 for Crypto++ by  doxygen 1.4.3-20050530