Tuesday, 17 October 2017
LongestRunOfOnesTest.java (Longest Run Of Ones random number test Java 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
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
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
 
//
// Creator:    http://www.dicelocksecurity.com
// Version:    vers.6.0.0.1
//
// Copyright (C) 2011-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.
//
// Environment:
// java version "1.6.0_29"
// Java(TM) SE Runtime Environment (build 1.6.0_29-b11)
// Java HotSpot(TM) Server VM (build 20.4-b02, mixed mode)
//
 
package com.dicelocksecurity.jdicelock.RandomTest;
 
import com.dicelocksecurity.jdicelock.CryptoRandomStream.BaseCryptoRandomStream;
 
/**
 * Class implementing Longest Run Of Ones random number test
 *
 * @author      Angel Ferré @ DiceLock Security
 * @version     6.0.0.1
 * @since       2011-09-30
 */
public class LongestRunOfOnesTest extends BaseRandomTest {
 
    /**
     * Random Test Class enumerator name
     */
    protected static final RandomTests TEST = RandomTests.LongestRunOfOnes;
 
    /**
     * Random Test Class minimum stream length
     */
    protected static final int MINIMUMLENGTH = 128;
 
    /**
     * NUMASSIGNMENTS constant, number of assigments
     */
    protected static final int NUMASSIGNMENTS = 7;
 
    /**
     * "longRunCase" result
     */
    protected int longRunCase;
 
    /**
     * "substringNumber" result
     */
    protected int substringNumber;
 
    /**
     * "substringLength" result
     */
    protected int substringLength;
 
    /**
     * "chiSquared" result
     */
    protected double chiSquared;
 
    /**
     * "assignment" results, 7 assigments
     */
    protected int[] assignment;
 
    /**
     * Constructor, default
     */
    public LongestRunOfOnesTest() {
 
        super();
 
        this.longRunCase = 0;
        this.substringNumber = 0;
        this.substringLength = 0;
        this.chiSquared = 0.0;
        this.assignment = new int[LongestRunOfOnesTest.NUMASSIGNMENTS];
        if (this.assignment == null) {
            this.error = RandomTestErrors.InsufficientMemory;
        } else {
            for (int i = 0; i < LongestRunOfOnesTest.NUMASSIGNMENTS; i++) {
                this.assignment[i] = 0;
            }
        }
    }
 
    /**
     * Constructor with a MathematicalFunctions object instantiated
     *
     * @param     mathFuncObj   mathematicalFunctions object that will be used by this object
     */
    public LongestRunOfOnesTest(MathematicalFunctions mathFuncObj) {
 
        super(mathFuncObj);
 
        this.longRunCase = 0;
        this.substringNumber = 0;
        this.substringLength = 0;
        this.chiSquared = 0.0;
        this.assignment = new int[LongestRunOfOnesTest.NUMASSIGNMENTS];
        if (this.assignment == null) {
            this.error = RandomTestErrors.InsufficientMemory;
        } else {
            for (int i = 0; i < LongestRunOfOnesTest.NUMASSIGNMENTS; i++) {
                this.assignment[i] = 0;
            }
        }
    }
 
    /**
     * Destructor, zeroes all data
     *
     */
    public void finalize() {
 
        this.longRunCase = 0;
        this.substringNumber = 0;
        this.substringLength = 0;
        this.chiSquared = 0.0;
        for (int i = 0; i < LongestRunOfOnesTest.NUMASSIGNMENTS; i++) {
            this.assignment[i] = 0;
        }
        this.assignment = null;
    }
 
    /**
     * Gets the BaseRandomTest random state of the last executed BaseCryptoRandomStream
     *
     * @return    boolean indication if last computed CryptoRandomStream was a randomized stream
     *            true:   last verified stream was randomized
     *            false:  last verified stream was not randomized
     */
    public boolean IsRandom() {
 
        return super.IsRandom();
    }
 
    /**
     * Tests the BaseCryptoRandomStream executed and returns the random value
     *
     * @param     bitStream   bitStream to be verified for randomness properties
     * @return    boolean     indication if CryptoRandomStream is a randomized stream
     *            true:       last verified stream was randomized
     *            false:      last verified stream was not randomized
     */
    public boolean IsRandom(BaseCryptoRandomStream bitStream) {
        double run = 0, v_n_obs = 0;
        double[] pi;
        int K;
        int i = 0, j = 0;
        int[] k;
        int[] nu = { 0, 0, 0, 0, 0, 0, 0 };
 
        pi = new double[7];
        k = new int[7];
        if (bitStream.GetBitLength() < 128) {
            this.error = RandomTestErrors.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 = RandomTestErrors.NoError;
        this.substringNumber = (int)Math.floor(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 (bitStream.GetBitPosition(i * substringLength + j) == 1) {
                    run++;
                    v_n_obs = this.mathFuncs.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(K / 2.0, (this.chiSquared / 2.0));
        if (this.mathFuncs.isNegative(this.pValue) || this.mathFuncs.isGreaterThanOne(this.pValue)) {
            this.error = RandomTestErrors.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
     *
     */
    public void Initialize() {
 
        super.Initialize();
        this.longRunCase = 0;
        this.substringNumber = 0;
        this.substringLength = 0;
        this.chiSquared = 0.0;
        for (int i = 0; i < LongestRunOfOnesTest.NUMASSIGNMENTS; i++) {
            this.assignment[i] = 0;
        }
    }
 
    /**
     * Gets the type of the object
     *
     * @return    RandomTests:     the concrete type class of the random number test, LongestRunOfOnes test for this class
     */
    public RandomTests GetType() {
 
        return LongestRunOfOnesTest.TEST;
    }
 
    /**
     * Gets the minimum random stream length
     *
     * @return    int:    minimum length in bits of streams that can be checked by this test
     */
    public int GetMinimumLength() {
 
        return LongestRunOfOnesTest.MINIMUMLENGTH;
    }
 
    /**
     * Sets the longRunCase parameter
     *
     * @param     run   Sets longRunCase parameter
     */
    public void SetLongRunCase(int run) {
 
        this.longRunCase = run;
    }
 
    /**
     * Gets the longRunCase parameter
     *
     * @return    int:    gives established "longRunCase" parameter
     */
    public int GetLongRunCase() {
 
        return this.longRunCase;
    }
 
    /**
     * Gets the "substringNumber" result
     *
     * @return    int:    gets the number of substring portions
     */
    public int GetSubstringNumber() {
 
        return this.substringNumber;
    }
 
    /**
     * Gets the "substringLength" result
     *
     * @return    int:    gets length of each substring portion
     */
    public int GetSubstringLength() {
 
        return this.substringLength;
    }
 
    /**
     * Gets the chiSquared result
     *
     * @return    double:   returns "chiSquared" result
     */
    public double GetChiSquared() {
 
        return this.chiSquared;
    }
 
    /**
     * Gets the Assignment result
     *
     * @return    int array:    Gets the assignment array
     */
    public int[] GetAssignment() {
 
        return this.assignment;
    }
 
    /**
     * Gets the Assignment result based on the index
     *
     * @param     index     index of assignment array to get its value
     * @return    int:      value of assignment corresponding to index parameter
     */
    public int GetAssignmentOfIndex(int index) {
 
        return this.assignment[index];
    }
 
}