/[dtapublic]/projs/trunk/shared_source/c_datd/esrg_sha512.c
ViewVC logotype

Diff of /projs/trunk/shared_source/c_datd/esrg_sha512.c

Parent Directory Parent Directory | Revision Log Revision Log | View Patch Patch

to_be_filed/sf_code/esrgpcpj/shared/c_datd/esrg_sha512.c revision 29 by dashley, Sat Oct 8 07:08:47 2016 UTC projs/trunk/shared_source/c_datd/esrg_sha512.c revision 71 by dashley, Sat Nov 5 11:07:06 2016 UTC
# Line 1  Line 1 
1  /* $Header: /cvsroot/esrg/sfesrg/esrgpcpj/shared/c_datd/esrg_sha512.c,v 1.5 2009/11/29 02:16:05 dtashley Exp $  //$Header$
2  **  //-------------------------------------------------------------------------------------------------
3  ** A description of the functionality of this module and the public interface  //This file is part of "David T. Ashley's Shared Source Code", a set of shared components
4  ** definition is contained in the associated .H file.  //integrated into many of David T. Ashley's projects.
5  */  //-------------------------------------------------------------------------------------------------
6    //This source code and any program in which it is compiled/used is provided under the MIT License,
7  //--------------------------------------------------------------------------------  //reproduced below.
8  //Copyright 2001 David T. Ashley  //-------------------------------------------------------------------------------------------------
9  //-------------------------------------------------------------------------------------------------  //Permission is hereby granted, free of charge, to any person obtaining a copy of
10  //This source code and any program in which it is compiled/used is provided under the GNU GENERAL  //this software and associated documentation files(the "Software"), to deal in the
11  //PUBLIC LICENSE, Version 3, full license text below.  //Software without restriction, including without limitation the rights to use,
12  //-------------------------------------------------------------------------------------------------  //copy, modify, merge, publish, distribute, sublicense, and / or sell copies of the
13  //                    GNU GENERAL PUBLIC LICENSE  //Software, and to permit persons to whom the Software is furnished to do so,
14  //                       Version 3, 29 June 2007  //subject to the following conditions :
15  //  //
16  // Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>  //The above copyright notice and this permission notice shall be included in all
17  // Everyone is permitted to copy and distribute verbatim copies  //copies or substantial portions of the Software.
18  // of this license document, but changing it is not allowed.  //
19  //  //THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
20  //                            Preamble  //IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
21  //  //FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.IN NO EVENT SHALL THE
22  //  The GNU General Public License is a free, copyleft license for  //AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
23  //software and other kinds of works.  //LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
24  //  //OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
25  //  The licenses for most software and other practical works are designed  //SOFTWARE.
26  //to take away your freedom to share and change the works.  By contrast,  //-------------------------------------------------------------------------------------------------
27  //the GNU General Public License is intended to guarantee your freedom to  #define MODULE_ESRG_SHA512
28  //share and change all versions of a program--to make sure it remains free  
29  //software for all its users.  We, the Free Software Foundation, use the  #include <assert.h>
30  //GNU General Public License for most of our software; it applies also to  #include <stddef.h>
31  //any other work released this way by its authors.  You can apply it to  #include <string.h>
32  //your programs, too.  
33  //  #include "charfunc.h"
34  //  When we speak of free software, we are referring to freedom, not  #include "esrg_sha512.h"
35  //price.  Our General Public Licenses are designed to make sure that you  
36  //have the freedom to distribute copies of free software (and charge for  //This is a right rotation macro for efficiency.  This
37  //them if you wish), that you receive source code or can get it if you  //macro rotates a 64-bit quantity x right (cyclically) by
38  //want it, that you can change the software or use pieces of it in new  //n bits.  Nomenclature from FIPS 180-3.
39  //free programs, and that you know you can do these things.  #define ESRG_SHA512_FUNC_ROTR(x, n) (((x) >> (n)) | ((x) << (64-(n))))
40  //  
41  //  To protect your rights, we need to prevent others from denying you  //This is a right shift macro for efficiency.  This
42  //these rights or asking you to surrender the rights.  Therefore, you have  //macro shifts a 64-bit quantity x right by
43  //certain responsibilities if you distribute copies of the software, or if  //n bits.  Nomenclature from FIPS 180-3.
44  //you modify it: responsibilities to respect the freedom of others.  #define ESRG_SHA512_FUNC_SHR(x, n) ((x) >> (n))
45  //  
46  //  For example, if you distribute copies of such a program, whether  //These functions come directly from FIPS 180-3.
47  //gratis or for a fee, you must pass on to the recipients the same  #define ESRG_SHA512_FUNC_CH(x, y, z)  (((x) & (y)) ^ (~(x) & (z)))
48  //freedoms that you received.  You must make sure that they, too, receive  #define ESRG_SHA512_FUNC_MAJ(x, y, z) (((x) & (y)) ^ ((x) & (z)) ^ ((y) & (z)))
49  //or can get the source code.  And you must show them these terms so they  #define ESRG_SHA512_FUNC_SIGMABIG_0(x) (ESRG_SHA512_FUNC_ROTR(x, 28) ^ ESRG_SHA512_FUNC_ROTR(x, 34) ^ ESRG_SHA512_FUNC_ROTR(x, 39))
50  //know their rights.  #define ESRG_SHA512_FUNC_SIGMABIG_1(x) (ESRG_SHA512_FUNC_ROTR(x, 14) ^ ESRG_SHA512_FUNC_ROTR(x, 18) ^ ESRG_SHA512_FUNC_ROTR(x, 41))
51  //  #define ESRG_SHA512_FUNC_SIGMASMALL_0(x) (ESRG_SHA512_FUNC_ROTR(x,  1) ^ ESRG_SHA512_FUNC_ROTR(x,  8) ^ ESRG_SHA512_FUNC_SHR(x,  7))
52  //  Developers that use the GNU GPL protect your rights with two steps:  #define ESRG_SHA512_FUNC_SIGMASMALL_1(x) (ESRG_SHA512_FUNC_ROTR(x, 19) ^ ESRG_SHA512_FUNC_ROTR(x, 61) ^ ESRG_SHA512_FUNC_SHR(x,  6))
53  //(1) assert copyright on the software, and (2) offer you this License  
54  //giving you legal permission to copy, distribute and/or modify it.  //Constants, from FIPS 180-3.
55  //  const unsigned __int64 ESRG_SHA512_K[80] =
56  //  For the developers' and authors' protection, the GPL clearly explains              {0x428a2f98d728ae22UL, 0x7137449123ef65cdUL,
57  //that there is no warranty for this free software.  For both users' and               0xb5c0fbcfec4d3b2fUL, 0xe9b5dba58189dbbcUL,
58  //authors' sake, the GPL requires that modified versions be marked as               0x3956c25bf348b538UL, 0x59f111f1b605d019UL,
59  //changed, so that their problems will not be attributed erroneously to               0x923f82a4af194f9bUL, 0xab1c5ed5da6d8118UL,
60  //authors of previous versions.               0xd807aa98a3030242UL, 0x12835b0145706fbeUL,
61  //               0x243185be4ee4b28cUL, 0x550c7dc3d5ffb4e2UL,
62  //  Some devices are designed to deny users access to install or run               0x72be5d74f27b896fUL, 0x80deb1fe3b1696b1UL,
63  //modified versions of the software inside them, although the manufacturer               0x9bdc06a725c71235UL, 0xc19bf174cf692694UL,
64  //can do so.  This is fundamentally incompatible with the aim of               0xe49b69c19ef14ad2UL, 0xefbe4786384f25e3UL,
65  //protecting users' freedom to change the software.  The systematic               0x0fc19dc68b8cd5b5UL, 0x240ca1cc77ac9c65UL,
66  //pattern of such abuse occurs in the area of products for individuals to               0x2de92c6f592b0275UL, 0x4a7484aa6ea6e483UL,
67  //use, which is precisely where it is most unacceptable.  Therefore, we               0x5cb0a9dcbd41fbd4UL, 0x76f988da831153b5UL,
68  //have designed this version of the GPL to prohibit the practice for those               0x983e5152ee66dfabUL, 0xa831c66d2db43210UL,
69  //products.  If such problems arise substantially in other domains, we               0xb00327c898fb213fUL, 0xbf597fc7beef0ee4UL,
70  //stand ready to extend this provision to those domains in future versions               0xc6e00bf33da88fc2UL, 0xd5a79147930aa725UL,
71  //of the GPL, as needed to protect the freedom of users.               0x06ca6351e003826fUL, 0x142929670a0e6e70UL,
72  //               0x27b70a8546d22ffcUL, 0x2e1b21385c26c926UL,
73  //  Finally, every program is threatened constantly by software patents.               0x4d2c6dfc5ac42aedUL, 0x53380d139d95b3dfUL,
74  //States should not allow patents to restrict development and use of               0x650a73548baf63deUL, 0x766a0abb3c77b2a8UL,
75  //software on general-purpose computers, but in those that do, we wish to               0x81c2c92e47edaee6UL, 0x92722c851482353bUL,
76  //avoid the special danger that patents applied to a free program could               0xa2bfe8a14cf10364UL, 0xa81a664bbc423001UL,
77  //make it effectively proprietary.  To prevent this, the GPL assures that               0xc24b8b70d0f89791UL, 0xc76c51a30654be30UL,
78  //patents cannot be used to render the program non-free.               0xd192e819d6ef5218UL, 0xd69906245565a910UL,
79  //               0xf40e35855771202aUL, 0x106aa07032bbd1b8UL,
80  //  The precise terms and conditions for copying, distribution and               0x19a4c116b8d2d0c8UL, 0x1e376c085141ab53UL,
81  //modification follow.               0x2748774cdf8eeb99UL, 0x34b0bcb5e19b48a8UL,
82  //               0x391c0cb3c5c95a63UL, 0x4ed8aa4ae3418acbUL,
83  //                       TERMS AND CONDITIONS               0x5b9cca4f7763e373UL, 0x682e6ff3d6b2b8a3UL,
84  //               0x748f82ee5defb2fcUL, 0x78a5636f43172f60UL,
85  //  0. Definitions.               0x84c87814a1f0ab72UL, 0x8cc702081a6439ecUL,
86  //               0x90befffa23631e28UL, 0xa4506cebde82bde9UL,
87  //  "This License" refers to version 3 of the GNU General Public License.               0xbef9a3f7b2c67915UL, 0xc67178f2e372532bUL,
88  //               0xca273eceea26619cUL, 0xd186b8c721c0c207UL,
89  //  "Copyright" also means copyright-like laws that apply to other kinds of               0xeada7dd6cde0eb1eUL, 0xf57d4f7fee6ed178UL,
90  //works, such as semiconductor masks.               0x06f067aa72176fbaUL, 0x0a637dc5a2c898a6UL,
91  //               0x113f9804bef90daeUL, 0x1b710b35131c471bUL,
92  //  "The Program" refers to any copyrightable work licensed under this               0x28db77f523047d84UL, 0x32caab7b40c72493UL,
93  //License.  Each licensee is addressed as "you".  "Licensees" and               0x3c9ebe0a15c9bebcUL, 0x431d67c49c100d4cUL,
94  //"recipients" may be individuals or organizations.               0x4cc5d4becb3e42b6UL, 0x597f299cfc657e2aUL,
95  //               0x5fcb6fab3ad6faecUL, 0x6c44198c4a475817UL};
96  //  To "modify" a work means to copy from or adapt all or part of the work  
97  //in a fashion requiring copyright permission, other than the making of an  
98  //exact copy.  The resulting work is called a "modified version" of the  void ESRG_SHA512_Sha512StateStructOpen(struct ESRG_SHA512_Sha512StateStruct *arg)
99  //earlier work or a work "based on" the earlier work.     {
100  //     assert(arg != NULL);
101  //  A "covered work" means either the unmodified Program or a work based  
102  //on the Program.     memset(arg, 0, sizeof(struct ESRG_SHA512_Sha512StateStruct));
103  //        //Everything to zero, processed bitcount automatically set to zero.
104  //  To "propagate" a work means to do anything with it that, without  
105  //permission, would make you directly or secondarily liable for     //This assignment comes directly from FIPS 180-3.
106  //infringement under applicable copyright law, except executing it on a     arg->H0 = 0x6a09e667f3bcc908UL;
107  //computer or modifying a private copy.  Propagation includes copying,     arg->H1 = 0xbb67ae8584caa73bUL;
108  //distribution (with or without modification), making available to the     arg->H2 = 0x3c6ef372fe94f82bUL;
109  //public, and in some countries other activities as well.     arg->H3 = 0xa54ff53a5f1d36f1UL;
110  //     arg->H4 = 0x510e527fade682d1UL;
111  //  To "convey" a work means any kind of propagation that enables other     arg->H5 = 0x9b05688c2b3e6c1fUL;
112  //parties to make or receive copies.  Mere interaction with a user through     arg->H6 = 0x1f83d9abfb41bd6bUL;
113  //a computer network, with no transfer of a copy, is not conveying.     arg->H7 = 0x5be0cd19137e2179UL;
114  //     }
115  //  An interactive user interface displays "Appropriate Legal Notices"  
116  //to the extent that it includes a convenient and prominently visible  
117  //feature that (1) displays an appropriate copyright notice, and (2)  //Copies the byte buffer to the word buffer within the state block.
118  //tells the user that there is no warranty for the work (except to the  //This is done in a way which hides big-endian/little-endian concerns.
119  //extent that warranties are provided), that licensees may convey the  //
120  //work under this License, and how to view a copy of this License.  If  static void ESRG_SHA512_CopyBytesToWords(struct ESRG_SHA512_Sha512StateStruct *arg)
121  //the interface presents a list of user commands or options, such as a     {
122  //menu, a prominent item in the list meets this criterion.     unsigned int i;
123  //  
124  //  1. Source Code.     assert(arg != NULL);
125  //  
126  //  The "source code" for a work means the preferred form of the work     //Copy the buffer contents into the words.  We need to be careful
127  //for making modifications to it.  "Object code" means any non-source     //to do this correctly, because of big-endian/little-endian concerns.
128  //form of a work.     //From FIPS 180-3 (alluded to, not really stated), the message is
129  //     //loaded in from M[0] down to M[15].  Additionally, per the other
130  //  A "Standard Interface" means an interface that either is an official     //conventions in the document, the first byte is uppermost in each
131  //standard defined by a recognized standards body, or, in the case of     //word.
132  //interfaces specified for a particular programming language, one that     for (i=0; i<16; i++)
133  //is widely used among developers working in that language.        {
134  //        assert((i * 8 + 3) < 128);
135  //  The "System Libraries" of an executable work include anything, other        arg->M[i] = (((unsigned __int64)(arg->buf[i*8+0])) << 56)
136  //than the work as a whole, that (a) is included in the normal form of                    +
137  //packaging a Major Component, but which is not part of that Major                    (((unsigned __int64)(arg->buf[i*8+1])) << 48)
138  //Component, and (b) serves only to enable use of the work with that                    +
139  //Major Component, or to implement a Standard Interface for which an                    (((unsigned __int64)(arg->buf[i*8+2])) << 40)
140  //implementation is available to the public in source code form.  A                    +
141  //"Major Component", in this context, means a major essential component                    (((unsigned __int64)(arg->buf[i*8+3])) << 32)
142  //(kernel, window system, and so on) of the specific operating system                    +
143  //(if any) on which the executable work runs, or a compiler used to                    (((unsigned __int64)(arg->buf[i*8+4])) << 24)
144  //produce the work, or an object code interpreter used to run it.                    +
145  //                    (((unsigned __int64)(arg->buf[i*8+5])) << 16)
146  //  The "Corresponding Source" for a work in object code form means all                    +
147  //the source code needed to generate, install, and (for an executable                    (((unsigned __int64)(arg->buf[i*8+6])) <<  8)
148  //work) run the object code and to modify the work, including scripts to                    +
149  //control those activities.  However, it does not include the work's                    (((unsigned __int64)(arg->buf[i*8+7])));
150  //System Libraries, or general-purpose tools or generally available free        }
151  //programs which are used unmodified in performing those activities but     }
152  //which are not part of the work.  For example, Corresponding Source  
153  //includes interface definition files associated with source files for  
154  //the work, and the source code for shared libraries and dynamically  //Copies the buffer of words into a string buffer of string length 128, and also places
155  //linked subprograms that the work is specifically designed to require,  //the zero terminator, which means that the string supplied by the caller must be of size
156  //such as by intimate data communication or control flow between those  //129 or larger.
157  //subprograms and other parts of the work.  //
158  //  static void ESRG_SHA512_CopyWordsToStringBuffer(struct ESRG_SHA512_Sha512ResultStruct *arg)
159  //  The Corresponding Source need not include anything that users     {
160  //can regenerate automatically from other parts of the Corresponding     unsigned int i, j;
161  //Source.     unsigned char *puc;
162  //     unsigned __int64 woi;
163  //  The Corresponding Source for a work in source code form is that  
164  //same work.     assert(arg != NULL);
165  //  
166  //  2. Basic Permissions.     //Copy the buffer contents into the words.  We need to be careful
167  //     //to do this correctly, because of big-endian/little-endian concerns.
168  //  All rights granted under this License are granted for the term of     //From FIPS 180-3 (alluded to, not really stated), the message is
169  //copyright on the Program, and are irrevocable provided the stated     //loaded in from M[0] down to M[15].  Additionally, per the other
170  //conditions are met.  This License explicitly affirms your unlimited     //conventions in the document, the first byte is uppermost in each
171  //permission to run the unmodified Program.  The output from running a     //word.
172  //covered work is covered by this License only if the output, given its     for (i=0; i<8; i++)
173  //content, constitutes a covered work.  This License acknowledges your        {
174  //rights of fair use or other equivalent, as provided by copyright law.        woi = arg->sha512_words[i];
175  //  
176  //  You may make, run and propagate covered works that you do not            //Form a pointer to the buffer location of interest.  We work
177  //convey, without conditions so long as your license otherwise remains            //backwards.
178  //in force.  You may convey covered works to others for the sole purpose            puc = (unsigned char *)(arg->sha512_chars) + (i * 16) + 15;
179  //of having them make modifications exclusively for you, or provide you  
180  //with facilities for running those works, provided that you comply with            //Fill in the buffer.
181  //the terms of this License in conveying all material for which you do        for (j=0; j<16; j++)
182  //not control copyright.  Those thus making or running the covered works              {
183  //for you must do so exclusively on your behalf, under your direction          *puc = (unsigned char)CHARFUNC_nibble_to_lc_hex_digit((int)(woi & 0xF));
184  //and control, on terms that prohibit them from making any copies of                  woi >>= 4;
185  //your copyrighted material outside their relationship with you.                  puc--;
186  //              }
187  //  Conveying under any other circumstances is permitted solely under        }
188  //the conditions stated below.  Sublicensing is not allowed; section 10  
189  //makes it unnecessary.     //Place the zero string terminator.
190  //     arg->sha512_chars[128] = 0;
191  //  3. Protecting Users' Legal Rights From Anti-Circumvention Law.     }
192  //  
193  //  No covered work shall be deemed part of an effective technological  
194  //measure under any applicable law fulfilling obligations under article  //Does the SHA-512 rounds as specified by FIPS 180-3.
195  //11 of the WIPO copyright treaty adopted on 20 December 1996, or  
196  //similar laws prohibiting or restricting circumvention of such  static void ESRG_SHA512_DoSha512Rounds(struct ESRG_SHA512_Sha512StateStruct *arg)
197  //measures.     {
198  //     int i;
199  //  When you convey a covered work, you waive any legal power to forbid        //Iteration variable.
200  //circumvention of technological measures to the extent such circumvention     unsigned __int64 T1, T2;
201  //is effected by exercising rights under this License with respect to        //Temporary variables.  Nomenclature is from FIPS 180-3.
202  //the covered work, and you disclaim any intention to limit operation or     unsigned __int64 M[16];
203  //modification of the work as a means of enforcing, against the work's        //Buffer of message block to avoid repeated dereferences.
204  //users, your or third parties' legal rights to forbid circumvention of     unsigned __int64 H[8];
205  //technological measures.        //Buffer of hash state to avoid repeated dereferences.
206  //     unsigned __int64 W[80];
207  //  4. Conveying Verbatim Copies.        //Working variable.  Nomenclature directly from FIPS 180-3.
208  //     unsigned __int64 a, b, c, d, e, f, g, h;
209  //  You may convey verbatim copies of the Program's source code as you        //Nomenclature above directly from FIPS 180-3.
210  //receive it, in any medium, provided that you conspicuously and  
211  //appropriately publish on each copy an appropriate copyright notice;     assert(arg != NULL);
212  //keep intact all notices stating that this License and any  
213  //non-permissive terms added in accord with section 7 apply to the code;     //Copy bytes into words.
214  //keep intact all notices of the absence of any warranty; and give all     ESRG_SHA512_CopyBytesToWords(arg);
215  //recipients a copy of this License along with the Program.  
216  //     //Copy out the message buffer for speed.  This should avoid repeated
217  //  You may charge any price or no price for each copy that you convey,     //dereferences.
218  //and you may offer support or warranty protection for a fee.     M[ 0] = arg->M[ 0];
219  //     M[ 1] = arg->M[ 1];
220  //  5. Conveying Modified Source Versions.     M[ 2] = arg->M[ 2];
221  //     M[ 3] = arg->M[ 3];
222  //  You may convey a work based on the Program, or the modifications to     M[ 4] = arg->M[ 4];
223  //produce it from the Program, in the form of source code under the     M[ 5] = arg->M[ 5];
224  //terms of section 4, provided that you also meet all of these conditions:     M[ 6] = arg->M[ 6];
225  //     M[ 7] = arg->M[ 7];
226  //    a) The work must carry prominent notices stating that you modified     M[ 8] = arg->M[ 8];
227  //    it, and giving a relevant date.     M[ 9] = arg->M[ 9];
228  //     M[10] = arg->M[10];
229  //    b) The work must carry prominent notices stating that it is     M[11] = arg->M[11];
230  //    released under this License and any conditions added under section     M[12] = arg->M[12];
231  //    7.  This requirement modifies the requirement in section 4 to     M[13] = arg->M[13];
232  //    "keep intact all notices".     M[14] = arg->M[14];
233  //     M[15] = arg->M[15];
234  //    c) You must license the entire work, as a whole, under this  
235  //    License to anyone who comes into possession of a copy.  This     //Copy out the hash state for speed.  This should avoid repeated dereferences.
236  //    License will therefore apply, along with any applicable section 7     H[0]  = arg->H0;
237  //    additional terms, to the whole of the work, and all its parts,     H[1]  = arg->H1;
238  //    regardless of how they are packaged.  This License gives no     H[2]  = arg->H2;
239  //    permission to license the work in any other way, but it does not     H[3]  = arg->H3;
240  //    invalidate such permission if you have separately received it.     H[4]  = arg->H4;
241  //     H[5]  = arg->H5;
242  //    d) If the work has interactive user interfaces, each must display     H[6]  = arg->H6;
243  //    Appropriate Legal Notices; however, if the Program has interactive     H[7]  = arg->H7;
244  //    interfaces that do not display Appropriate Legal Notices, your  
245  //    work need not make them do so.     //Prepare the message schedule.  The nomenclature comes directly from FIPS 180-3.
246  //     W[ 0] = M[ 0];
247  //  A compilation of a covered work with other separate and independent     W[ 1] = M[ 1];
248  //works, which are not by their nature extensions of the covered work,     W[ 2] = M[ 2];
249  //and which are not combined with it such as to form a larger program,     W[ 3] = M[ 3];
250  //in or on a volume of a storage or distribution medium, is called an     W[ 4] = M[ 4];
251  //"aggregate" if the compilation and its resulting copyright are not     W[ 5] = M[ 5];
252  //used to limit the access or legal rights of the compilation's users     W[ 6] = M[ 6];
253  //beyond what the individual works permit.  Inclusion of a covered work     W[ 7] = M[ 7];
254  //in an aggregate does not cause this License to apply to the other     W[ 8] = M[ 8];
255  //parts of the aggregate.     W[ 9] = M[ 9];
256  //     W[10] = M[10];
257  //  6. Conveying Non-Source Forms.     W[11] = M[11];
258  //     W[12] = M[12];
259  //  You may convey a covered work in object code form under the terms     W[13] = M[13];
260  //of sections 4 and 5, provided that you also convey the     W[14] = M[14];
261  //machine-readable Corresponding Source under the terms of this License,     W[15] = M[15];
262  //in one of these ways:  
263  //     for (i=16; i<80; i++)
264  //    a) Convey the object code in, or embodied in, a physical product        {
265  //    (including a physical distribution medium), accompanied by the        W[i] =    ESRG_SHA512_FUNC_SIGMASMALL_1(W[i-2])
266  //    Corresponding Source fixed on a durable physical medium                       +  W[i-7]
267  //    customarily used for software interchange.                   +  ESRG_SHA512_FUNC_SIGMASMALL_0(W[i-15])
268  //                           +  W[i-16];
269  //    b) Convey the object code in, or embodied in, a physical product        }
270  //    (including a physical distribution medium), accompanied by a  
271  //    written offer, valid for at least three years and valid for as     //Initialize the 8 working variables as specified in FIPS 180-3.
272  //    long as you offer spare parts or customer support for that product     a = H[0];
273  //    model, to give anyone who possesses the object code either (1) a     b = H[1];
274  //    copy of the Corresponding Source for all the software in the     c = H[2];
275  //    product that is covered by this License, on a durable physical     d = H[3];
276  //    medium customarily used for software interchange, for a price no     e = H[4];
277  //    more than your reasonable cost of physically performing this     f = H[5];
278  //    conveying of source, or (2) access to copy the     g = H[6];
279  //    Corresponding Source from a network server at no charge.     h = H[7];
280  //  
281  //    c) Convey individual copies of the object code with a copy of the     //Perform the rounds as specified in FIPS 180-3.  Nomenclature below comes from
282  //    written offer to provide the Corresponding Source.  This     //FIPS 180-3.
283  //    alternative is allowed only occasionally and noncommercially, and     for (i=0; i<80; i++)
284  //    only if you received the object code with such an offer, in accord        {
285  //    with subsection 6b.        T1 =    h
286  //                      + ESRG_SHA512_FUNC_SIGMABIG_1(e)
287  //    d) Convey the object code by offering access from a designated                          + ESRG_SHA512_FUNC_CH(e, f, g)
288  //    place (gratis or for a charge), and offer equivalent access to the                          + ESRG_SHA512_K[i]
289  //    Corresponding Source in the same way through the same place at no                  + W[i];
290  //    further charge.  You need not require recipients to copy the            //
291  //    Corresponding Source along with the object code.  If the place to        T2 =    ESRG_SHA512_FUNC_SIGMABIG_0(a)
292  //    copy the object code is a network server, the Corresponding Source              + ESRG_SHA512_FUNC_MAJ(a, b, c);
293  //    may be on a different server (operated by you or a third party)        //
294  //    that supports equivalent copying facilities, provided you maintain            h = g;
295  //    clear directions next to the object code saying where to find the            //
296  //    Corresponding Source.  Regardless of what server hosts the            g = f;
297  //    Corresponding Source, you remain obligated to ensure that it is            //
298  //    available for as long as needed to satisfy these requirements.            f = e;
299  //            //
300  //    e) Convey the object code using peer-to-peer transmission, provided            e = d + T1;
301  //    you inform other peers where the object code and Corresponding            //
302  //    Source of the work are being offered to the general public at no            d = c;
303  //    charge under subsection 6d.            //
304  //            c = b;
305  //  A separable portion of the object code, whose source code is excluded            //
306  //from the Corresponding Source as a System Library, need not be            b = a;
307  //included in conveying the object code work.            //
308  //            a = T1 + T2;
309  //  A "User Product" is either (1) a "consumer product", which means any        }
310  //tangible personal property which is normally used for personal, family,  
311  //or household purposes, or (2) anything designed or sold for incorporation     //Compute the next hash value.  The nomenclature comes from FIPS 180-3.
312  //into a dwelling.  In determining whether a product is a consumer product,     H[0] = a + H[0];
313  //doubtful cases shall be resolved in favor of coverage.  For a particular     H[1] = b + H[1];
314  //product received by a particular user, "normally used" refers to a     H[2] = c + H[2];
315  //typical or common use of that class of product, regardless of the status     H[3] = d + H[3];
316  //of the particular user or of the way in which the particular user     H[4] = e + H[4];
317  //actually uses, or expects or is expected to use, the product.  A product     H[5] = f + H[5];
318  //is a consumer product regardless of whether the product has substantial     H[6] = g + H[6];
319  //commercial, industrial or non-consumer uses, unless such uses represent     H[7] = h + H[7];
320  //the only significant mode of use of the product.  
321  //     //Place the local variables back in the structure.  This the only state that
322  //  "Installation Information" for a User Product means any methods,     //gets preserved between the operation of doing the rounds.
323  //procedures, authorization keys, or other information required to install     arg->H0 = H[0];
324  //and execute modified versions of a covered work in that User Product from     arg->H1 = H[1];
325  //a modified version of its Corresponding Source.  The information must     arg->H2 = H[2];
326  //suffice to ensure that the continued functioning of the modified object     arg->H3 = H[3];
327  //code is in no case prevented or interfered with solely because     arg->H4 = H[4];
328  //modification has been made.     arg->H5 = H[5];
329  //     arg->H6 = H[6];
330  //  If you convey an object code work under this section in, or with, or     arg->H7 = H[7];
331  //specifically for use in, a User Product, and the conveying occurs as     }
332  //part of a transaction in which the right of possession and use of the  
333  //User Product is transferred to the recipient in perpetuity or for a  
334  //fixed term (regardless of how the transaction is characterized), the  void ESRG_SHA512_Sha512StateStructAddData(struct    ESRG_SHA512_Sha512StateStruct *arg,
335  //Corresponding Source conveyed under this section must be accompanied                                            void      *pointer_in,
336  //by the Installation Information.  But this requirement does not apply                                            unsigned  len)
337  //if neither you nor any third party retains the ability to install     {
338  //modified object code on the User Product (for example, the work has     unsigned int   low_32;
339  //been installed in ROM).     unsigned int   byte_offset;
340  //     unsigned char *data;
341  //  The requirement to provide Installation Information does not include a  
342  //requirement to continue to provide support service, warranty, or updates     assert(arg        != NULL);
343  //for a work that has been modified or installed by the recipient, or for     assert(pointer_in != NULL);
344  //the User Product in which it has been modified or installed.  Access to a  
345  //network may be denied when the modification itself materially and     data = (unsigned char *)pointer_in;
346  //adversely affects the operation of the network or violates the rules and        //It is easier to do it this way, rather than cast all the time.
347  //protocols for communication across the network.  
348  //     low_32 = (unsigned int)arg->bit_count;
349  //  Corresponding Source conveyed, and Installation Information provided,        //Copy off the least significant bits.  Easier to do once.  We only
350  //in accord with this section must be in a format that is publicly        //need the 32 least significant because the block size is 0 modulo 1024.
351  //documented (and with an implementation available to the public in  
352  //source code form), and must require no special password or key for     byte_offset = low_32 >> 3;
353  //unpacking, reading or copying.        //This gives our byte offset, up to 500+Mb or so.
354  //  
355  //  7. Additional Terms.     while(len--)
356  //        {
357  //  "Additional permissions" are terms that supplement the terms of this        //We process rounds AFTER a byte is added to the buffer.  So
358  //License by making exceptions from one or more of its conditions.        //it is always safe to add a byte first.
359  //Additional permissions that are applicable to the entire Program shall        arg->buf[byte_offset & 0x7F] = *data;
360  //be treated as though they were included in this License, to the extent  
361  //that they are valid under applicable law.  If additional permissions        //Nothing to do unless this was the final byte of the buffer.
362  //apply only to part of the Program, that part may be used separately        if ((byte_offset & 0x7F) == 127)
363  //under those permissions, but the entire Program remains governed by           {
364  //this License without regard to the additional permissions.           ESRG_SHA512_DoSha512Rounds(arg);
365  //           }
366  //  When you convey a copy of a covered work, you may at your option  
367  //remove any additional permissions from that copy, or from any part of        //Increment.
368  //it.  (Additional permissions may be written to require their own        data++;
369  //removal in certain cases when you modify the work.)  You may place        byte_offset++;
370  //additional permissions on material, added by you to a covered work,        arg->bit_count += 8;
371  //for which you have or can give appropriate copyright permission.        }
372  //     }
373  //  Notwithstanding any other provision of this License, for material you  
374  //add to a covered work, you may (if authorized by the copyright holders of  
375  //that material) supplement the terms of this License with terms:  void ESRG_SHA512_Sha512StateStructClose(struct ESRG_SHA512_Sha512StateStruct  *state,
376  //                                          struct ESRG_SHA512_Sha512ResultStruct *result)
377  //    a) Disclaiming warranty or limiting liability differently from the     {
378  //    terms of sections 15 and 16 of this License; or     unsigned __int64 msglen;
379  //        //Used to hold message length before we pad the message.
380  //    b) Requiring preservation of specified reasonable legal notices or     unsigned char c80 = 0x80;
381  //    author attributions in that material or in the Appropriate Legal        //Used to append the "1" per FIPS 180-3.
382  //    Notices displayed by works containing it; or     unsigned char c00 = 0x00;
383  //        //Used to add 0's per FIPS 180-3.
384  //    c) Prohibiting misrepresentation of the origin of that material, or     unsigned char  length_buf[16];
385  //    requiring that modified versions of such material be marked in        //Buffer used to form the message length and append it to the message per FIPS 180-3.
386  //    reasonable ways as different from the original version; or  
387  //     //Be sure the input pointers aren't obviously invalid.
388  //    d) Limiting the use for publicity purposes of names of licensors or     assert(state  != NULL);
389  //    authors of the material; or     assert(result != NULL);
390  //  
391  //    e) Declining to grant rights under trademark law for use of some     //Snapshot the message length.  We'll be changing it when we pad the message.
392  //    trade names, trademarks, or service marks; or     msglen = state->bit_count;
393  //  
394  //    f) Requiring indemnification of licensors and authors of that     //Add the required "1" to the end of the message, per FIPS 180-3.  Because
395  //    material by anyone who conveys the material (or modified versions of     //this software module only allows the addition of bytes (not bits), adding the
396  //    it) with contractual assumptions of liability to the recipient, for     //"1" will always involve adding the byte 0x80.
397  //    any liability that these contractual assumptions directly impose on     ESRG_SHA512_Sha512StateStructAddData(state, &c80, 1);
398  //    those licensors and authors.  
399  //     //Add enough 0's to the message so that we have exactly room for 16 bytes (128 bits)
400  //  All other non-permissive additional terms are considered "further     //of length information at the end of the message.
401  //restrictions" within the meaning of section 10.  If the Program as you     while ((state->bit_count & 0x3FF) != 896)
402  //received it, or any part of it, contains a notice stating that it is        ESRG_SHA512_Sha512StateStructAddData(state, &c00, 1);
403  //governed by this License along with a term that is a further  
404  //restriction, you may remove that term.  If a license document contains     //Calculate the length as a series of bytes.
405  //a further restriction but permits relicensing or conveying under this     length_buf[ 0] = 0;
406  //License, you may add to a covered work material governed by the terms     length_buf[ 1] = 0;
407  //of that license document, provided that the further restriction does     length_buf[ 2] = 0;
408  //not survive such relicensing or conveying.     length_buf[ 3] = 0;
409  //     length_buf[ 4] = 0;
410  //  If you add terms to a covered work in accord with this section, you     length_buf[ 5] = 0;
411  //must place, in the relevant source files, a statement of the     length_buf[ 6] = 0;
412  //additional terms that apply to those files, or a notice indicating     length_buf[ 7] = 0;
413  //where to find the applicable terms.     length_buf[ 8] = (unsigned char)((msglen >> 56) & 0xFF);
414  //     length_buf[ 9] = (unsigned char)((msglen >> 48) & 0xFF);
415  //  Additional terms, permissive or non-permissive, may be stated in the     length_buf[10] = (unsigned char)((msglen >> 40) & 0xFF);
416  //form of a separately written license, or stated as exceptions;     length_buf[11] = (unsigned char)((msglen >> 32) & 0xFF);
417  //the above requirements apply either way.     length_buf[12] = (unsigned char)((msglen >> 24) & 0xFF);
418  //     length_buf[13] = (unsigned char)((msglen >> 16) & 0xFF);
419  //  8. Termination.     length_buf[14] = (unsigned char)((msglen >>  8) & 0xFF);
420  //     length_buf[15] = (unsigned char)((msglen) & 0xFF);
421  //  You may not propagate or modify a covered work except as expressly  
422  //provided under this License.  Any attempt otherwise to propagate or     //Add the length to the message.  This should work out to generate the
423  //modify it is void, and will automatically terminate your rights under     //final manipulation round.
424  //this License (including any patent licenses granted under the third     ESRG_SHA512_Sha512StateStructAddData(state, length_buf, 16);
425  //paragraph of section 11).  
426  //     //Copy the words from the state vector to the result vector.
427  //  However, if you cease all violation of this License, then your     result->sha512_words[0] = state->H0;
428  //license from a particular copyright holder is reinstated (a)     result->sha512_words[1] = state->H1;
429  //provisionally, unless and until the copyright holder explicitly and     result->sha512_words[2] = state->H2;
430  //finally terminates your license, and (b) permanently, if the copyright     result->sha512_words[3] = state->H3;
431  //holder fails to notify you of the violation by some reasonable means     result->sha512_words[4] = state->H4;
432  //prior to 60 days after the cessation.     result->sha512_words[5] = state->H5;
433  //     result->sha512_words[6] = state->H6;
434  //  Moreover, your license from a particular copyright holder is     result->sha512_words[7] = state->H7;
435  //reinstated permanently if the copyright holder notifies you of the  
436  //violation by some reasonable means, this is the first time you have     //Form a string from the hash vector.
437  //received notice of violation of this License (for any work) from that     ESRG_SHA512_CopyWordsToStringBuffer(result);
438  //copyright holder, and you cure the violation prior to 30 days after  
439  //your receipt of the notice.     //Destroy the state, which may contain sensitive information.
440  //     //This idea came from Rivest's sample code.
441  //  Termination of your rights under this section does not terminate the     memset(state, 0, sizeof(struct ESRG_SHA512_Sha512StateStruct));
442  //licenses of parties who have received copies or rights from you under     }
443  //this License.  If your rights have been terminated and not permanently  
444  //reinstated, you do not qualify to receive new licenses for the same  
445  //material under section 10.  //Returns version control string for file.
446  //  //
447  //  9. Acceptance Not Required for Having Copies.  const char *ESRG_SHA512_cvcinfo(void)
448  //     {  
449  //  You are not required to accept this License in order to receive or     return ("$Header$");
450  //run a copy of the Program.  Ancillary propagation of a covered work     }
451  //occurring solely as a consequence of using peer-to-peer transmission  
452  //to receive a copy likewise does not require acceptance.  However,  
453  //nothing other than this License grants you permission to propagate or  //Returns version control string for associated .H file.
454  //modify any covered work.  These actions infringe copyright if you do  //
455  //not accept this License.  Therefore, by modifying or propagating a  const char *ESRG_SHA512_hvcinfo(void)
456  //covered work, you indicate your acceptance of this License to do so.     {  
457  //     return (ESRG_SHA512_H_VERSION);
458  //  10. Automatic Licensing of Downstream Recipients.     }
459  //  
460  //  Each time you convey a covered work, the recipient automatically  //End of esrg_sha512.c.
 //receives a license from the original licensors, to run, modify and  
 //propagate that work, subject to this License.  You are not responsible  
 //for enforcing compliance by third parties with this License.  
 //  
 //  An "entity transaction" is a transaction transferring control of an  
 //organization, or substantially all assets of one, or subdividing an  
 //organization, or merging organizations.  If propagation of a covered  
 //work results from an entity transaction, each party to that  
 //transaction who receives a copy of the work also receives whatever  
 //licenses to the work the party's predecessor in interest had or could  
 //give under the previous paragraph, plus a right to possession of the  
 //Corresponding Source of the work from the predecessor in interest, if  
 //the predecessor has it or can get it with reasonable efforts.  
 //  
 //  You may not impose any further restrictions on the exercise of the  
 //rights granted or affirmed under this License.  For example, you may  
 //not impose a license fee, royalty, or other charge for exercise of  
 //rights granted under this License, and you may not initiate litigation  
 //(including a cross-claim or counterclaim in a lawsuit) alleging that  
 //any patent claim is infringed by making, using, selling, offering for  
 //sale, or importing the Program or any portion of it.  
 //  
 //  11. Patents.  
 //  
 //  A "contributor" is a copyright holder who authorizes use under this  
 //License of the Program or a work on which the Program is based.  The  
 //work thus licensed is called the contributor's "contributor version".  
 //  
 //  A contributor's "essential patent claims" are all patent claims  
 //owned or controlled by the contributor, whether already acquired or  
 //hereafter acquired, that would be infringed by some manner, permitted  
 //by this License, of making, using, or selling its contributor version,  
 //but do not include claims that would be infringed only as a  
 //consequence of further modification of the contributor version.  For  
 //purposes of this definition, "control" includes the right to grant  
 //patent sublicenses in a manner consistent with the requirements of  
 //this License.  
 //  
 //  Each contributor grants you a non-exclusive, worldwide, royalty-free  
 //patent license under the contributor's essential patent claims, to  
 //make, use, sell, offer for sale, import and otherwise run, modify and  
 //propagate the contents of its contributor version.  
 //  
 //  In the following three paragraphs, a "patent license" is any express  
 //agreement or commitment, however denominated, not to enforce a patent  
 //(such as an express permission to practice a patent or covenant not to  
 //sue for patent infringement).  To "grant" such a patent license to a  
 //party means to make such an agreement or commitment not to enforce a  
 //patent against the party.  
 //  
 //  If you convey a covered work, knowingly relying on a patent license,  
 //and the Corresponding Source of the work is not available for anyone  
 //to copy, free of charge and under the terms of this License, through a  
 //publicly available network server or other readily accessible means,  
 //then you must either (1) cause the Corresponding Source to be so  
 //available, or (2) arrange to deprive yourself of the benefit of the  
 //patent license for this particular work, or (3) arrange, in a manner  
 //consistent with the requirements of this License, to extend the patent  
 //license to downstream recipients.  "Knowingly relying" means you have  
 //actual knowledge that, but for the patent license, your conveying the  
 //covered work in a country, or your recipient's use of the covered work  
 //in a country, would infringe one or more identifiable patents in that  
 //country that you have reason to believe are valid.  
 //  
 //  If, pursuant to or in connection with a single transaction or  
 //arrangement, you convey, or propagate by procuring conveyance of, a  
 //covered work, and grant a patent license to some of the parties  
 //receiving the covered work authorizing them to use, propagate, modify  
 //or convey a specific copy of the covered work, then the patent license  
 //you grant is automatically extended to all recipients of the covered  
 //work and works based on it.  
 //  
 //  A patent license is "discriminatory" if it does not include within  
 //the scope of its coverage, prohibits the exercise of, or is  
 //conditioned on the non-exercise of one or more of the rights that are  
 //specifically granted under this License.  You may not convey a covered  
 //work if you are a party to an arrangement with a third party that is  
 //in the business of distributing software, under which you make payment  
 //to the third party based on the extent of your activity of conveying  
 //the work, and under which the third party grants, to any of the  
 //parties who would receive the covered work from you, a discriminatory  
 //patent license (a) in connection with copies of the covered work  
 //conveyed by you (or copies made from those copies), or (b) primarily  
 //for and in connection with specific products or compilations that  
 //contain the covered work, unless you entered into that arrangement,  
 //or that patent license was granted, prior to 28 March 2007.  
 //  
 //  Nothing in this License shall be construed as excluding or limiting  
 //any implied license or other defenses to infringement that may  
 //otherwise be available to you under applicable patent law.  
 //  
 //  12. No Surrender of Others' Freedom.  
 //  
 //  If conditions are imposed on you (whether by court order, agreement or  
 //otherwise) that contradict the conditions of this License, they do not  
 //excuse you from the conditions of this License.  If you cannot convey a  
 //covered work so as to satisfy simultaneously your obligations under this  
 //License and any other pertinent obligations, then as a consequence you may  
 //not convey it at all.  For example, if you agree to terms that obligate you  
 //to collect a royalty for further conveying from those to whom you convey  
 //the Program, the only way you could satisfy both those terms and this  
 //License would be to refrain entirely from conveying the Program.  
 //  
 //  13. Use with the GNU Affero General Public License.  
 //  
 //  Notwithstanding any other provision of this License, you have  
 //permission to link or combine any covered work with a work licensed  
 //under version 3 of the GNU Affero General Public License into a single  
 //combined work, and to convey the resulting work.  The terms of this  
 //License will continue to apply to the part which is the covered work,  
 //but the special requirements of the GNU Affero General Public License,  
 //section 13, concerning interaction through a network will apply to the  
 //combination as such.  
 //  
 //  14. Revised Versions of this License.  
 //  
 //  The Free Software Foundation may publish revised and/or new versions of  
 //the GNU General Public License from time to time.  Such new versions will  
 //be similar in spirit to the present version, but may differ in detail to  
 //address new problems or concerns.  
 //  
 //  Each version is given a distinguishing version number.  If the  
 //Program specifies that a certain numbered version of the GNU General  
 //Public License "or any later version" applies to it, you have the  
 //option of following the terms and conditions either of that numbered  
 //version or of any later version published by the Free Software  
 //Foundation.  If the Program does not specify a version number of the  
 //GNU General Public License, you may choose any version ever published  
 //by the Free Software Foundation.  
 //  
 //  If the Program specifies that a proxy can decide which future  
 //versions of the GNU General Public License can be used, that proxy's  
 //public statement of acceptance of a version permanently authorizes you  
 //to choose that version for the Program.  
 //  
 //  Later license versions may give you additional or different  
 //permissions.  However, no additional obligations are imposed on any  
 //author or copyright holder as a result of your choosing to follow a  
 //later version.  
 //  
 //  15. Disclaimer of Warranty.  
 //  
 //  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY  
 //APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT  
 //HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY  
 //OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,  
 //THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR  
 //PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM  
 //IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF  
 //ALL NECESSARY SERVICING, REPAIR OR CORRECTION.  
 //  
 //  16. Limitation of Liability.  
 //  
 //  IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING  
 //WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS  
 //THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY  
 //GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE  
 //USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF  
 //DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD  
 //PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),  
 //EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF  
 //SUCH DAMAGES.  
 //  
 //  17. Interpretation of Sections 15 and 16.  
 //  
 //  If the disclaimer of warranty and limitation of liability provided  
 //above cannot be given local legal effect according to their terms,  
 //reviewing courts shall apply local law that most closely approximates  
 //an absolute waiver of all civil liability in connection with the  
 //Program, unless a warranty or assumption of liability accompanies a  
 //copy of the Program in return for a fee.  
 //  
 //                     END OF TERMS AND CONDITIONS  
 //  
 //            How to Apply These Terms to Your New Programs  
 //  
 //  If you develop a new program, and you want it to be of the greatest  
 //possible use to the public, the best way to achieve this is to make it  
 //free software which everyone can redistribute and change under these terms.  
 //  
 //  To do so, attach the following notices to the program.  It is safest  
 //to attach them to the start of each source file to most effectively  
 //state the exclusion of warranty; and each file should have at least  
 //the "copyright" line and a pointer to where the full notice is found.  
 //  
 //    <one line to give the program's name and a brief idea of what it does.>  
 //    Copyright (C) <year>  <name of author>  
 //  
 //    This program is free software: you can redistribute it and/or modify  
 //    it under the terms of the GNU General Public License as published by  
 //    the Free Software Foundation, either version 3 of the License, or  
 //    (at your option) any later version.  
 //  
 //    This program is distributed in the hope that it will be useful,  
 //    but WITHOUT ANY WARRANTY; without even the implied warranty of  
 //    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the  
 //    GNU General Public License for more details.  
 //  
 //    You should have received a copy of the GNU General Public License  
 //    along with this program.  If not, see <http://www.gnu.org/licenses/>.  
 //  
 //Also add information on how to contact you by electronic and paper mail.  
 //  
 //  If the program does terminal interaction, make it output a short  
 //notice like this when it starts in an interactive mode:  
 //  
 //    <program>  Copyright (C) <year>  <name of author>  
 //    This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.  
 //    This is free software, and you are welcome to redistribute it  
 //    under certain conditions; type `show c' for details.  
 //  
 //The hypothetical commands `show w' and `show c' should show the appropriate  
 //parts of the General Public License.  Of course, your program's commands  
 //might be different; for a GUI interface, you would use an "about box".  
 //  
 //  You should also get your employer (if you work as a programmer) or school,  
 //if any, to sign a "copyright disclaimer" for the program, if necessary.  
 //For more information on this, and how to apply and follow the GNU GPL, see  
 //<http://www.gnu.org/licenses/>.  
 //  
 //  The GNU General Public License does not permit incorporating your program  
 //into proprietary programs.  If your program is a subroutine library, you  
 //may consider it more useful to permit linking proprietary applications with  
 //the library.  If this is what you want to do, use the GNU Lesser General  
 //Public License instead of this License.  But first, please read  
 //<http://www.gnu.org/philosophy/why-not-lgpl.html>.  
 //-------------------------------------------------------------------------------------------------  
 //--------------------------------------------------------------------------------  
 #define MODULE_ESRG_SHA512  
   
 #include <assert.h>  
 #include <stddef.h>  
 #include <string.h>  
   
 #include "charfunc.h"  
 #include "esrg_sha512.h"  
   
 //This is a right rotation macro for efficiency.  This  
 //macro rotates a 64-bit quantity x right (cyclically) by  
 //n bits.  Nomenclature from FIPS 180-3.  
 #define ESRG_SHA512_FUNC_ROTR(x, n) (((x) >> (n)) | ((x) << (64-(n))))  
   
 //This is a right shift macro for efficiency.  This  
 //macro shifts a 64-bit quantity x right by  
 //n bits.  Nomenclature from FIPS 180-3.  
 #define ESRG_SHA512_FUNC_SHR(x, n) ((x) >> (n))  
   
 //These functions come directly from FIPS 180-3.  
 #define ESRG_SHA512_FUNC_CH(x, y, z)  (((x) & (y)) ^ (~(x) & (z)))  
 #define ESRG_SHA512_FUNC_MAJ(x, y, z) (((x) & (y)) ^ ((x) & (z)) ^ ((y) & (z)))  
 #define ESRG_SHA512_FUNC_SIGMABIG_0(x) (ESRG_SHA512_FUNC_ROTR(x, 28) ^ ESRG_SHA512_FUNC_ROTR(x, 34) ^ ESRG_SHA512_FUNC_ROTR(x, 39))  
 #define ESRG_SHA512_FUNC_SIGMABIG_1(x) (ESRG_SHA512_FUNC_ROTR(x, 14) ^ ESRG_SHA512_FUNC_ROTR(x, 18) ^ ESRG_SHA512_FUNC_ROTR(x, 41))  
 #define ESRG_SHA512_FUNC_SIGMASMALL_0(x) (ESRG_SHA512_FUNC_ROTR(x,  1) ^ ESRG_SHA512_FUNC_ROTR(x,  8) ^ ESRG_SHA512_FUNC_SHR(x,  7))  
 #define ESRG_SHA512_FUNC_SIGMASMALL_1(x) (ESRG_SHA512_FUNC_ROTR(x, 19) ^ ESRG_SHA512_FUNC_ROTR(x, 61) ^ ESRG_SHA512_FUNC_SHR(x,  6))  
   
 //Constants, from FIPS 180-3.  
 const unsigned __int64 ESRG_SHA512_K[80] =  
             {0x428a2f98d728ae22UL, 0x7137449123ef65cdUL,  
              0xb5c0fbcfec4d3b2fUL, 0xe9b5dba58189dbbcUL,  
              0x3956c25bf348b538UL, 0x59f111f1b605d019UL,  
              0x923f82a4af194f9bUL, 0xab1c5ed5da6d8118UL,  
              0xd807aa98a3030242UL, 0x12835b0145706fbeUL,  
              0x243185be4ee4b28cUL, 0x550c7dc3d5ffb4e2UL,  
              0x72be5d74f27b896fUL, 0x80deb1fe3b1696b1UL,  
              0x9bdc06a725c71235UL, 0xc19bf174cf692694UL,  
              0xe49b69c19ef14ad2UL, 0xefbe4786384f25e3UL,  
              0x0fc19dc68b8cd5b5UL, 0x240ca1cc77ac9c65UL,  
              0x2de92c6f592b0275UL, 0x4a7484aa6ea6e483UL,  
              0x5cb0a9dcbd41fbd4UL, 0x76f988da831153b5UL,  
              0x983e5152ee66dfabUL, 0xa831c66d2db43210UL,  
              0xb00327c898fb213fUL, 0xbf597fc7beef0ee4UL,  
              0xc6e00bf33da88fc2UL, 0xd5a79147930aa725UL,  
              0x06ca6351e003826fUL, 0x142929670a0e6e70UL,  
              0x27b70a8546d22ffcUL, 0x2e1b21385c26c926UL,  
              0x4d2c6dfc5ac42aedUL, 0x53380d139d95b3dfUL,  
              0x650a73548baf63deUL, 0x766a0abb3c77b2a8UL,  
              0x81c2c92e47edaee6UL, 0x92722c851482353bUL,  
              0xa2bfe8a14cf10364UL, 0xa81a664bbc423001UL,  
              0xc24b8b70d0f89791UL, 0xc76c51a30654be30UL,  
              0xd192e819d6ef5218UL, 0xd69906245565a910UL,  
              0xf40e35855771202aUL, 0x106aa07032bbd1b8UL,  
              0x19a4c116b8d2d0c8UL, 0x1e376c085141ab53UL,  
              0x2748774cdf8eeb99UL, 0x34b0bcb5e19b48a8UL,  
              0x391c0cb3c5c95a63UL, 0x4ed8aa4ae3418acbUL,  
              0x5b9cca4f7763e373UL, 0x682e6ff3d6b2b8a3UL,  
              0x748f82ee5defb2fcUL, 0x78a5636f43172f60UL,  
              0x84c87814a1f0ab72UL, 0x8cc702081a6439ecUL,  
              0x90befffa23631e28UL, 0xa4506cebde82bde9UL,  
              0xbef9a3f7b2c67915UL, 0xc67178f2e372532bUL,  
              0xca273eceea26619cUL, 0xd186b8c721c0c207UL,  
              0xeada7dd6cde0eb1eUL, 0xf57d4f7fee6ed178UL,  
              0x06f067aa72176fbaUL, 0x0a637dc5a2c898a6UL,  
              0x113f9804bef90daeUL, 0x1b710b35131c471bUL,  
              0x28db77f523047d84UL, 0x32caab7b40c72493UL,  
              0x3c9ebe0a15c9bebcUL, 0x431d67c49c100d4cUL,  
              0x4cc5d4becb3e42b6UL, 0x597f299cfc657e2aUL,  
              0x5fcb6fab3ad6faecUL, 0x6c44198c4a475817UL};  
   
   
 void ESRG_SHA512_Sha512StateStructOpen(struct ESRG_SHA512_Sha512StateStruct *arg)  
    {  
    assert(arg != NULL);  
   
    memset(arg, 0, sizeof(struct ESRG_SHA512_Sha512StateStruct));  
       //Everything to zero, processed bitcount automatically set to zero.  
   
    //This assignment comes directly from FIPS 180-3.  
    arg->H0 = 0x6a09e667f3bcc908UL;  
    arg->H1 = 0xbb67ae8584caa73bUL;  
    arg->H2 = 0x3c6ef372fe94f82bUL;  
    arg->H3 = 0xa54ff53a5f1d36f1UL;  
    arg->H4 = 0x510e527fade682d1UL;  
    arg->H5 = 0x9b05688c2b3e6c1fUL;  
    arg->H6 = 0x1f83d9abfb41bd6bUL;  
    arg->H7 = 0x5be0cd19137e2179UL;  
    }  
   
   
 //Copies the byte buffer to the word buffer within the state block.  
 //This is done in a way which hides big-endian/little-endian concerns.  
 //  
 static void ESRG_SHA512_CopyBytesToWords(struct ESRG_SHA512_Sha512StateStruct *arg)  
    {  
    unsigned int i;  
   
    assert(arg != NULL);  
   
    //Copy the buffer contents into the words.  We need to be careful  
    //to do this correctly, because of big-endian/little-endian concerns.  
    //From FIPS 180-3 (alluded to, not really stated), the message is  
    //loaded in from M[0] down to M[15].  Additionally, per the other  
    //conventions in the document, the first byte is uppermost in each  
    //word.  
    for (i=0; i<16; i++)  
       {  
       assert((i * 8 + 3) < 128);  
       arg->M[i] = (((unsigned __int64)(arg->buf[i*8+0])) << 56)  
                   +  
                   (((unsigned __int64)(arg->buf[i*8+1])) << 48)  
                   +  
                   (((unsigned __int64)(arg->buf[i*8+2])) << 40)  
                   +  
                   (((unsigned __int64)(arg->buf[i*8+3])) << 32)  
                   +  
                   (((unsigned __int64)(arg->buf[i*8+4])) << 24)  
                   +  
                   (((unsigned __int64)(arg->buf[i*8+5])) << 16)  
                   +  
                   (((unsigned __int64)(arg->buf[i*8+6])) <<  8)  
                   +  
                   (((unsigned __int64)(arg->buf[i*8+7])));  
       }  
    }  
   
   
 //Copies the buffer of words into a string buffer of string length 128, and also places  
 //the zero terminator, which means that the string supplied by the caller must be of size  
 //129 or larger.  
 //  
 static void ESRG_SHA512_CopyWordsToStringBuffer(struct ESRG_SHA512_Sha512ResultStruct *arg)  
    {  
    unsigned int i, j;  
    unsigned char *puc;  
    unsigned __int64 woi;  
   
    assert(arg != NULL);  
   
    //Copy the buffer contents into the words.  We need to be careful  
    //to do this correctly, because of big-endian/little-endian concerns.  
    //From FIPS 180-3 (alluded to, not really stated), the message is  
    //loaded in from M[0] down to M[15].  Additionally, per the other  
    //conventions in the document, the first byte is uppermost in each  
    //word.  
    for (i=0; i<8; i++)  
       {  
       woi = arg->sha512_words[i];  
   
           //Form a pointer to the buffer location of interest.  We work  
           //backwards.  
           puc = (unsigned char *)(arg->sha512_chars) + (i * 16) + 15;  
   
           //Fill in the buffer.  
       for (j=0; j<16; j++)  
             {  
         *puc = (unsigned char)CHARFUNC_nibble_to_lc_hex_digit((int)(woi & 0xF));  
                 woi >>= 4;  
                 puc--;  
             }  
       }  
   
    //Place the zero string terminator.  
    arg->sha512_chars[128] = 0;  
    }  
   
   
 //Does the SHA-512 rounds as specified by FIPS 180-3.  
   
 static void ESRG_SHA512_DoSha512Rounds(struct ESRG_SHA512_Sha512StateStruct *arg)  
    {  
    int i;  
       //Iteration variable.  
    unsigned __int64 T1, T2;  
       //Temporary variables.  Nomenclature is from FIPS 180-3.  
    unsigned __int64 M[16];  
       //Buffer of message block to avoid repeated dereferences.  
    unsigned __int64 H[8];  
       //Buffer of hash state to avoid repeated dereferences.  
    unsigned __int64 W[80];  
       //Working variable.  Nomenclature directly from FIPS 180-3.  
    unsigned __int64 a, b, c, d, e, f, g, h;  
       //Nomenclature above directly from FIPS 180-3.  
   
    assert(arg != NULL);  
   
    //Copy bytes into words.  
    ESRG_SHA512_CopyBytesToWords(arg);  
   
    //Copy out the message buffer for speed.  This should avoid repeated  
    //dereferences.  
    M[ 0] = arg->M[ 0];  
    M[ 1] = arg->M[ 1];  
    M[ 2] = arg->M[ 2];  
    M[ 3] = arg->M[ 3];  
    M[ 4] = arg->M[ 4];  
    M[ 5] = arg->M[ 5];  
    M[ 6] = arg->M[ 6];  
    M[ 7] = arg->M[ 7];  
    M[ 8] = arg->M[ 8];  
    M[ 9] = arg->M[ 9];  
    M[10] = arg->M[10];  
    M[11] = arg->M[11];  
    M[12] = arg->M[12];  
    M[13] = arg->M[13];  
    M[14] = arg->M[14];  
    M[15] = arg->M[15];  
   
    //Copy out the hash state for speed.  This should avoid repeated dereferences.  
    H[0]  = arg->H0;  
    H[1]  = arg->H1;  
    H[2]  = arg->H2;  
    H[3]  = arg->H3;  
    H[4]  = arg->H4;  
    H[5]  = arg->H5;  
    H[6]  = arg->H6;  
    H[7]  = arg->H7;  
   
    //Prepare the message schedule.  The nomenclature comes directly from FIPS 180-3.  
    W[ 0] = M[ 0];  
    W[ 1] = M[ 1];  
    W[ 2] = M[ 2];  
    W[ 3] = M[ 3];  
    W[ 4] = M[ 4];  
    W[ 5] = M[ 5];  
    W[ 6] = M[ 6];  
    W[ 7] = M[ 7];  
    W[ 8] = M[ 8];  
    W[ 9] = M[ 9];  
    W[10] = M[10];  
    W[11] = M[11];  
    W[12] = M[12];  
    W[13] = M[13];  
    W[14] = M[14];  
    W[15] = M[15];  
   
    for (i=16; i<80; i++)  
       {  
       W[i] =    ESRG_SHA512_FUNC_SIGMASMALL_1(W[i-2])  
                      +  W[i-7]  
                  +  ESRG_SHA512_FUNC_SIGMASMALL_0(W[i-15])  
                          +  W[i-16];  
       }  
   
    //Initialize the 8 working variables as specified in FIPS 180-3.  
    a = H[0];  
    b = H[1];  
    c = H[2];  
    d = H[3];  
    e = H[4];  
    f = H[5];  
    g = H[6];  
    h = H[7];  
   
    //Perform the rounds as specified in FIPS 180-3.  Nomenclature below comes from  
    //FIPS 180-3.  
    for (i=0; i<80; i++)  
       {  
       T1 =    h  
                     + ESRG_SHA512_FUNC_SIGMABIG_1(e)  
                         + ESRG_SHA512_FUNC_CH(e, f, g)  
                         + ESRG_SHA512_K[i]  
                 + W[i];  
           //  
       T2 =    ESRG_SHA512_FUNC_SIGMABIG_0(a)  
             + ESRG_SHA512_FUNC_MAJ(a, b, c);  
       //  
           h = g;  
           //  
           g = f;  
           //  
           f = e;  
           //  
           e = d + T1;  
           //  
           d = c;  
           //  
           c = b;  
           //  
           b = a;  
           //  
           a = T1 + T2;  
       }  
   
    //Compute the next hash value.  The nomenclature comes from FIPS 180-3.  
    H[0] = a + H[0];  
    H[1] = b + H[1];  
    H[2] = c + H[2];  
    H[3] = d + H[3];  
    H[4] = e + H[4];  
    H[5] = f + H[5];  
    H[6] = g + H[6];  
    H[7] = h + H[7];  
   
    //Place the local variables back in the structure.  This the only state that  
    //gets preserved between the operation of doing the rounds.  
    arg->H0 = H[0];  
    arg->H1 = H[1];  
    arg->H2 = H[2];  
    arg->H3 = H[3];  
    arg->H4 = H[4];  
    arg->H5 = H[5];  
    arg->H6 = H[6];  
    arg->H7 = H[7];  
    }  
   
   
 void ESRG_SHA512_Sha512StateStructAddData(struct    ESRG_SHA512_Sha512StateStruct *arg,  
                                           void      *pointer_in,  
                                           unsigned  len)  
    {  
    unsigned int   low_32;  
    unsigned int   byte_offset;  
    unsigned char *data;  
   
    assert(arg        != NULL);  
    assert(pointer_in != NULL);  
   
    data = (unsigned char *)pointer_in;  
       //It is easier to do it this way, rather than cast all the time.  
   
    low_32 = (unsigned int)arg->bit_count;  
       //Copy off the least significant bits.  Easier to do once.  We only  
       //need the 32 least significant because the block size is 0 modulo 1024.  
   
    byte_offset = low_32 >> 3;  
       //This gives our byte offset, up to 500+Mb or so.  
   
    while(len--)  
       {  
       //We process rounds AFTER a byte is added to the buffer.  So  
       //it is always safe to add a byte first.  
       arg->buf[byte_offset & 0x7F] = *data;  
   
       //Nothing to do unless this was the final byte of the buffer.  
       if ((byte_offset & 0x7F) == 127)  
          {  
          ESRG_SHA512_DoSha512Rounds(arg);  
          }  
   
       //Increment.  
       data++;  
       byte_offset++;  
       arg->bit_count += 8;  
       }  
    }  
   
   
 void ESRG_SHA512_Sha512StateStructClose(struct ESRG_SHA512_Sha512StateStruct  *state,  
                                         struct ESRG_SHA512_Sha512ResultStruct *result)  
    {  
    unsigned __int64 msglen;  
       //Used to hold message length before we pad the message.  
    unsigned char c80 = 0x80;  
       //Used to append the "1" per FIPS 180-3.  
    unsigned char c00 = 0x00;  
       //Used to add 0's per FIPS 180-3.  
    unsigned char  length_buf[16];  
       //Buffer used to form the message length and append it to the message per FIPS 180-3.  
   
    //Be sure the input pointers aren't obviously invalid.  
    assert(state  != NULL);  
    assert(result != NULL);  
   
    //Snapshot the message length.  We'll be changing it when we pad the message.  
    msglen = state->bit_count;  
   
    //Add the required "1" to the end of the message, per FIPS 180-3.  Because  
    //this software module only allows the addition of bytes (not bits), adding the  
    //"1" will always involve adding the byte 0x80.  
    ESRG_SHA512_Sha512StateStructAddData(state, &c80, 1);  
   
    //Add enough 0's to the message so that we have exactly room for 16 bytes (128 bits)  
    //of length information at the end of the message.  
    while ((state->bit_count & 0x3FF) != 896)  
       ESRG_SHA512_Sha512StateStructAddData(state, &c00, 1);  
   
    //Calculate the length as a series of bytes.  
    length_buf[ 0] = 0;  
    length_buf[ 1] = 0;  
    length_buf[ 2] = 0;  
    length_buf[ 3] = 0;  
    length_buf[ 4] = 0;  
    length_buf[ 5] = 0;  
    length_buf[ 6] = 0;  
    length_buf[ 7] = 0;  
    length_buf[ 8] = (unsigned char)((msglen >> 56) & 0xFF);  
    length_buf[ 9] = (unsigned char)((msglen >> 48) & 0xFF);  
    length_buf[10] = (unsigned char)((msglen >> 40) & 0xFF);  
    length_buf[11] = (unsigned char)((msglen >> 32) & 0xFF);  
    length_buf[12] = (unsigned char)((msglen >> 24) & 0xFF);  
    length_buf[13] = (unsigned char)((msglen >> 16) & 0xFF);  
    length_buf[14] = (unsigned char)((msglen >>  8) & 0xFF);  
    length_buf[15] = (unsigned char)((msglen) & 0xFF);  
   
    //Add the length to the message.  This should work out to generate the  
    //final manipulation round.  
    ESRG_SHA512_Sha512StateStructAddData(state, length_buf, 16);  
   
    //Copy the words from the state vector to the result vector.  
    result->sha512_words[0] = state->H0;  
    result->sha512_words[1] = state->H1;  
    result->sha512_words[2] = state->H2;  
    result->sha512_words[3] = state->H3;  
    result->sha512_words[4] = state->H4;  
    result->sha512_words[5] = state->H5;  
    result->sha512_words[6] = state->H6;  
    result->sha512_words[7] = state->H7;  
   
    //Form a string from the hash vector.  
    ESRG_SHA512_CopyWordsToStringBuffer(result);  
   
    //Destroy the state, which may contain sensitive information.  
    //This idea came from Rivest's sample code.  
    memset(state, 0, sizeof(struct ESRG_SHA512_Sha512StateStruct));  
    }  
   
   
 //Returns version control string for file.  
 //  
 const char *ESRG_SHA512_cvcinfo(void)  
    {    
    return ("$Header: /cvsroot/esrg/sfesrg/esrgpcpj/shared/c_datd/esrg_sha512.c,v 1.5 2009/11/29 02:16:05 dtashley Exp $");  
    }  
   
   
 //Returns version control string for associated .H file.  
 //  
 const char *ESRG_SHA512_hvcinfo(void)  
    {    
    return (ESRG_SHA512_H_VERSION);  
    }  
   
   
 /******************************************************************************  
 ** $Log: esrg_sha512.c,v $  
 ** Revision 1.5  2009/11/29 02:16:05  dtashley  
 ** Passed final review.  
 **  
 ** Revision 1.4  2009/11/28 19:09:02  dtashley  
 ** Appears to be working.  Ready for final review and cleanup.  
 **  
 ** Revision 1.3  2009/11/28 18:17:03  dtashley  
 ** Development edits.  
 **  
 ** Revision 1.2  2009/11/28 06:56:28  dtashley  
 ** Edits.  
 **  
 ** Revision 1.1  2009/11/28 00:09:15  dtashley  
 ** Initial checkin.  
 *******************************************************************************  
 ** End of ESRG_SHA512.C. */  
Legend:
Removed from v.29  
changed lines
  Added in v.71
dashley@gmail.com
 ViewVC Help
Powered by ViewVC 1.1.25