--- a/kerneltest/e32utils/nistsecurerng/src/overlappingtemplatematchings.cpp Wed Sep 15 13:42:27 2010 +0300
+++ /dev/null Thu Jan 01 00:00:00 1970 +0000
@@ -1,132 +0,0 @@
-/*
-* Portions Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).
-* All rights reserved.
-* This component and the accompanying materials are made available
-* under the terms of "Eclipse Public License v1.0"
-* which accompanies this distribution, and is available
-* at the URL "http://www.eclipse.org/legal/epl-v10.html".
-*
-* Initial Contributors:
-* Nokia Corporation - initial contribution.
-*
-* Contributors:
-*
-* Description:
-* The original NIST Statistical Test Suite code is placed in public domain.
-* (http://csrc.nist.gov/groups/ST/toolkit/rng/documentation_software.html)
-*
-* This software was developed at the National Institute of Standards and Technology by
-* employees of the Federal Government in the course of their official duties. Pursuant
-* to title 17 Section 105 of the United States Code this software is not subject to
-* copyright protection and is in the public domain. The NIST Statistical Test Suite is
-* an experimental system. NIST assumes no responsibility whatsoever for its use by other
-* parties, and makes no guarantees, expressed or implied, about its quality, reliability,
-* or any other characteristic. We would appreciate acknowledgment if the software is used.
-*/
-
-#include "openc.h"
-#include "../include/externs.h"
-#include "../include/utilities.h"
-#include "../include/cephes.h"
-
-/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
- O V E R L A P P I N G T E M P L A T E T E S T
- * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
-double Pr(int u, double eta);
-
-void
-OverlappingTemplateMatchings(int m, int n)
-{
- int i, k, match;
- double W_obs, eta, sum, chi2, p_value, lambda;
- int M, N, j, K = 5;
- unsigned int nu[6] = { 0, 0, 0, 0, 0, 0 };
- double pi[6] = { 0.143783, 0.139430, 0.137319, 0.124314, 0.106209, 0.348945 };
- BitSequence *sequence;
-
- M = 1032;
- N = n/M;
-
- if ( (sequence = (BitSequence *) calloc(m, sizeof(BitSequence))) == NULL ) {
- fprintf(stats[TEST_OVERLAPPING], "\t\t OVERLAPPING TEMPLATE OF ALL ONES TEST\n");
- fprintf(stats[TEST_OVERLAPPING], "\t\t---------------------------------------------\n");
- fprintf(stats[TEST_OVERLAPPING], "\t\tTEMPLATE DEFINITION: Insufficient memory, Overlapping Template Matchings test aborted!\n");
- }
- else
- for ( i=0; i<m; i++ )
- sequence[i] = 1;
-
- lambda = (double)(M-m+1)/pow(2,m);
- eta = lambda/2.0;
- sum = 0.0;
- for ( i=0; i<K; i++ ) { /* Compute Probabilities */
- pi[i] = Pr(i, eta);
- sum += pi[i];
- }
- pi[K] = 1 - sum;
-
- for ( i=0; i<N; i++ ) {
- W_obs = 0;
- for ( j=0; j<M-m+1; j++ ) {
- match = 1;
- for ( k=0; k<m; k++ ) {
- if ( sequence[k] != epsilon[i*M+j+k] )
- match = 0;
- }
- if ( match == 1 )
- W_obs++;
- }
- if ( W_obs <= 4 )
- nu[(int)W_obs]++;
- else
- nu[K]++;
- }
- sum = 0;
- chi2 = 0.0; /* Compute Chi Square */
- for ( i=0; i<K+1; i++ ) {
- chi2 += pow((double)nu[i] - (double)N*pi[i], 2)/((double)N*pi[i]);
- sum += nu[i];
- }
- p_value = cephes_igamc(K/2.0, chi2/2.0);
-
- fprintf(stats[TEST_OVERLAPPING], "\t\t OVERLAPPING TEMPLATE OF ALL ONES TEST\n");
- fprintf(stats[TEST_OVERLAPPING], "\t\t-----------------------------------------------\n");
- fprintf(stats[TEST_OVERLAPPING], "\t\tCOMPUTATIONAL INFORMATION:\n");
- fprintf(stats[TEST_OVERLAPPING], "\t\t-----------------------------------------------\n");
- fprintf(stats[TEST_OVERLAPPING], "\t\t(a) n (sequence_length) = %d\n", n);
- fprintf(stats[TEST_OVERLAPPING], "\t\t(b) m (block length of 1s) = %d\n", m);
- fprintf(stats[TEST_OVERLAPPING], "\t\t(c) M (length of substring) = %d\n", M);
- fprintf(stats[TEST_OVERLAPPING], "\t\t(d) N (number of substrings) = %d\n", N);
- fprintf(stats[TEST_OVERLAPPING], "\t\t(e) lambda [(M-m+1)/2^m] = %f\n", lambda);
- fprintf(stats[TEST_OVERLAPPING], "\t\t(f) eta = %f\n", eta);
- fprintf(stats[TEST_OVERLAPPING], "\t\t-----------------------------------------------\n");
- fprintf(stats[TEST_OVERLAPPING], "\t\t F R E Q U E N C Y\n");
- fprintf(stats[TEST_OVERLAPPING], "\t\t 0 1 2 3 4 >=5 Chi^2 P-value Assignment\n");
- fprintf(stats[TEST_OVERLAPPING], "\t\t-----------------------------------------------\n");
- fprintf(stats[TEST_OVERLAPPING], "\t\t%3d %3d %3d %3d %3d %3d %f ",
- nu[0], nu[1], nu[2], nu[3], nu[4], nu[5], chi2);
-
- if ( isNegative(p_value) || isGreaterThanOne(p_value) )
- fprintf(stats[TEST_OVERLAPPING], "WARNING: P_VALUE IS OUT OF RANGE.\n");
-
- free(sequence);
- fprintf(stats[TEST_OVERLAPPING], "%f %s\n\n", p_value, p_value < ALPHA ? "FAILURE" : "SUCCESS");
- fprintf(results[TEST_OVERLAPPING], "%f\n", p_value);
-}
-
-double
-Pr(int u, double eta)
-{
- int l;
- double sum, p;
-
- if ( u == 0 )
- p = exp(-eta);
- else {
- sum = 0.0;
- for ( l=1; l<=u; l++ )
- sum += exp(-eta-u*log(2)+l*log(eta)-cephes_lgam(l+1)+cephes_lgam(u)-cephes_lgam(l)-cephes_lgam(u-l+1));
- p = sum;
- }
- return p;
-}