This repository has been archived by the owner on Mar 1, 2023. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
/
SHA1.cpp
152 lines (126 loc) · 3.25 KB
/
SHA1.cpp
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
#include <ios>
#include <iomanip>
#include <sstream>
#include <fstream>
#include "SHA1.h"
SHA1::SHA1(const std::string &line, bool _file)
{
if (_file)
{
readFile(data, line);
file = true;
filePath += line;
} else
{
for (byte ch : line)
{
data.push_back(ch); // Transform string to vector
}
}
ulong srcBitLen = data.size() * 8;
// Extend the message
data.push_back((byte) 0x80); // Add 1 bit
while ((data.size() * 8) % 512 != 448)
{
data.push_back(0); // Add zeroes until length of message is not 448 mod 512
}
// Add the message length
ulong len = data.size();
data.resize(len + 8);
for (ulong i = data.size() - 1; i >= len; i--)
{
data[i] = (byte) srcBitLen;
srcBitLen >>= 8;
}
this->init();
}
void SHA1::init()
{
h[0] = 0x67452301;
h[1] = 0xEFCDAB89;
h[2] = 0x98BADCFE;
h[3] = 0x10325476;
h[4] = 0xC3D2E1F0;
k[0] = 0x5A827999;
k[1] = 0x6ED9EBA1;
k[2] = 0x8F1BBCDC;
k[3] = 0xCA62C1D6;
}
std::string SHA1::generate()
{
for (uint i = 0; i < data.size(); i += 64) // Go through 64 bit blocks
{
uint temp;
std::vector<byte> block(64);
std::move(data.begin() + i, data.begin() + i + 64, block.begin());
std::vector<uint> word(80);
for (uint j = 0; j < 16; ++j) // Convert to big-endian and store first 16
{
word[j] =
((uint) block[j * 4 + 0] << 24) |
((uint) block[j * 4 + 1] << 16) |
((uint) block[j * 4 + 2] << 8) |
((uint) block[j * 4 + 3] << 0);
}
for (uint j = 16; j < 80; ++j) // 64 elements calculated using circular shift
{
word[j] = CIRC_LEFT_SHIFT((word[j - 3] ^ word[j - 8] ^ word[j - 14] ^ word[j - 16]), 1);
}
uint a = h[0], b = h[1], c = h[2], d = h[3], e = h[4];
for (uint j = 0; j < 80; ++j)
{
temp = CIRC_LEFT_SHIFT(a, 5) + F(j, b, c, d) + e + word[j] + k[j / 20];
e = d;
d = c;
c = CIRC_LEFT_SHIFT(b, 30);
b = a;
a = temp;
}
h[0] += a;
h[1] += b;
h[2] += c;
h[3] += d;
h[4] += e;
}
std::ostringstream result;
for (auto &hash : h)
{
result << std::hex << std::setfill('0') << std::setw(8) << hash << " ";
}
if (file)
{
writeFile(result.str(), filePath + "_hash");
}
return result.str();
}
uint SHA1::F(uint j, uint x, uint y, uint z)
{
if (j < 20)
return (x & y) | ((~x) & z);
else if (j < 40)
return x ^ y ^ z;
else if (j < 60)
return (x & y) | (x & z) | (y & z);
else if (j < 80)
return x ^ y ^ z;
else
return 0;
}
void SHA1::readFile(std::vector<byte> &msg, const std::string &path)
{
FILE *f = fopen(path.c_str(), "rb");
int c;
while ((c = getc(f)) != EOF)
{
msg.push_back((byte) c);
}
}
void SHA1::writeFile(const std::string &msg, const std::string &path)
{
std::ofstream out(path);
for (auto b : msg)
{
out << b;
}
out.close();
}