--- a/kerneltest/e32utils/nistsecurerng/src/nonoverlappingtemplatematchings.cpp Wed Sep 15 13:42:27 2010 +0300
+++ /dev/null Thu Jan 01 00:00:00 1970 +0000
@@ -1,149 +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"
-
-/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
- N O N O V E R L A P P I N G T E M P L A T E T E S T
- * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
-
-void
-NonOverlappingTemplateMatchings(int m, int n)
-{
- int numOfTemplates[100] = {0, 0, 2, 4, 6, 12, 20, 40, 74, 148, 284, 568, 1116,
- 2232, 4424, 8848, 17622, 35244, 70340, 140680, 281076, 562152};
- /*----------------------------------------------------------------------------
- NOTE: Should additional templates lengths beyond 21 be desired, they must
- first be constructed, saved into files and then the corresponding
- number of nonperiodic templates for that file be stored in the m-th
- position in the numOfTemplates variable.
- ----------------------------------------------------------------------------*/
- unsigned int W_obs, *Wj = NULL;
- double sum, chi2, p_value, lambda, pi[6], varWj;
- int i, j, jj, k, match, SKIP, M, N, K = 5;
-
- ResetTemplateIndex();
-
- N = 8;
- M = n/N;
-
- if ( (Wj = (unsigned int*)calloc(N, sizeof(unsigned int))) == NULL ) {
- fprintf(stats[TEST_NONPERIODIC], "\tNONOVERLAPPING TEMPLATES TESTS ABORTED DUE TO ONE OF THE FOLLOWING : \n");
- fprintf(stats[TEST_NONPERIODIC], "\tInsufficient memory for required work space.\n");
- return;
- }
- lambda = (M-m+1)/pow(2, m);
- varWj = M*(1.0/pow(2.0, m) - (2.0*m-1.0)/pow(2.0, 2.0*m));
-
- if ( isNegative(lambda) || isZero(lambda))
- {
- fprintf(stats[TEST_NONPERIODIC], "\tNONOVERLAPPING TEMPLATES TESTS ABORTED DUE TO ONE OF THE FOLLOWING : \n");
- fprintf(stats[TEST_NONPERIODIC], "\tLambda (%f) not being positive!\n", lambda);
- }
- else {
- fprintf(stats[TEST_NONPERIODIC], "\t\t NONPERIODIC TEMPLATES TEST\n");
- fprintf(stats[TEST_NONPERIODIC], "-------------------------------------------------------------------------------------\n");
- fprintf(stats[TEST_NONPERIODIC], "\t\t COMPUTATIONAL INFORMATION\n");
- fprintf(stats[TEST_NONPERIODIC], "-------------------------------------------------------------------------------------\n");
- fprintf(stats[TEST_NONPERIODIC], "\tLAMBDA = %f\tM = %d\tN = %d\tm = %d\tn = %d\n", lambda, M, N, m, n);
- fprintf(stats[TEST_NONPERIODIC], "-------------------------------------------------------------------------------------\n");
- fprintf(stats[TEST_NONPERIODIC], "\t\tF R E Q U E N C Y\n");
- fprintf(stats[TEST_NONPERIODIC], "Template W_1 W_2 W_3 W_4 W_5 W_6 W_7 W_8 Chi^2 P_value Assignment Index\n");
- fprintf(stats[TEST_NONPERIODIC], "-------------------------------------------------------------------------------------\n");
-
- if ( numOfTemplates[m] < MAXNUMOFTEMPLATES )
- SKIP = 1;
- else
- SKIP = (int)(numOfTemplates[m]/MAXNUMOFTEMPLATES);
- numOfTemplates[m] = (int)numOfTemplates[m]/SKIP;
-
- sum = 0.0;
- for ( i=0; i<2; i++ ) { /* Compute Probabilities */
- pi[i] = exp(-lambda+i*log(lambda)-cephes_lgam(i+1));
- sum += pi[i];
- }
- pi[0] = sum;
- for ( i=2; i<=K; i++ ) { /* Compute Probabilities */
- pi[i-1] = exp(-lambda+i*log(lambda)-cephes_lgam(i+1));
- sum += pi[i-1];
- }
- pi[K] = 1 - sum;
-
- BitSequence templateSequence[KMaxBit];
-
- for( jj=0; jj<MIN(MAXNUMOFTEMPLATES, numOfTemplates[m]); jj++ ) {
- sum = 0;
- GetNextTemplateItem(templateSequence);
-
- fprintf(stats[TEST_NONPERIODIC], " ");
- 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 ( (int)templateSequence[KMaxBit - k - 1] != (int)epsilon[i*M+j+k] ) {
- match = 0;
- break;
- }
- }
- if ( match == 1 )
- W_obs++;
- }
- Wj[i] = W_obs;
- }
- sum = 0;
- chi2 = 0.0; /* Compute Chi Square */
- for ( i=0; i<N; i++ ) {
- if ( m == 10 )
- fprintf(stats[TEST_NONPERIODIC], "%3d ", Wj[i]);
- else
- fprintf(stats[TEST_NONPERIODIC], "%4d ", Wj[i]);
- chi2 += pow(((double)Wj[i] - lambda)/pow(varWj, 0.5), 2);
- }
- p_value = cephes_igamc(N/2.0, chi2/2.0);
-
- if ( isNegative(p_value) || isGreaterThanOne(p_value) )
- fprintf(stats[TEST_NONPERIODIC], "\t\tWARNING: P_VALUE IS OUT OF RANGE.\n");
-
- fprintf(stats[TEST_NONPERIODIC], "%9.6f %f %s %3d\n", chi2, p_value, p_value < ALPHA ? "FAILURE" : "SUCCESS", jj);
- if ( SKIP > 1 )
- {
- for(int index = 0; index < (SKIP-1)*2*m; ++index)
- {
- GetNextTemplateItem(templateSequence);
- }
- }
- fprintf(results[TEST_NONPERIODIC], "%f\n", p_value);
- }
- }
-
- fprintf(stats[TEST_NONPERIODIC], "\n");
- free(Wj);
-}