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
|
/*
* TLSH is provided for use under two licenses: Apache OR BSD.
* Users may opt to use either license depending on the license
* restictions of the systems with which they plan to integrate
* the TLSH code.
*/
/* ==============
* Apache License
* ==============
* Copyright 2013 Trend Micro Incorporated
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
/* ===========
* BSD License
* ===========
* Copyright (c) 2013, Trend Micro Incorporated
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without modification,
* are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice, this
* list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* 3. Neither the name of the copyright holder nor the names of its contributors
* may be used to endorse or promote products derived from this software without
* specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
* ANY EXPRESS 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 COPYRIGHT HOLDER 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.
*/
//////////////////////////////////////////////////////////////////////////
//
// (C) Trend Micro
// written Jon Oliver 2009 and 2010
//
//////////////////////////////////////////////////////////////////////////
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <assert.h>
#include <sys/time.h>
#include "tlsh.h"
static void time_tlsh(char *buffer, int buffer_size, int MAX_TRY, int check)
{
struct timeval tp;
long before_ms;
long after_ms;
Tlsh t1;
int fc_cons_option = 0;
int showvers = 1;
for (int experiment=0; experiment<4; experiment++) {
const char *experiment_name;
const char *result;
if (experiment == 0) {
fc_cons_option = 0;
experiment_name = "WARM UP";
result = "T1A12500088C838B0A0F0EC3C0ACAB82F3B8228B0308CFA302338C0F0AE2C24F28000008";
} else if (experiment == 1) {
fc_cons_option = 0;
experiment_name = "DEFAULT";
result = "T1A12500088C838B0A0F0EC3C0ACAB82F3B8228B0308CFA302338C0F0AE2C24F28000008";
} else if (experiment == 2) {
fc_cons_option = TLSH_OPTION_THREADED;
experiment_name = "THREADED";
result = "T1002500088C838B0A0F0EC3C0ACAB82F3B8228B0308CFA302338C0F0AE2C24F28000008";
} else if (experiment == 3) {
fc_cons_option = TLSH_OPTION_PRIVATE;
experiment_name = "PRIVATE";
result = "T1002500088C838B0A0F0EC3C0ACAB82F3B8228B0308CFA302338C0F0AE2C24F28000008";
}
printf("eval TLSH %s (%s) %d times...\n", experiment_name, Tlsh::version(), MAX_TRY );
gettimeofday(&tp, NULL);
before_ms = tp.tv_sec * 1000 + tp.tv_usec / 1000; //get current timestamp in milliseconds
if (check) {
for (int tries=0; tries<MAX_TRY; tries++) {
t1.reset();
t1.final( (const unsigned char*) buffer, buffer_size, fc_cons_option);
if (strcmp(t1.getHash(showvers), result) != 0) {
printf("test failed...");
printf(" result=%s\n", result);
printf(" TLSH =%s\n", t1.getHash(showvers) );
exit(1);
}
}
} else {
for (int tries=0; tries<MAX_TRY; tries++) {
t1.reset();
t1.final( (const unsigned char*) buffer, buffer_size, fc_cons_option);
}
}
gettimeofday(&tp, NULL);
printf("TLSH(buffer) = %s\n", t1.getHash(showvers) );
after_ms = tp.tv_sec * 1000 + tp.tv_usec / 1000; //get current timestamp in milliseconds
long diff = (after_ms - before_ms);
double per_iter = (double) diff / (double) MAX_TRY;
printf("BEFORE ms=%ld\n", before_ms);
printf("AFTER ms=%ld\n", after_ms);
printf("TIME ms=%ld\n", diff);
printf("TIME ms=%6.2f per iteration\n", per_iter);
printf("\n");
}
}
#define MILLION 1000000
#define MAX_TRY_VALUE 500
int main(int argc, char *argv[])
{
int argIdx = 1;
int buffer_size = MILLION;
int showvers = 1;
int check = 0;
while (argc > argIdx) {
if (strcmp(argv[argIdx], "-version") == 0) {
printf("%s\n", Tlsh::version());
return 0;
}
if (strcmp(argv[argIdx], "-check") == 0) {
check = 1;
}
if (strcmp(argv[argIdx], "-size") == 0) {
char *str = argv[argIdx+1];
if ( (str[0] >= '0') && (str[0] <= '9')) {
buffer_size = atoi(argv[argIdx+1]);
} else {
printf("bad size=%s\n", str);
return(1);
}
}
argIdx ++;
}
Tlsh t1;
Tlsh t2;
char *buffer;
char *buffer2;
struct timeval tp;
long before_ms;
long after_ms;
if (buffer_size == MILLION) {
printf("build a buffer with a million bytes...\n" );
} else {
printf("build a buffer with a %d bytes...\n", buffer_size );
}
buffer = new char[buffer_size];
for (int i = 0; i < buffer_size; i++) {
buffer[i] = i % 26 + 'A';
}
buffer[buffer_size-1] = '\0';
printf("Test 1: Evaluate TLSH digest\n");
time_tlsh(buffer, buffer_size, MAX_TRY_VALUE, check);
printf("\n");
int fc_cons_option = 0;
t1.reset();
t1.final( (const unsigned char*) buffer, buffer_size, fc_cons_option);
buffer2 = new char[buffer_size];
for (int i = 0; i < buffer_size; i++) {
buffer2[i] = i % 90 + ' ';
}
buffer2[buffer_size-1] = '\0';
t2.reset();
t2.final( (const unsigned char*) buffer2, buffer_size);
int dist = 0;
int max_try = (MAX_TRY_VALUE/10) * MILLION;
printf("eval TLSH distance %d million times...\n", max_try / MILLION );
gettimeofday(&tp, NULL);
before_ms = tp.tv_sec * 1000 + tp.tv_usec / 1000; //get current timestamp in milliseconds
for (int tries=0; tries<max_try; tries++) {
dist = t1.totalDiff(&t2);
}
gettimeofday(&tp, NULL);
after_ms = tp.tv_sec * 1000 + tp.tv_usec / 1000; //get current timestamp in milliseconds
long diff = (after_ms - before_ms);
double per_iter = (double) diff / (double) (max_try / MILLION);
printf("Test 2: Calc distance TLSH digest\n");
printf("dist=%d\n", dist);
printf("BEFORE ms=%ld\n", before_ms);
printf("AFTER ms=%ld\n", after_ms);
printf("TIME ms=%ld\n", diff);
printf("TIME ms=%6.2f per million iterations\n", per_iter);
printf("\n");
delete[] buffer;
delete[] buffer2;
}
|