1 ------------------------------------------------------------------------------
3 -- GNAT LIBRARY COMPONENTS --
5 -- G N A T . S E C U R E _ H A S H E S . S H A 1 --
9 -- Copyright (C) 2002-2018, Free Software Foundation, Inc. --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 3, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. --
18 -- As a special exception under Section 7 of GPL version 3, you are granted --
19 -- additional permissions described in the GCC Runtime Library Exception, --
20 -- version 3.1, as published by the Free Software Foundation. --
22 -- You should have received a copy of the GNU General Public License and --
23 -- a copy of the GCC Runtime Library Exception along with this program; --
24 -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
25 -- <http://www.gnu.org/licenses/>. --
27 -- GNAT was originally developed by the GNAT team at New York University. --
28 -- Extensive contributions were provided by Ada Core Technologies Inc. --
30 ------------------------------------------------------------------------------
32 package body GNAT
.Secure_Hashes
.SHA1
is
35 use GNAT
.Byte_Swapping
;
37 -- The following functions are the four elementary components of each
38 -- of the four round groups (0 .. 19, 20 .. 39, 40 .. 59, and 60 .. 79)
39 -- defined in RFC 3174.
41 function F0
(B
, C
, D
: Unsigned_32
) return Unsigned_32
;
44 function F1
(B
, C
, D
: Unsigned_32
) return Unsigned_32
;
47 function F2
(B
, C
, D
: Unsigned_32
) return Unsigned_32
;
50 function F3
(B
, C
, D
: Unsigned_32
) return Unsigned_32
;
58 (B
, C
, D
: Interfaces
.Unsigned_32
) return Interfaces
.Unsigned_32
61 return (B
and C
) or ((not B
) and D
);
69 (B
, C
, D
: Interfaces
.Unsigned_32
) return Interfaces
.Unsigned_32
80 (B
, C
, D
: Interfaces
.Unsigned_32
) return Interfaces
.Unsigned_32
83 return (B
and C
) or (B
and D
) or (C
and D
);
91 (B
, C
, D
: Interfaces
.Unsigned_32
) return Interfaces
.Unsigned_32
99 (H
: in out Hash_State
.State
;
100 M
: in out Message_State
)
104 type Words
is array (Natural range <>) of Interfaces
.Unsigned_32
;
107 for X
'Address use M
.Buffer
'Address;
108 pragma Import
(Ada
, X
);
112 A
, B
, C
, D
, E
, Temp
: Interfaces
.Unsigned_32
;
115 if Default_Bit_Order
/= High_Order_First
then
116 for J
in X
'Range loop
117 Swap4
(X
(J
)'Address);
121 -- a. Divide data block into sixteen words
125 -- b. Prepare working block of 80 words
127 for T
in 16 .. 79 loop
129 -- W(t) = S^1(W(t-3) XOR W(t-8) XOR W(t-14) XOR W(t-16))
132 (W
(T
- 3) xor W
(T
- 8) xor W
(T
- 14) xor W
(T
- 16), 1);
136 -- c. Set up transformation variables
144 -- d. For each of the 80 rounds, compute:
146 -- TEMP = S^5(A) + f(t;B,C,D) + E + W(t) + K(t);
147 -- E = D; D = C; C = S^30(B); B = A; A = TEMP;
149 for T
in 0 .. 19 loop
150 Temp
:= Rotate_Left
(A
, 5) + F0
(B
, C
, D
) + E
+ W
(T
) + 16#
5A827999#
;
151 E
:= D
; D
:= C
; C
:= Rotate_Left
(B
, 30); B
:= A
; A
:= Temp
;
154 for T
in 20 .. 39 loop
155 Temp
:= Rotate_Left
(A
, 5) + F1
(B
, C
, D
) + E
+ W
(T
) + 16#
6ED9EBA1#
;
156 E
:= D
; D
:= C
; C
:= Rotate_Left
(B
, 30); B
:= A
; A
:= Temp
;
159 for T
in 40 .. 59 loop
160 Temp
:= Rotate_Left
(A
, 5) + F2
(B
, C
, D
) + E
+ W
(T
) + 16#
8F1BBCDC#
;
161 E
:= D
; D
:= C
; C
:= Rotate_Left
(B
, 30); B
:= A
; A
:= Temp
;
164 for T
in 60 .. 79 loop
165 Temp
:= Rotate_Left
(A
, 5) + F3
(B
, C
, D
) + E
+ W
(T
) + 16#CA62C1D6#
;
166 E
:= D
; D
:= C
; C
:= Rotate_Left
(B
, 30); B
:= A
; A
:= Temp
;
169 -- e. Update context:
170 -- H0 = H0 + A, H1 = H1 + B, H2 = H2 + C, H3 = H3 + D, H4 = H4 + E
179 end GNAT
.Secure_Hashes
.SHA1
;