Monday, 25 September 2017

DiceLockSecurity Knowledge

DicelockSecurity (version 9.X)

Apple Mac OS X

XDiceLock 8.0.0.1
Previous Versions
arrow XDiceLock 8.0.0.1 arrow baseSha32.cpp
baseSha32.cpp (base Sha 1 & 256 secure hash digest algorithm C++ source code file) Print E-mail
Get C++ DiceLock cipher architecture source code packages of DiceLock for Microsoft Visual Studio 2013 and DiceLock-x for Linux with Test Driver Programs and Response Test Vector files to verify that both them work as expected.
DiceLock for Windows and Linux
DiceLock Security governing software licenses are Free/Libre Source Code License and Educational and Research License

DiceLock is protected by US patent 7508945 and European Patent 1182777 where applicable.

DiceLock and DiceLock logo are trademarks or registered trademarks in the EC, USA and others.

License information can be obtained at our corporate web site




1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
 
//
//  baseSha32.cpp
//  XDiceLock
//
//  Created by DiceLock on 1/3/12.
//  Copyright (c) 2009-2012 DiceLock Security, LLC. All rights reserved.
//
 
//
// Creator:    http://www.dicelocksecurity.com
// Version:    vers.8.0.0.1
//
// Copyright (c) 2009-2012 DiceLock Security, LLC. All rights reserved.
//
//                               DISCLAIMER
//
// THIS SOFTWARE IS PROVIDED "AS IS" AND ANY EXPRESSED OR IMPLIED WARRANTIES,
// INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY
// AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
// REGENTS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
// OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
// WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
// OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
// ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
// 
// DICELOCK IS A REGISTERED TRADEMARK OR TRADEMARK OF THE OWNERS.
// 
 
#include <memory.h>
#include "baseSha32.h"
 
 
namespace DiceLockSecurity {
  
    namespace Hash {
        
        // Number of data bits to compute hash
        const unsigned short int BaseSha32::hashBlockBits = BASESHA_32_BLOCKBITS;
        // Number of data unsigned chars to compute hash
        const unsigned short int BaseSha32::hashBlockUCs = BASESHA_32_BLOCKUCHARS;
        // Number of data unsigned shorts to compute hash
        const unsigned short int BaseSha32::hashBlockUSs = BASESHA_32_BLOCKUSHORTS;
        // Number of data unsigned ints to compute hash
        const unsigned short int BaseSha32::hashBlockULs = BASESHA_32_BLOCKUINTS;
        
        // Equation modulo constant value
        const unsigned short int BaseSha32::equationModulo = BASESHA_32_EQUATIONMODULO;
        
        // Adds messaage length processed, if it is greater than unsigned int makes use
        // of another usigned int to store overflow
        void BaseSha32::AddMessageLength(unsigned int byteLength) {
            
            if ((this->messageBitLengthLow + (byteLength * BYTEBITS)) < this->messageBitLengthLow) 
                // add overflow of unsigned int
                this->messageBitLengthHigh++;
            this->messageBitLengthLow += (byteLength  * BYTEBITS);
        }
        
        // Swap bytes for little endian
        void BaseSha32::SwapLittleEndian(void) {
            unsigned int swap, i;
            
            for ( i = 0; i < this->messageDigest->GetULLength(); i++ ) {
                swap = this->messageDigest->GetULPosition(i);
                this->messageDigest->SetUCPosition( (i * 4), (unsigned char)(swap >> 24) & 0xFF);
                this->messageDigest->SetUCPosition( (i * 4) + 1, (unsigned char)(swap >> 16) & 0xFF);
                this->messageDigest->SetUCPosition( (i * 4) + 2, (unsigned char)(swap >> 8) & 0xFF);
                this->messageDigest->SetUCPosition( (i * 4) + 3, (unsigned char)(swap & 0xFF));
            }
            
        }
        
        // Constructor, default 
        BaseSha32::BaseSha32() {
            
            this->remainingBytesLength = 0;
            this->messageBitLengthHigh = 0;
            this->messageBitLengthLow = 0;
        }
        
        // Destructor
        BaseSha32::~BaseSha32() {
            
            this->remainingBytesLength = 0;
            this->messageBitLengthHigh = 0;
            this->messageBitLengthLow = 0;
        }
        
