Friday, 24 November 2017
arrow DiceChecker 6.0.0.1 arrow cumulativeSumReverseTest.cpp
cumulativeSumReverseTest.cpp (Cumulative Sum Reverse 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
 
//
// Creator:    http://www.dicelocksecurity.com
// Version:    vers.6.0.0.1
//
// Copyright  2008-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 <stdlib.h>
#include <math.h>
#include "cumulativeSumReverseTest.h"
 
 
namespace DiceLockSecurity {
  
  namespace RandomTest {
 
  // Random Test Class enumerator name
  const RandomTests CumulativeSumReverseTest::test = CumulativeSumReverse;
  // Random Test Class minimum stream length
  const unsigned long int  CumulativeSumReverseTest::minimumLength = 100;
 
  // Constructor, default 
  CumulativeSumReverseTest::CumulativeSumReverseTest() {
 
    this->cuSum = 0;
  }
 
 
  // Constructor with a MathematicalFunctions object instantiated 
  CumulativeSumReverseTest::CumulativeSumReverseTest(MathematicalFunctions* mathFuncObj) {
 
    this->cuSum = 0;
  }
 
  // Destructor
  CumulativeSumReverseTest::~CumulativeSumReverseTest() {
 
    this->cuSum = 0;
  }
 
  // Gets the BaseRandomTest random state of the last executed BaseCryptoRandomStream
  bool CumulativeSumReverseTest::IsRandom(void) {
 
    return BaseRandomTest::IsRandom();
  }
 
  // Tests randomness of the BaseCryptoRandomStream and returns the random value
  bool CumulativeSumReverseTest::IsRandom(BaseCryptoRandomStream* bitStream) {
    signed long int i, k, start, finish;
    double z, sum, sum1, sum2;
 
    if (bitStream->GetBitLength() < this->GetMinimumLength()) {
      this->error = InsufficientNumberOfBits;
      this->random = false;
      return this->random;
    }
    bitStream->SetBitPosition(bitStream->GetBitLength() -1);
    this->error = NoError;
    sum = 0.0;
    this->cuSum = 1;
    for(i = bitStream->GetBitLength() -1; i >= 0; i--) {
      sum += 2*(int)bitStream->GetBitReverse() - 1;
        this->cuSum = MAX(this->cuSum, fabs(sum));
    }
    z = this->cuSum;
    sum1 = 0.0;
    start = (-(long)bitStream->GetBitLength()/(int)z+1)/4;
    finish = (bitStream->GetBitLength()/(int)z-1)/4;
    for(k = start; k <= finish; k++)
      sum1 += (this->mathFuncs->Normal((4*k+1)*z/sqrt((double)bitStream->GetBitLength()))-this->mathFuncs->Normal((4*k-1)*z/sqrt((double)bitStream->GetBitLength())));
    sum2 = 0.0;
    start = (-(long)bitStream->GetBitLength()/(int)z-3)/4;
    finish = (bitStream->GetBitLength()/(int)z-1)/4;
    for(k = start; k <= finish; k++)
      sum2 += (this->mathFuncs->Normal((4*k+3)*z/sqrt((double)bitStream->GetBitLength()))-this->mathFuncs->Normal((4*k+1)*z/sqrt((double)bitStream->GetBitLength())));
    this->pValue = 1.0 - sum1 + sum2;
    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; 
      }
    }
    return this->random;
  }
 
  // Initializes the object
  void CumulativeSumReverseTest::Initialize(void) {
 
    BaseRandomTest::Initialize();
    this->cuSum = 0;
  }
 
  // Gets the type of the object
  RandomTests CumulativeSumReverseTest::GetType(void) {
 
    return this->test;
  }
 
  // Gets the minimum random stream length
  unsigned long int CumulativeSumReverseTest::GetMinimumLength(void) {
 
    return this->minimumLength;
  }
 
  // Gets the maximum partial sum
  double CumulativeSumReverseTest::GetCuSum(void) {
 
    return this->cuSum;
  }
  }
}