#include <xormac.h>
Inheritance diagram for XMACC< T >:
If you need to generate MACs with XMACC (instead of just verifying them), you must save the counter before destroying an XMACC object and reinitialize it the next time you create an XMACC with the same key. Start counter at 0 when using a key for the first time.
Definition at line 65 of file xormac.h.
Public Types | |
| enum | |
| typedef T::ByteOrderClass | ByteOrderClass |
|
typedef IteratedHashBase< T::HashWordType, MessageAuthenticationCode >::HashWordType | HashWordType |
| enum | IV_Requirement { STRUCTURED_IV = 0, RANDOM_IV, UNPREDICTABLE_RANDOM_IV, INTERNALLY_GENERATED_IV, NOT_RESYNCHRONIZABLE } |
Public Member Functions | |
| XMACC (const byte *key, word32 counter=0xffffffff) | |
| Clonable * | Clone () const |
| this is not implemented by most classes yet | |
| void | SetKey (const byte *key, unsigned int length, const NameValuePairs ¶ms=g_nullNameValuePairs) |
| set or reset the key of this object | |
| std::string | AlgorithmName () const |
| returns name of this algorithm, not universally implemented yet | |
| unsigned int | MinKeyLength () const |
| returns smallest valid key length in bytes */ | |
| unsigned int | MaxKeyLength () const |
| returns largest valid key length in bytes */ | |
| unsigned int | DefaultKeyLength () const |
| returns default (recommended) key length in bytes */ | |
| unsigned int | GetValidKeyLength (unsigned int n) const |
| returns the smallest valid key length in bytes that is >= min(n, GetMaxKeyLength()) | |
| XMACC_Base< T >::IV_Requirement | IVRequirement () const |
| returns the minimal requirement for secure IVs | |
| void | TruncatedFinal (byte *digest, unsigned int size) |
| truncated version of Final() | |
| 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 unsigned int | DigestSize () const =0 |
| size of the hash returned by Final() | |
| 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() | |
| virtual bool | IsValidKeyLength (unsigned int n) const |
| returns whether n is a valid key length | |
| void | SetKeyWithRounds (const byte *key, unsigned int length, int rounds) |
| calls SetKey() with an NameValuePairs object that just specifies "Rounds" | |
| void | SetKeyWithIV (const byte *key, unsigned int length, const byte *iv) |
| calls SetKey() with an NameValuePairs object that just specifies "IV" | |
| bool | IsResynchronizable () const |
| returns whether this object can be resynchronized (i.e. supports initialization vectors) | |
| bool | CanUseRandomIVs () const |
| returns whether this object can use random IVs (in addition to ones returned by GetNextIV) | |
| bool | CanUsePredictableIVs () const |
| returns whether this object can use random but possibly predictable IVs (in addition to ones returned by GetNextIV) | |
| bool | CanUseStructuredIVs () const |
| returns whether this object can use structured IVs, for example a counter (in addition to ones returned by GetNextIV) | |
| virtual unsigned int | IVSize () const |
| returns size of IVs used by this object | |
| virtual void | Resynchronize (const byte *IV) |
| resynchronize with an IV | |
| virtual void | GetNextIV (byte *IV) |
| get a secure IV for the next message | |
Static Public Member Functions | |
| std::string | StaticAlgorithmName () |
| unsigned int | StaticGetValidKeyLength (unsigned int) |
| void | CorrectEndianess (HashWordType *out, const HashWordType *in, unsigned int byteCount) |
Static Public Attributes | |
|
CompileAssert<((BLOCKSIZE &(BLOCKSIZE-1))==0) | cryptopp_assert___LINE__ ) |
Protected Member Functions | |
| void | AssertValidKeyLength (unsigned int length) |
| void | AssertValidKeyLength (unsigned int length) const |
| void | HashBlock (const HashWordType *input) |
| virtual void | HashBlock (const T::HashWordType *input)=0 |
| virtual void | HashEndianCorrectedBlock (const HashWordType *data)=0 |
| void | SetBlockSize (unsigned int blockSize) |
| void | SetStateSize (unsigned int stateSize) |
| T::HashWordType | GetBitCountHi () const |
| T::HashWordType | GetBitCountLo () const |
| virtual unsigned int | HashMultipleBlocks (const T::HashWordType *input, unsigned int length) |
| void | PadLastBlock (unsigned int lastBlockSize, byte padFirst=0x80) |
| virtual void | Init ()=0 |
| void | ThrowIfInvalidTruncatedSize (unsigned int size) const |
| void | ThrowIfInvalidKeyLength (const Algorithm &algorithm, unsigned int length) |
| void | ThrowIfResynchronizable () |
| void | ThrowIfInvalidIV (const byte *iv) |
| const byte * | GetIVAndThrowIfInvalid (const NameValuePairs ¶ms) |
Protected Attributes | |
| SecBlock< T::HashWordType > | m_data |
| SecBlock< T::HashWordType > | m_digest |
|
||||||||||||||||
|
Implements SimpleKeyingInterface. |
|
|
compute hash for current message, then restart for a new message
Referenced by PKCS5_PBKDF2_HMAC< T >::DeriveKey(), HashFilter::Put2(), and HMAC_Base::TruncatedFinal(). |
|
|
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 558 of file cryptlib.h. |
|
|
returns whether this object can be resynchronized (i.e. supports initialization vectors) If this function returns true, and no IV is passed to SetKey() and CanUseStructuredIVs()==true, an IV of all 0's will be assumed. Definition at line 384 of file cryptlib.h. |
|
|
get a secure IV for the next message This method should be called after you finish encrypting one message and are ready to start the next one. After calling it, you must call SetKey() or Resynchronize() before using this object again. This method is not implemented on decryption objects. Definition at line 400 of file cryptlib.h. |
1.3.7-20040704