📄 class_hash_transformation.html
字号:
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"><html><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8"><title>Crypto++: HashTransformation Class Reference</title><link href="doxygen.css" rel="stylesheet" type="text/css"><link href="tabs.css" rel="stylesheet" type="text/css"></head><body><!-- Generated by Doxygen 1.5.2 --><div class="tabs"> <ul> <li><a href="index.html"><span>Main Page</span></a></li> <li><a href="namespaces.html"><span>Namespaces</span></a></li> <li class="current"><a href="classes.html"><span>Classes</span></a></li> <li><a href="files.html"><span>Files</span></a></li> </ul></div><div class="tabs"> <ul> <li><a href="classes.html"><span>Alphabetical List</span></a></li> <li><a href="annotated.html"><span>Class List</span></a></li> <li><a href="hierarchy.html"><span>Class Hierarchy</span></a></li> <li><a href="functions.html"><span>Class Members</span></a></li> </ul></div><h1>HashTransformation Class Reference</h1><!-- doxytag: class="HashTransformation" --><!-- doxytag: inherits="Algorithm" --><code>#include <<a class="el" href="cryptlib_8h-source.html">cryptlib.h</a>></code><p><p>Inheritance diagram for HashTransformation:<p><center><img src="class_hash_transformation.png" usemap="#HashTransformation_map" border="0" alt=""></center><map name="HashTransformation_map"><area href="class_algorithm.html" alt="Algorithm" shape="rect" coords="0,56,358,80"><area href="class_clonable.html" alt="Clonable" shape="rect" coords="0,0,358,24"><area href="class_adler32.html" alt="Adler32" shape="rect" coords="368,168,726,192"><area href="class_c_r_c32.html" alt="CRC32" shape="rect" coords="368,224,726,248"><area href="class_iterated_hash_base.html" alt="IteratedHashBase< T_HashWordType, HashTransformation >" shape="rect" coords="368,280,726,304"><area href="class_iterated_hash_base.html" alt="IteratedHashBase< word32, HashTransformation >" shape="rect" coords="368,336,726,360"><area href="class_iterated_hash_base.html" alt="IteratedHashBase< word64, HashTransformation >" shape="rect" coords="368,392,726,416"><area href="class_message_authentication_code.html" alt="MessageAuthenticationCode" shape="rect" coords="368,448,726,472"><area href="class_null_hash.html" alt="NullHash" shape="rect" coords="368,504,726,528"><area href="class_p_k___message_accumulator.html" alt="PK_MessageAccumulator" shape="rect" coords="368,560,726,584"><area href="class_truncated_hash_template.html" alt="TruncatedHashTemplate< T >" shape="rect" coords="368,616,726,640"><area href="class_weak1_1_1_m_d2.html" alt="Weak1::MD2" shape="rect" coords="368,672,726,696"></map><a href="class_hash_transformation-members.html">List of all members.</a><hr><a name="_details"></a><h2>Detailed Description</h2>interface for hash functions and data processing part of MACs <p><a class="el" href="class_hash_transformation.html" title="interface for hash functions and data processing part of MACs">HashTransformation</a> objects are stateful. They are created in an initial state, change state as <a class="el" href="class_hash_transformation.html#afabefaf445b65d3ba0d8e1c0294afe5" title="process more input">Update()</a> is called, and return to the initial state when <a class="el" href="class_hash_transformation.html#a0b8c7a110d8968268fd02ec32b9a8e8" title="compute hash for current message, then restart for a new message">Final()</a> is called. This interface allows a large message to be hashed in pieces by calling <a class="el" href="class_hash_transformation.html#afabefaf445b65d3ba0d8e1c0294afe5" title="process more input">Update()</a> on each piece followed by calling <a class="el" href="class_hash_transformation.html#a0b8c7a110d8968268fd02ec32b9a8e8" title="compute hash for current message, then restart for a new message">Final()</a>. <p><p>Definition at line <a class="el" href="cryptlib_8h-source.html#l00527">527</a> of file <a class="el" href="cryptlib_8h-source.html">cryptlib.h</a>.<table border="0" cellpadding="0" cellspacing="0"><tr><td></td></tr><tr><td colspan="2"><br><h2>Public Member Functions</h2></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="class_hash_transformation.html">HashTransformation</a> & </td><td class="memItemRight" valign="bottom"><a class="el" href="class_hash_transformation.html#39b0a4c4cdc11fda358f9975b5e4137e">Ref</a> ()</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">return a reference to this object, <a href="#39b0a4c4cdc11fda358f9975b5e4137e"></a><br></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="afabefaf445b65d3ba0d8e1c0294afe5"></a><!-- doxytag: member="HashTransformation::Update" ref="afabefaf445b65d3ba0d8e1c0294afe5" args="(const byte *input, size_t length)=0" -->virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="class_hash_transformation.html#afabefaf445b65d3ba0d8e1c0294afe5">Update</a> (const byte *input, size_t length)=0</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">process more input <br></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="9fc0b332ef36900ca6ea5d949e95aba1"></a><!-- doxytag: member="HashTransformation::CreateUpdateSpace" ref="9fc0b332ef36900ca6ea5d949e95aba1" args="(size_t &size)" -->virtual byte * </td><td class="memItemRight" valign="bottom"><a class="el" href="class_hash_transformation.html#9fc0b332ef36900ca6ea5d949e95aba1">CreateUpdateSpace</a> (size_t &size)</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">request space to write input into <br></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="class_hash_transformation.html#a0b8c7a110d8968268fd02ec32b9a8e8">Final</a> (byte *digest)</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">compute hash for current message, then restart for a new message <a href="#a0b8c7a110d8968268fd02ec32b9a8e8"></a><br></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="92752eebac10497211d7a065faba8725"></a><!-- doxytag: member="HashTransformation::Restart" ref="92752eebac10497211d7a065faba8725" args="()" -->virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="class_hash_transformation.html#92752eebac10497211d7a065faba8725">Restart</a> ()</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">discard the current state, and restart with a new message <br></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="41faf8b1293a6c72390cb0c8bd668097"></a><!-- doxytag: member="HashTransformation::DigestSize" ref="41faf8b1293a6c72390cb0c8bd668097" args="() const=0" -->virtual unsigned int </td><td class="memItemRight" valign="bottom"><a class="el" href="class_hash_transformation.html#41faf8b1293a6c72390cb0c8bd668097">DigestSize</a> () const=0</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">size of the hash returned by <a class="el" href="class_hash_transformation.html#a0b8c7a110d8968268fd02ec32b9a8e8" title="compute hash for current message, then restart for a new message">Final()</a> <br></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="09c66b86bbe3c13ea9e8d74775696d42"></a><!-- doxytag: member="HashTransformation::BlockSize" ref="09c66b86bbe3c13ea9e8d74775696d42" args="() const" -->virtual unsigned int </td><td class="memItemRight" valign="bottom"><a class="el" href="class_hash_transformation.html#09c66b86bbe3c13ea9e8d74775696d42">BlockSize</a> () const</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">block size of underlying compression function, or 0 if not block based <br></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="ee97908d965930ee454f7a88b0ff0f71"></a><!-- doxytag: member="HashTransformation::OptimalBlockSize" ref="ee97908d965930ee454f7a88b0ff0f71" args="() const" -->virtual unsigned int </td><td class="memItemRight" valign="bottom"><a class="el" href="class_hash_transformation.html#ee97908d965930ee454f7a88b0ff0f71">OptimalBlockSize</a> () const</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">input to <a class="el" href="class_hash_transformation.html#afabefaf445b65d3ba0d8e1c0294afe5" title="process more input">Update()</a> should have length a multiple of this for optimal speed <br></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="15944a7b920e2c24bd1cb67d0303dd2a"></a><!-- doxytag: member="HashTransformation::OptimalDataAlignment" ref="15944a7b920e2c24bd1cb67d0303dd2a" args="() const" -->virtual unsigned int </td><td class="memItemRight" valign="bottom"><a class="el" href="class_hash_transformation.html#15944a7b920e2c24bd1cb67d0303dd2a">OptimalDataAlignment</a> () const</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">returns how input should be aligned for optimal performance <br></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="f8124c4fca23b74bbdc43660bdae692c"></a><!-- doxytag: member="HashTransformation::CalculateDigest" ref="f8124c4fca23b74bbdc43660bdae692c" args="(byte *digest, const byte *input, size_t length)" -->virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="class_hash_transformation.html#f8124c4fca23b74bbdc43660bdae692c">CalculateDigest</a> (byte *digest, const byte *input, size_t length)</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">use this if your input is in one piece and you don't want to call <a class="el" href="class_hash_transformation.html#afabefaf445b65d3ba0d8e1c0294afe5" title="process more input">Update()</a> and <a class="el" href="class_hash_transformation.html#a0b8c7a110d8968268fd02ec32b9a8e8" title="compute hash for current message, then restart for a new message">Final()</a> separately <br></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top">virtual bool </td><td class="memItemRight" valign="bottom"><a class="el" href="class_hash_transformation.html#16c4aecd047015d513feef4ed5b929ba">Verify</a> (const byte *digest)</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">verify that digest is a valid digest for the current message, then reinitialize the object <a href="#16c4aecd047015d513feef4ed5b929ba"></a><br></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="cad96df68e70d922683e5063057130b2"></a><!-- doxytag: member="HashTransformation::VerifyDigest" ref="cad96df68e70d922683e5063057130b2" args="(const byte *digest, const byte *input, size_t length)" -->virtual bool </td><td class="memItemRight" valign="bottom"><a class="el" href="class_hash_transformation.html#cad96df68e70d922683e5063057130b2">VerifyDigest</a> (const byte *digest, const byte *input, size_t length)</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">use this if your input is in one piece and you don't want to call <a class="el" href="class_hash_transformation.html#afabefaf445b65d3ba0d8e1c0294afe5" title="process more input">Update()</a> and <a class="el" href="class_hash_transformation.html#16c4aecd047015d513feef4ed5b929ba" title="verify that digest is a valid digest for the current message, then reinitialize the...">Verify()</a> separately <br></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="590ecda344aa0fb045abf42ec08823b2"></a><!-- doxytag: member="HashTransformation::TruncatedFinal" ref="590ecda344aa0fb045abf42ec08823b2" args="(byte *digest, size_t digestSize)=0" -->virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="class_hash_transformation.html#590ecda344aa0fb045abf42ec08823b2">TruncatedFinal</a> (byte *digest, size_t digestSize)=0</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">truncated version of <a class="el" href="class_hash_transformation.html#a0b8c7a110d8968268fd02ec32b9a8e8" title="compute hash for current message, then restart for a new message">Final()</a> <br></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="0b6917657eaec935750fd83e28270d76"></a><!-- doxytag: member="HashTransformation::CalculateTruncatedDigest" ref="0b6917657eaec935750fd83e28270d76" args="(byte *digest, size_t digestSize, const byte *input, size_t length)" -->virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="class_hash_transformation.html#0b6917657eaec935750fd83e28270d76">CalculateTruncatedDigest</a> (byte *digest, size_t digestSize, const byte *input, size_t length)</td></tr><tr><td class="mdescLeft"> </td><td class="mdescRight">truncated version of <a class="el" href="class_hash_transformation.html#f8124c4fca23b74bbdc43660bdae692c" title="use this if your input is in one piece and you don't want to call Update() and Final()...">CalculateDigest()</a> <br></td></tr><tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="0f6069eadf492d970c3eb8cdf656e742"></a><!-- doxytag: member="HashTransformation::TruncatedVerify" ref="0f6069eadf492d970c3eb8cdf656e742" args="(const byte *digest, size_t digestLength)" -->⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -