Monday, 26 June 2017

DiceLockSecurity Knowledge

DicelockSecurity (version 9.X)

Linux - Source Code

DiceLock-x 9.0.0.1
DiceChecker-x 6.0.0.1
HashDigester-x 6.0.0.1
Previous Versions
arrow DiceLock-x 9.0.0.1 arrow longestRunOfOnesTest.cpp
longestRunOfOnesTest.cpp (Longest Run Of Ones random number test 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
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
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
 
//
// Creator:    http://www.dicelocksecurity.com
// Version:    vers.9.0.0.1
//
// Copyright (C) 2008-2013 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.
// 
// DICELOCK IS PROTECTED BY US PATENT 7508945 AND EUROPEAN PATENT 1182777 WHERE APPLICABLE.
//
// LICENSE INFORMATION CAN BE OBTAINED AT CORPORATE WEB SITE
//
 
#include <memory.h>
#include <stdlib.h>
#include <math.h>
#include <float.h>
#include "longestRunOfOnesTest.h"
 
 
namespace DiceLockSecurity {
  
  namespace RandomTest {
 
  // Random Test Class enumerator name
  const RandomTests LongestRunOfOnesTest::test = LongestRunOfOnes;
  // Random Test Class minimum stream length
  const unsigned long int  LongestRunOfOnesTest::minimumLength = 128;
 
  // Random Test Class block sizes and minimum lengths
  const unsigned short int LongestRunOfOnesTest::numberBlockSizes = 3;
  const LongestRunOfOnesTest::blockSizeMinimumLength LongestRunOfOnesTest::blockSizes[] = {{8, 128}, {128, 6272}, {10000, 750000}};
 
  const unsigned short int LongestRunOfOnesTest::NumAssignments = 7;  
 
  // Constructor, default 
  LongestRunOfOnesTest::LongestRunOfOnesTest() {
 
    this->longRunCase = 0;
    this->substringNumber = 0;
    this->substringLength = 0;
    this->chiSquared = 0.0;
    this->assignment = (unsigned long int*)calloc(NumAssignments, sizeof(unsigned long int));
    if (this->assignment == NULL) {
      this->error = InsufficientMemory;
    }
    else {
      memset(this->assignment, 0, sizeof(unsigned long int)*NumAssignments);
    }
  }
 
 
  // Constructor with a MathematicalFunctions object instantiated 
  LongestRunOfOnesTest::LongestRunOfOnesTest(MathematicalFunctions* mathFuncObj) {
 
    this->longRunCase = 0;
    this->substringNumber = 0;
    this->substringLength = 0;
    this->chiSquared = 0.0;
    this->assignment = (unsigned long int*)calloc(NumAssignments, sizeof(unsigned long int));
    if (this->assignment == NULL) {
      this->error = InsufficientMemory;
    }
    else {
      memset(this->assignment, 0, sizeof(unsigned long int)*NumAssignments);
    }
  }
 
  // Destructor
  LongestRunOfOnesTest::~LongestRunOfOnesTest() {
 
    this->longRunCase = 0;
    this->substringNumber = 0;
    this->substringLength = 0;
    this->chiSquared = 0.0;
    memset(this->assignment, 0, sizeof(unsigned long int)*NumAssignments);
    free(this->assignment);
  }
  
  // Gets the BaseRandomTest random state of the last executed BaseCryptoRandomStream
  bool LongestRunOfOnesTest::IsRandom(void) {
 
    return BaseRandomTest::IsRandom();
  }
 
  // Tests randomness of the BaseCryptoRandomStream and returns the random value
  bool LongestRunOfOnesTest::IsRandom(BaseCryptoRandomStream* bitStream) {
    double  run = 0, v_n_obs = 0;
    double  pi[7];
    unsigned long int K;
    unsigned long int i = 0, j = 0;
    signed long int  k[7];
    unsigned long int nu[7] = {0, 0, 0, 0, 0, 0, 0};
 
    if ( bitStream->GetBitLength() < 128 ) {
      this->error = InsufficientNumberOfBits;
      this->random = false;
      return this->random;
    }
    if ( bitStream->GetBitLength() < 6272 ) {
        K = 3;
        substringLength = 8;
        pi[0] = 0.21484375;
        pi[1] = 0.3671875;
        pi[2] = 0.23046875;
        pi[3] = 0.1875;
        k[0] = 1;
        k[1] = 2;
        k[2] = 3;
        k[3] = 4;
    }
    else {
      if ( bitStream->GetBitLength() < 750000 ) {
          K = 5;
        substringLength = 128;
        pi[0] = 0.1174035788;
        pi[1] = 0.242955959;
        pi[2] = 0.249363483;
        pi[3] = 0.17517706;
        pi[4] = 0.102701071;
        pi[5] = 0.112398847;
        k[0] = 4;
        k[1] = 5;
        k[2] = 6;
        k[3] = 7;
        k[4] = 8;
        k[5] = 9;
      }
      else {
          K = 6;
          substringLength = 10000;
          pi[0] = 0.0882;
          pi[1] = 0.2092;
          pi[2] = 0.2483;
          pi[3] = 0.1933;
          pi[4] = 0.1208;
          pi[5] = 0.0675;
          pi[6] = 0.0727;
        k[0] = 10;
        k[1] = 11;
        k[2] = 12;
        k[3] = 13;
        k[4] = 14;
        k[5] = 15;
        k[6] = 16;
      }
    }
    
    this->error = NoError;
    this->substringNumber = (unsigned long int)floor((long double)(bitStream->GetBitLength()/substringLength));
    bitStream->SetBitPosition(0);
    for(i = 0; i < this->substringNumber; i++)  {
      v_n_obs = 0.e0;
      run = 0.e0;
      for(j = 0; j < substringLength; j++) {
        if ((unsigned long int)bitStream->GetBitPosition(i * substringLength + j) == 1) {
          run++;
          v_n_obs = MAX(v_n_obs, run); 
        }
        else {
          run = 0.e0;
        }
      }
      if ( v_n_obs < k[0] ) {
        nu[0]++;
      }
      for (j = 0; j <= K; j++) {
        if ( v_n_obs == k[j] ) {
          nu[j]++;
        }
      }
      if ( v_n_obs > k[K] ) {
        nu[K]++;
      }
    }
    this->chiSquared = 0.0;          
    for(i = 0; i <= K; i++) {
      this->chiSquared += (((double)nu[i] - (double)this->substringNumber * pi[i]) * (nu[i] - (double)this->substringNumber * pi[i])) / ((double)this->substringNumber * pi[i]);
    }
    this->pValue = mathFuncs->IGammaC((double)(K/2.0),(this->chiSquared/2.0));
    if (isNegative(this->pValue) || isGreaterThanOne(this->pValue)) {
      this->error = PValueOutOfRange;
      this->random = false;
    }
    else {
      if (this->pValue < this->alpha) {     
        this->random = false;
      }
      else {
        this->random = true;
      }
    }
    for (i = 0; i < K+1; i++)
      this->assignment[i] = nu[i];
    return this->random;
  }
 
  // Initializes the object
  void LongestRunOfOnesTest::Initialize(void) {
 
    BaseRandomTest::Initialize();
    this->longRunCase = 0;
    this->substringNumber = 0;
    this->substringLength = 0;
    this->chiSquared = 0.0;
    memset(this->assignment, 0, sizeof(unsigned long int)*NumAssignments);
  }
 
  // Gets the type of the object
  RandomTests LongestRunOfOnesTest::GetType(void) {
 
    return this->test;
  }
 
  // Gets the minimum random stream length
  unsigned long int LongestRunOfOnesTest::GetMinimumLength(void) {
 
    return this->minimumLength;
  }
 
  // Sets the longRunCase run parameter in bits
  void LongestRunOfOnesTest::SetLongRunCase(unsigned long int runBitLength) {
 
    this->longRunCase = runBitLength;
  }
 
  // Gets the longRunCase parameter 
  unsigned long int LongestRunOfOnesTest::GetLongRunCase(void) {
 
    return this->longRunCase;
  }
 
  // Gets the "substringNumber" result 
  unsigned long int LongestRunOfOnesTest::GetSubstringNumber(void) {
 
    return this->substringNumber;
  }
 
  // Gets the "substringLength" result
  unsigned long int LongestRunOfOnesTest::GetSubstringLength(void) {
 
    return this->substringLength;
  }
 
  // Gets the chiSquared result
  double LongestRunOfOnesTest::GetChiSquared(void) {
 
    return this->chiSquared;
  }
 
  // Gets the Assignment result
  void LongestRunOfOnesTest::GetAssignment(unsigned long int *assign) {
 
    memcpy(assign, this->assignment, sizeof(unsigned long int)*NumAssignments);
  }
 
  // Gets the Assignment result based on the index
  unsigned long int LongestRunOfOnesTest::GetAssignmentOfIndex(unsigned long int index)  {
 
    return this->assignment[index];
  }
  }
}