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
230
231
232
233
234
|
/* Part of SWI-Prolog
Author: Jan Wielemaker
E-mail: J.Wielemaker@vu.nl
WWW: http://www.swi-prolog.org
Copyright (c) 2000-2013, University of Amsterdam,
VU University Amsterdam
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.
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 OWNER 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.
*/
:- module(test_crypt,
[ test_crypt/0
]).
:- asserta(user:file_search_path(foreign, '.')).
:- asserta(user:file_search_path(library, '.')).
:- asserta(user:file_search_path(library, '../plunit')).
:- use_module(library(plunit)).
:- use_module(library(crypt)).
:- use_module(library(sha)).
test_crypt :-
run_tests([ crypt,
sha,
wiki_sha,
rfc2202
]).
:- begin_tests(crypt).
% Some modern crypt() no longer support classical DES passwords,
% resulting on a domain_error on the encrypted string. The second
% uses the provided MD5 alternative, which always works.
test(default, []) :-
Passwd = "My password",
( catch(crypt(Passwd, E), _, fail)
-> ground(E),
crypt(Passwd, E)
; true
).
test(md5, []) :-
Passwd = "My password",
phrase("$1$", E, _),
crypt(Passwd, E),
ground(E),
crypt(Passwd, E).
:- end_tests(crypt).
:- begin_tests(sha).
test(sha1, [true(Hash=[136, 67, 215, 249, 36, 22, 33, 29,
233, 235, 185, 99, 255, 76, 226,
129, 37, 147, 40, 120])]) :-
sha_hash(foobar, Hash, []).
test(sha1, [true(Hash=[136, 67, 215, 249, 36, 22, 33, 29,
233, 235, 185, 99, 255, 76, 226,
129, 37, 147, 40, 120])]) :-
sha_hash(foobar, Hash, [algorithm(sha1)]).
test(sha256, [true(Hash=[195, 171, 143, 241, 55, 32, 232, 173,
144, 71, 221, 57, 70, 107, 60, 137,
116, 229, 146, 194, 250, 56, 61, 74,
57, 96, 113, 76, 174, 240, 196, 242])]) :-
sha_hash(foobar, Hash, [algorithm(sha256)]).
test(hmac, [true(Hash=[16, 65, 82, 197, 191, 220, 160, 123,
198, 51, 238, 189, 70, 25, 159, 2,
85, 201, 244, 157])]) :-
hmac_sha(key, data, Hash, [algorithm(sha1)]).
test(hmac, [true(Hash=[80, 49, 254, 61, 152, 156, 109, 21,
55, 160, 19, 250, 110, 115, 157, 162,
52, 99, 253, 174, 195, 183, 1, 55, 216,
40, 227, 106, 206, 34, 27, 208])]) :-
hmac_sha(key, data, Hash, [algorithm(sha256)]).
:- end_tests(sha).
:- begin_tests(wiki_sha).
/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
Test-cases from http://en.wikipedia.org/wiki/SHA-1
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */
%! hash_to_atom(+Hash, -Atom)
%
% Translates a hash into representation used in Wikipedia page on
% SHA-1 hashes.
hash_to_atom(Hash, Atom) :-
phrase(hash_to_ascii(Hash), Codes),
atom_codes(Atom, Codes).
hash_to_ascii([]) -->
[].
hash_to_ascii([B1,B2,B3,B4|T]) -->
hex_byte(B1),
hex_byte(B2),
hex_byte(B3),
hex_byte(B4),
( { T == [] }
-> []
; " ",
hash_to_ascii(T)
).
hex_byte(Byte) -->
{ High is (Byte>>4) /\ 0xf,
Low is Byte /\ 0xf
},
hex(High),
hex(Low).
hex(Digit) -->
{ code_type(Code, xdigit(Digit))
},
[Code].
test(sha1, [true(Atom='2fd4e1c6 7a2d28fc ed849ee1 bb76e739 1b93eb12')]) :-
sha_hash("The quick brown fox jumps over the lazy dog", Hash, [algorithm(sha1)]),
hash_to_atom(Hash, Atom).
test(sha1, [true(Atom='da39a3ee 5e6b4b0d 3255bfef 95601890 afd80709')]) :-
sha_hash('', Hash, [algorithm(sha1)]),
hash_to_atom(Hash, Atom).
test(sha256, [true(Atom='d7a8fbb3 07d78094 69ca9abc b0082e4f 8d5651e4 6d3cdb76 2d02d0bf 37c9e592')]) :-
sha_hash("The quick brown fox jumps over the lazy dog", Hash, [algorithm(sha256)]),
hash_to_atom(Hash, Atom).
test(sha256, [true(Atom='e3b0c442 98fc1c14 9afbf4c8 996fb924 27ae41e4 649b934c a495991b 7852b855')]) :-
sha_hash('', Hash, [algorithm(sha256)]),
hash_to_atom(Hash, Atom).
test(sha512, [true(Atom='07e547d9 586f6a73 f73fbac0 435ed769 51218fb7 d0c8d788 a309d785 436bbb64 \c
2e93a252 a954f239 12547d1e 8a3b5ed6 e1bfd709 7821233f a0538f3d b854fee6')]) :-
sha_hash("The quick brown fox jumps over the lazy dog", Hash, [algorithm(sha512)]),
hash_to_atom(Hash, Atom).
test(sha512, [true(Atom='cf83e135 7eefb8bd f1542850 d66d8007 d620e405 0b5715dc 83f4a921 d36ce9ce \c
47d0d13c 5d85f2b0 ff8318d2 877eec2f 63b931bd 47417a81 a538327a f927da3e')]) :-
sha_hash('', Hash, [algorithm(sha512)]),
hash_to_atom(Hash, Atom).
:- end_tests(wiki_sha).
:- begin_tests(rfc2202, [condition(current_prolog_flag(bounded, false))]).
/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
HMAC SHA-1 from http://www.ipa.go.jp/security/rfc/RFC2202EN.html
HMAC SHA-2 from http://www.faqs.org/rfcs/rfc4231.html
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */
%! btwoc(+Integer, -Bytes) is det.
%! btwoc(-Integer, +Bytes) is det.
%
% Translate between a big integer and and its representation in
% bytes. The first bit is always 0, as Integer is nonneg.
btwoc(Int, Bytes) :-
integer(Int),
!,
int_to_bytes(Int, Bytes).
btwoc(Int, Bytes) :-
is_list(Bytes),
bytes_to_int(Bytes, Int).
int_to_bytes(Int, Bytes) :-
int_to_bytes(Int, [], Bytes).
int_to_bytes(Int, Bytes0, [Int|Bytes0]) :-
Int < 128,
!.
int_to_bytes(Int, Bytes0, Bytes) :-
Last is Int /\ 0xff,
Int1 is Int >> 8,
int_to_bytes(Int1, [Last|Bytes0], Bytes).
bytes_to_int([B|T], Int) :-
bytes_to_int(T, B, Int).
bytes_to_int([], Int, Int).
bytes_to_int([B|T], Int0, Int) :-
Int1 is (Int0<<8)+B,
bytes_to_int(T, Int1, Int).
%! rdf_hmac(+Key:int, +Data:list(code), -Digest:int, +Alogrithm)
rdf_hmac(Key, Data, Digest, SHA) :-
btwoc(Key, KeyCodes),
hmac_sha(KeyCodes, Data, DigestCodes, [algorithm(SHA)]),
btwoc(Digest, DigestCodes).
test(hmac_sha1_1, [true(Digest=0xb617318655057264e28bc0b6fb378c8ef146be00)]) :-
rdf_hmac(0x0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b,
"Hi There",
Digest,
sha1).
test(hmac_sha256_1, [true(Digest=0xb0344c61d8db38535ca8afceaf0bf12b881dc200c9833da726e9376c2e32cff7)]) :-
rdf_hmac(0x0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b,
"Hi There",
Digest,
sha256).
test(hmac_sha256_2, [true(Digest=0x5bdcc146bf60754e6a042426089575c75a003f089d2739839dec58b964ec3843)]) :-
rdf_hmac(0x4a656665,
"what do ya want for nothing?",
Digest,
sha256).
:- end_tests(rfc2202).
|
