/usr/include/viennacl/tools/sha1.hpp is in libviennacl-dev 1.7.1+dfsg1-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 235 236 237 | /*
*
* TinySHA1 - a header only implementation of the SHA1 algorithm in C++. Based
* on the implementation in boost::uuid::details.
*
* SHA1 Wikipedia Page: http://en.wikipedia.org/wiki/SHA-1
*
* Copyright (c) 2012-22 SAURAV MOHAPATRA <mohaps@gmail.com>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#ifndef VIENNACL_TOOLS_SHA1_HPP_
#define VIENNACL_TOOLS_SHA1_HPP_
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <sstream>
#include "viennacl/forwards.h"
namespace viennacl
{
namespace tools
{
typedef signed char int8_t;
typedef unsigned char uint8_t;
typedef short int16_t;
typedef unsigned short uint16_t;
#if defined(_MSC_VER)
typedef __int32 int32_t;
typedef unsigned __int32 uint32_t;
#else
typedef int int32_t;
typedef unsigned int uint32_t;
#endif
namespace detail
{
class sha1
{
public:
typedef uint32_t digest32_t[5];
typedef uint8_t digest8_t[20];
inline static uint32_t LeftRotate(uint32_t value, vcl_size_t count) {
return (value << count) ^ (value >> (32-count));
}
sha1(){ reset(); }
virtual ~sha1() {}
sha1(const sha1& s) { *this = s; }
const sha1& operator = (const sha1& s) {
memcpy(m_digest, s.m_digest, 5 * sizeof(uint32_t));
memcpy(m_block, s.m_block, 64);
m_blockByteIndex = s.m_blockByteIndex;
m_byteCount = s.m_byteCount;
return *this;
}
sha1& reset() {
m_digest[0] = 0x67452301;
m_digest[1] = 0xEFCDAB89;
m_digest[2] = 0x98BADCFE;
m_digest[3] = 0x10325476;
m_digest[4] = 0xC3D2E1F0;
m_blockByteIndex = 0;
m_byteCount = 0;
return *this;
}
sha1& processByte(uint8_t octet) {
this->m_block[this->m_blockByteIndex++] = octet;
++this->m_byteCount;
if (m_blockByteIndex == 64) {
this->m_blockByteIndex = 0;
processBlock();
}
return *this;
}
sha1& processBlock(const void* const start, const void* const end) {
const uint8_t* begin = static_cast<const uint8_t*>(start);
const uint8_t* finish = static_cast<const uint8_t*>(end);
while (begin != finish) {
processByte(*begin);
begin++;
}
return *this;
}
sha1& processBytes(const void* const data, vcl_size_t len) {
const uint8_t* block = static_cast<const uint8_t*>(data);
processBlock(block, block + len);
return *this;
}
const uint32_t* getDigest(digest32_t digest) {
vcl_size_t bitCount = this->m_byteCount * 8;
processByte(0x80);
if (this->m_blockByteIndex > 56) {
while (m_blockByteIndex != 0) {
processByte(0);
}
while (m_blockByteIndex < 56) {
processByte(0);
}
} else {
while (m_blockByteIndex < 56) {
processByte(0);
}
}
processByte(0);
processByte(0);
processByte(0);
processByte(0);
processByte( static_cast<unsigned char>((bitCount>>24) & 0xFF));
processByte( static_cast<unsigned char>((bitCount>>16) & 0xFF));
processByte( static_cast<unsigned char>((bitCount>>8 ) & 0xFF));
processByte( static_cast<unsigned char>((bitCount) & 0xFF));
memcpy(digest, m_digest, 5 * sizeof(uint32_t));
return digest;
}
const uint8_t* getDigestBytes(digest8_t digest) {
digest32_t d32;
getDigest(d32);
vcl_size_t di = 0;
digest[di++] = static_cast<uint8_t>((d32[0] >> 24) & 0xFF);
digest[di++] = static_cast<uint8_t>((d32[0] >> 16) & 0xFF);
digest[di++] = static_cast<uint8_t>((d32[0] >> 8) & 0xFF);
digest[di++] = static_cast<uint8_t>((d32[0]) & 0xFF);
digest[di++] = static_cast<uint8_t>((d32[1] >> 24) & 0xFF);
digest[di++] = static_cast<uint8_t>((d32[1] >> 16) & 0xFF);
digest[di++] = static_cast<uint8_t>((d32[1] >> 8) & 0xFF);
digest[di++] = static_cast<uint8_t>((d32[1]) & 0xFF);
digest[di++] = static_cast<uint8_t>((d32[2] >> 24) & 0xFF);
digest[di++] = static_cast<uint8_t>((d32[2] >> 16) & 0xFF);
digest[di++] = static_cast<uint8_t>((d32[2] >> 8) & 0xFF);
digest[di++] = static_cast<uint8_t>((d32[2]) & 0xFF);
digest[di++] = static_cast<uint8_t>((d32[3] >> 24) & 0xFF);
digest[di++] = static_cast<uint8_t>((d32[3] >> 16) & 0xFF);
digest[di++] = static_cast<uint8_t>((d32[3] >> 8) & 0xFF);
digest[di++] = static_cast<uint8_t>((d32[3]) & 0xFF);
digest[di++] = static_cast<uint8_t>((d32[4] >> 24) & 0xFF);
digest[di++] = static_cast<uint8_t>((d32[4] >> 16) & 0xFF);
digest[di++] = static_cast<uint8_t>((d32[4] >> 8) & 0xFF);
digest[di++] = static_cast<uint8_t>((d32[4]) & 0xFF);
return digest;
}
protected:
void processBlock() {
uint32_t w[80];
for (vcl_size_t i = 0; i < 16; i++) {
w[i] = static_cast<uint32_t>(m_block[i*4 + 0] << 24);
w[i] |= static_cast<uint32_t>(m_block[i*4 + 1] << 16);
w[i] |= static_cast<uint32_t>(m_block[i*4 + 2] << 8);
w[i] |= static_cast<uint32_t>(m_block[i*4 + 3]);
}
for (vcl_size_t i = 16; i < 80; i++) {
w[i] = LeftRotate((w[i-3] ^ w[i-8] ^ w[i-14] ^ w[i-16]), 1);
}
uint32_t a = m_digest[0];
uint32_t b = m_digest[1];
uint32_t c = m_digest[2];
uint32_t d = m_digest[3];
uint32_t e = m_digest[4];
for (vcl_size_t i=0; i<80; ++i) {
uint32_t f = 0;
uint32_t k = 0;
if (i<20) {
f = (b & c) | (~b & d);
k = 0x5A827999;
} else if (i<40) {
f = b ^ c ^ d;
k = 0x6ED9EBA1;
} else if (i<60) {
f = (b & c) | (b & d) | (c & d);
k = 0x8F1BBCDC;
} else {
f = b ^ c ^ d;
k = 0xCA62C1D6;
}
uint32_t temp = LeftRotate(a, 5) + f + e + k + w[i];
e = d;
d = c;
c = LeftRotate(b, 30);
b = a;
a = temp;
}
m_digest[0] += a;
m_digest[1] += b;
m_digest[2] += c;
m_digest[3] += d;
m_digest[4] += e;
}
private:
digest32_t m_digest;
uint8_t m_block[64];
vcl_size_t m_blockByteIndex;
vcl_size_t m_byteCount;
};
}
inline std::string sha1(std::string const & src)
{
detail::sha1 sha1;
sha1.processBytes(src.c_str(),src.size());
uint32_t hash[5];
sha1.getDigest(hash);
std::ostringstream oss;
for (int i = 0; i < 5; ++i)
oss << std::hex << std::setfill('0') << std::setw(8) << hash[i];
return oss.str();
}
}
}
#endif
|