-
Notifications
You must be signed in to change notification settings - Fork 1
/
main.pike
132 lines (111 loc) · 3.91 KB
/
main.pike
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
/*
* Copyright (C) 2022 Opera Norway AS. All rights reserved.
* This file is an original work developed by Joshua Rogers.
* 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.
*/
/*
* main.pike: The main program file.
*
* Nettle is a cryptographic library created by the Linkoping University,
* and comes pre-packaged in the Pike scripting language.
*
* The Wycheproof project provides tests for cryptographic algorithms,
* which professionals have published in an attempt to secure different
* libraries.
*
* This program attempts to cycle through each of the tests with
* the algorithms available in Pike/Nettle, and detect any errors
* based on the tests.
*
* Created by Joshua Rogers for Opera Software.
*/
#include "common.pike"
#include "aead.pike"
#include "indcpa.pike"
#include "dsa.pike"
#include "ecdsa.pike"
#include "eddsa.pike"
#include "ecdh_point.pike"
#include "mactest.pike"
#include "primal.pike"
#include "rsa_verify.pike"
#include "rsa_generate.pike"
#include "rsa_decrypt.pike"
/*
* Prepares an array of mappings from JSON files
*/
array prepare_json_cases() {
mapping(string:mapping(string:string)) json_vector;
array(mapping(string:mapping(string:string))) maps = allocate(sizeof(test_vectors));
int cases = 0;
int totaltests = 0;
for (int i=0; i<sizeof (test_vectors); i++) {
object file = Stdio.File();
if(!file->open("testvectors/"+test_vectors[i],"r")) {
log_err(DBG_ERROR,false,"Missing file: %s. Skipping.",test_vectors[i]);
continue;
}
string json_data = file->read();
file->close();
array err = catch {
json_vector = Standards.JSON.decode(json_data);
};
if(err) {
log_err(DBG_ERROR,false,"Invalid JSON loaded from %s: %s. Skipping.", test_vectors[i], describe_error(err)-"\n");
continue;
}
if(!lookup_init((string)json_vector["algorithm"])) {
DBG("Loaded JSON from %s, but skipping due to the lack of support in Pike/Nettle of the algorithm %s.", test_vectors[i], (string)json_vector["algorithm"]);
continue;
}
if(force_test && force_test != (string)json_vector["algorithm"]) {
DBG("Loaded JSON from %s, but skipping due to force-ful mode.", test_vectors[i]);
continue;
}
maps[cases] = json_vector;
maps[cases++]["file"] = (["name": test_vectors[i]]);
totaltests += (int)json_vector["numberOfTests"];
log_err(DBG_INFO,false,"Loaded JSON from %s.", test_vectors[i]);
}
log_err(DBG_INFO, false,"%d test vectors loaded, totalling %d tests.", cases, totaltests);
return maps;
}
/*
* Driver/Main script.
*/
int main(int argc, array(string) argv) {
for(int j=1; j<argc; j++) {
if(argv[j] == "D") {
dbg_mode = true;
} else if(argv[j] == "NO_COL") {
no_col = true;
} else {
force_test = argv[j];
}
}
array maps = prepare_json_cases();
if(maps[0] == 0) {
log_err(DBG_ERROR, false, "No test vectors to check. Exiting.");
return 1;
}
for(int i=0; i<sizeof(maps) && maps[i]; i++) {
string algorithm = maps[i]["algorithm"];
int fail_count = 0;
log_err(DBG_INFO, false, "Beginning tests for %s(%s).", algorithm, maps[i]["file"]["name"]);
for(int j=0; j<sizeof(maps[i]["testGroups"]); j++) {
mixed testGroup = maps[i]["testGroups"][j];
function function_to_use = lookup_function(maps[i]["schema"]);
if(function_to_use)
fail_count += function_to_use(testGroup, algorithm);
}
log_err((fail_count == 0) ? DBG_SUCCESS : DBG_ERROR, false, "Finished testing %s. %d/%d failed tests.", algorithm, fail_count, maps[i]["numberOfTests"]);
}
}