        // Adds the BaseCryptoRandomStream to the hash
        void BaseSha32::Add(BaseCryptoRandomStream* stream) {
            unsigned int startStreamByte = 0, processBytes = 0;
            unsigned int numBytes = 0;
            
            // If bytes left from previous added stream, then they will be processed now with added data from new stream
            if (this->remainingBytesLength) {
                if ((this->remainingBytesLength + stream->GetUCLength()) > (this->GetUCHashBlockLength() - 1)) {
                    // Setting the point to start the current stream processed
                    startStreamByte = this->GetUCHashBlockLength() - this->remainingBytesLength;
                    processBytes = stream->GetUCLength() - (this->GetUCHashBlockLength() - this->remainingBytesLength);
                    
                    memcpy(this->remainingBytes + this->remainingBytesLength, stream->GetUCAddressPosition(0), this->GetUCHashBlockLength() - this->remainingBytesLength);
                    // Process remaining bytes of previous streams adn 64 byte padding of current stream
                    this->Compress(this->messageDigest, this->remainingBytes);
                    // Updating message byt length processed
                    this->AddMessageLength(this->GetUCHashBlockLength());
                    // Remaining bytes of previous strema set to 0
                    this->remainingBytesLength = 0;
                }
                else {
                    processBytes = stream->GetUCLength();
                }
            }
            else {
                processBytes = stream->GetUCLength();
                startStreamByte = 0;
            }
            
            for (numBytes = 0; processBytes > (this->GetUCHashBlockLength() - 1); numBytes += this->GetUCHashBlockLength()) {
                // Process the chunk
                this->Compress(this->messageDigest, stream->GetUCAddressPosition(startStreamByte + numBytes));
                // Updating message byt length processed
                this->AddMessageLength(this->GetUCHashBlockLength()); 
                processBytes -= this->GetUCHashBlockLength();
            }
            
            // If remaining bytes left, they will be copied for the next added stream
            if (processBytes > 0) {
                memcpy(this->remainingBytes + this->remainingBytesLength, stream->GetUCAddressPosition(stream->GetUCLength() - processBytes), processBytes);
                this->remainingBytesLength += processBytes;
            }
        }
        
        // Finalize the hash
        void BaseSha32::Finalize(void) {
            
            this->remainingBytes[this->remainingBytesLength] = 0x80;
            if ((this->remainingBytesLength * BYTEBITS) % this->hashBlockBits >= this->equationModulo) {
                memset(this->remainingBytes + this->remainingBytesLength + 1, 0, this->GetUCHashBlockLength() - this->remainingBytesLength -1);
                this->Compress(this->messageDigest, this->remainingBytes);
                this->AddMessageLength(this->remainingBytesLength);
                memset(this->remainingBytes, 0, this->GetUCHashBlockLength());
                this->remainingBytesLength = 0;
            }
            else {
                memset(this->remainingBytes + this->remainingBytesLength + 1, 0, this->GetUCHashBlockLength() - this->remainingBytesLength -1);
            }
            this->AddMessageLength(this->remainingBytesLength); 
            this->remainingBytes[56] = (this->messageBitLengthHigh >> 24) & 255;
            this->remainingBytes[57] = (this->messageBitLengthHigh >> 16) & 255;
            this->remainingBytes[58] = (this->messageBitLengthHigh >> 8) & 255;
            this->remainingBytes[59] = (this->messageBitLengthHigh) & 255;
            this->remainingBytes[60] = (this->messageBitLengthLow >> 24) & 255;
            this->remainingBytes[61] = (this->messageBitLengthLow >> 16) & 255;
            this->remainingBytes[62] = (this->messageBitLengthLow >> 8) & 255;
            this->remainingBytes[63] = (this->messageBitLengthLow) & 255;
            this->Compress(this->messageDigest, this->remainingBytes);
        }
        
        // Gets the number of bits in the hash block to be hashed
        unsigned short int BaseSha32::GetBitHashBlockLength(void) {
            
            return this->hashBlockBits;
        }
        
        // Gets the number of unsigned chars in the hash block to be hashed
        unsigned short int BaseSha32::GetUCHashBlockLength(void) {
            
            return this->hashBlockUCs;
        }
        
        // Gets the number of unsigned short ints in the hash block to be hashed
        unsigned short int BaseSha32::GetUSHashBlockLength(void) {
            
            return this->hashBlockUSs;
        }
        
        // Gets the number of unsigned ints in the hash block to be hashed
        unsigned short int BaseSha32::GetULHashBlockLength(void) {
            
            return this->hashBlockULs;
        }
        
    }
}