1 # Test against long bitwise vectors from Jim Gillogly and Francois Grieu
3 # http://www.chiark.greenend.org.uk/pipermail/ukcrypto/1999-February/003538.html
11 $MODULE = ($ENV{PERL_CORE} || -e "SHA.pm") ? "Digest::SHA" : "Digest::SHA::PurePerl";
12 eval "require $MODULE" || die $@;
13 $MODULE->import(qw());
17 if ($ENV{PERL_CORE}) {
25 # In the following we use the notation bitstring#n to mean a bitstring
26 # repeated n (in decimal) times, and we use | for concatenation.
27 # Therefore 110#3|1 is 1101101101.
29 # Here is a set near 2^32 bits to test the roll-over in the length
30 # field from one to two 32-bit words:
32 # 110#1431655764|11 1eef5a18 969255a3 b1793a2a 955c7ec2 8cd221a5
33 # 110#1431655765| 7a1045b9 14672afa ce8d90e6 d19b3a6a da3cb879
34 # 110#1431655765|1 d5e09777 a94f1ea9 240874c4 8d9fecb6 b634256b
35 # 110#1431655765|11 eb256904 3c3014e5 1b2862ae 6eb5fb4e 0b851d99
37 # 011#1431655764|01 4CB0C4EF 69143D5B F34FC35F 1D4B19F6 ECCAE0F2
38 # 011#1431655765 47D92F91 1FC7BB74 DE00ADFC 4E981A81 05556D52
39 # 011#1431655765|0 A3D7438C 589B0B93 2AA91CC2 446F06DF 9ABC73F0
40 # 011#1431655765|01 3EEE3E1E 28DEDE2C A444D68D A5675B2F AAAB3203
42 my @vec110 = ( # 110 rep 1431655764
43 "11", "1eef5a18969255a3b1793a2a955c7ec28cd221a5",
44 "110", "7a1045b914672aface8d90e6d19b3a6ada3cb879",
45 "1101", "d5e09777a94f1ea9240874c48d9fecb6b634256b",
46 "11011", "eb2569043c3014e51b2862ae6eb5fb4e0b851d99"
49 my @vec011 = ( # 011 rep 1431655764
50 "01", "4cb0c4ef69143d5bf34fc35f1d4b19f6eccae0f2",
51 "011", "47d92f911fc7bb74de00adfc4e981a8105556d52",
52 "0110", "a3d7438c589b0b932aa91cc2446f06df9abc73f0",
53 "01101", "3eee3e1e28dede2ca444d68da5675b2faaab3203"
55 print "1..", scalar(@vec110) / 2 + scalar(@vec011) / 2, "\n";
57 my $STATE110 = "gglong0.tmp";
58 my $STATE011 = "gglong1.tmp";
60 END { 1 while unlink $STATE110, $STATE011 }
62 for ($STATE011, $STATE110) {
63 my $fh = FileHandle->new($_, "w");
64 for (1 .. 8) { my $line = <DATA>; print $fh $line }
69 my $loops = int(1431655764 / $reps);
70 my $rest = 3 * (1431655764 - $loops * $reps);
77 $state = $MODULE->new(1);
79 if ($state->load($STATE110)) {
83 $bitstr = pack("B*", "110" x $reps);
85 for ($i = 0; $i < $loops; $i++) {
86 $state->add_bits($bitstr, 3 * $reps);
88 $state->add_bits($bitstr, $rest);
89 $state->dump($STATE110);
98 $state = $MODULE->new(1);
100 if ($state->load($STATE011)) {
104 $bitstr = pack("B*", "011" x $reps);
106 for ($i = 0; $i < $loops; $i++) {
107 $state->add_bits($bitstr, 3 * $reps);
109 $state->add_bits($bitstr, $rest);
110 $state->dump($STATE011);
118 my $state110 = state110();
119 for ($i = 0; $i < @vec110/2; $i++) {
120 my $state = $state110->clone;
121 $state->add_bits($vec110[2*$i]);
122 print "not " unless $state->hexdigest eq $vec110[2*$i+1];
123 print "ok ", $testnum++, "\n";
126 my $state011 = state011();
127 for ($i = 0; $i < @vec011/2; $i++) {
128 my $state = $state011->clone;
129 $state->add_bits($vec011[2*$i]);
130 print "not " unless $state->hexdigest eq $vec011[2*$i+1];
131 print "ok ", $testnum++, "\n";
136 H:7950cbe2:86a45aa0:91ff7dff:29015b42:3912e764:00000000:00000000:00000000
137 block:b6:db:6d:b6:db:6d:b6:db:6d:b6:db:6d:b6:db:6d:b6:db:6d:b6:db:6d:b6:db:6d:b6:db:6d:b6:db:6d:b6:db:6d:b6:db:6d:b6:db:6d:b6:db:6d:b6:db:6d:b6:db:6d:b6:db:6d:b6:db:6d:b6:db:6d:b6:db:6d:b6:db:6d:b6
144 H:dfc51a14:87b4a4b7:ecf19acd:8cbbe40e:03a435f8:00000000:00000000:00000000
145 block:6d:b6:db:6d:b6:db:6d:b6:db:6d:b6:db:6d:b6:db:6d:b6:db:6d:b6:db:6d:b6:db:6d:b6:db:6d:b6:db:6d:b6:db:6d:b6:db:6d:b6:db:6d:b6:db:6d:b6:db:6d:b6:db:6d:b6:db:6d:b6:db:6d:b6:db:6d:b6:db:6d:b6:db:6d