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

PanamaHash< B > Class Template Reference

#include <panama.h>

Inheritance diagram for PanamaHash< B >:

Panama< B > AlgorithmImpl< IteratedHash< word32, NativeByteOrder, 32 >, PanamaHash< B > > IteratedHash< word32, NativeByteOrder, 32 > IteratedHashBase< word32, HashTransformation > HashTransformation Algorithm Clonable List of all members.

Detailed Description

template<class B = LittleEndian>
class PanamaHash< B >

Panama Hash

Definition at line 29 of file panama.h.

Public Types

enum  { DIGESTSIZE = 32 }
typedef NativeByteOrder ByteOrderClass
typedef word32 HashWordType

Public Member Functions

unsigned int DigestSize () const
 size of the hash returned by Final()
void TruncatedFinal (byte *hash, size_t size)
 truncated version of Final()
std::string AlgorithmName () const
 returns name of this algorithm, not universally implemented yet
ByteOrder GetByteOrder () const
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, size_t length)
 process more input
byte * CreateUpdateSpace (size_t &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, 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 ClonableClone () const
 this is not implemented by most classes yet

Static Public Member Functions

const char * StaticAlgorithmName ()
void CorrectEndianess (HashWordType *out, const HashWordType *in, size_t byteCount)

Static Public Attributes

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

Protected Types

typedef word32 Stage [8]
enum  { STAGES = 32 }

Protected Member Functions

void Init ()
void HashEndianCorrectedBlock (const word32 *data)
size_t HashMultipleBlocks (const word32 *input, size_t length)
void Reset ()
void Iterate (size_t count, const word32 *p=NULL, word32 *z=NULL, const word32 *y=NULL)
void SetBlockSize (unsigned int blockSize)
void SetStateSize (unsigned int stateSize)
word32 GetBitCountHi () const
word32 GetBitCountLo () const
void PadLastBlock (unsigned int lastBlockSize, byte padFirst=0x80)
virtual void HashEndianCorrectedBlock (const HashWordType *data)=0
void HashBlock (const HashWordType *input)
void ThrowIfInvalidTruncatedSize (size_t size) const

Protected Attributes

FixedSizeSecBlock< word32,
17 *2+STAGES *sizeof(Stage) 
m_state )
unsigned int m_bstart
SecBlock< word32 > m_data
SecBlock< word32 > 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 534 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 560 of file cryptlib.h.


The documentation for this class was generated from the following files:
Generated on Tue Aug 16 08:38:51 2005 for Crypto++ by  doxygen 1.3.9.1