aboutsummaryrefslogtreecommitdiffstats
path: root/src/hash/gost_3411
diff options
context:
space:
mode:
Diffstat (limited to 'src/hash/gost_3411')
-rw-r--r--src/hash/gost_3411/gost_3411.cpp242
-rw-r--r--src/hash/gost_3411/gost_3411.h44
-rw-r--r--src/hash/gost_3411/info.txt5
3 files changed, 0 insertions, 291 deletions
diff --git a/src/hash/gost_3411/gost_3411.cpp b/src/hash/gost_3411/gost_3411.cpp
deleted file mode 100644
index eb889c0a5..000000000
--- a/src/hash/gost_3411/gost_3411.cpp
+++ /dev/null
@@ -1,242 +0,0 @@
-/*
-* GOST 34.11
-* (C) 2009 Jack Lloyd
-*
-* Distributed under the terms of the Botan license
-*/
-
-#include <botan/gost_3411.h>
-#include <botan/loadstor.h>
-#include <botan/rotate.h>
-#include <botan/internal/xor_buf.h>
-
-namespace Botan {
-
-/**
-* GOST 34.11 Constructor
-*/
-GOST_34_11::GOST_34_11() :
- cipher(GOST_28147_89_Params("R3411_CryptoPro")),
- buffer(32),
- sum(32),
- hash(32)
- {
- count = 0;
- position = 0;
- }
-
-void GOST_34_11::clear()
- {
- cipher.clear();
- zeroise(sum);
- zeroise(hash);
- count = 0;
- position = 0;
- }
-
-/**
-* Hash additional inputs
-*/
-void GOST_34_11::add_data(const byte input[], size_t length)
- {
- count += length;
-
- if(position)
- {
- buffer_insert(buffer, position, input, length);
-
- if(position + length >= hash_block_size())
- {
- compress_n(&buffer[0], 1);
- input += (hash_block_size() - position);
- length -= (hash_block_size() - position);
- position = 0;
- }
- }
-
- const size_t full_blocks = length / hash_block_size();
- const size_t remaining = length % hash_block_size();
-
- if(full_blocks)
- compress_n(input, full_blocks);
-
- buffer_insert(buffer, position, input + full_blocks * hash_block_size(), remaining);
- position += remaining;
- }
-
-/**
-* The GOST 34.11 compression function
-*/
-void GOST_34_11::compress_n(const byte input[], size_t blocks)
- {
- for(size_t i = 0; i != blocks; ++i)
- {
- for(u16bit j = 0, carry = 0; j != 32; ++j)
- {
- u16bit s = sum[j] + input[32*i+j] + carry;
- carry = get_byte(0, s);
- sum[j] = get_byte(1, s);
- }
-
- byte S[32] = { 0 };
-
- u64bit U[4], V[4];
- load_be(U, &hash[0], 4);
- load_be(V, input + 32*i, 4);
-
- for(size_t j = 0; j != 4; ++j)
- {
- byte key[32] = { 0 };
-
- // P transformation
- for(size_t k = 0; k != 4; ++k)
- for(size_t l = 0; l != 8; ++l)
- key[4*l+k] = get_byte(l, U[k]) ^ get_byte(l, V[k]);
-
- cipher.set_key(key, 32);
- cipher.encrypt(&hash[8*j], S + 8*j);
-
- if(j == 3)
- break;
-
- // A(x)
- u64bit A_U = U[0];
- U[0] = U[1];
- U[1] = U[2];
- U[2] = U[3];
- U[3] = U[0] ^ A_U;
-
- if(j == 1) // C_3
- {
- U[0] ^= 0x00FF00FF00FF00FF;
- U[1] ^= 0xFF00FF00FF00FF00;
- U[2] ^= 0x00FFFF00FF0000FF;
- U[3] ^= 0xFF000000FFFF00FF;
- }
-
- // A(A(x))
- u64bit AA_V_1 = V[0] ^ V[1];
- u64bit AA_V_2 = V[1] ^ V[2];
- V[0] = V[2];
- V[1] = V[3];
- V[2] = AA_V_1;
- V[3] = AA_V_2;
- }
-
- byte S2[32] = { 0 };
-
- // 12 rounds of psi
- S2[ 0] = S[24];
- S2[ 1] = S[25];
- S2[ 2] = S[26];
- S2[ 3] = S[27];
- S2[ 4] = S[28];
- S2[ 5] = S[29];
- S2[ 6] = S[30];
- S2[ 7] = S[31];
- S2[ 8] = S[ 0] ^ S[ 2] ^ S[ 4] ^ S[ 6] ^ S[24] ^ S[30];
- S2[ 9] = S[ 1] ^ S[ 3] ^ S[ 5] ^ S[ 7] ^ S[25] ^ S[31];
- S2[10] = S[ 0] ^ S[ 8] ^ S[24] ^ S[26] ^ S[30];
- S2[11] = S[ 1] ^ S[ 9] ^ S[25] ^ S[27] ^ S[31];
- S2[12] = S[ 0] ^ S[ 4] ^ S[ 6] ^ S[10] ^ S[24] ^ S[26] ^ S[28] ^ S[30];
- S2[13] = S[ 1] ^ S[ 5] ^ S[ 7] ^ S[11] ^ S[25] ^ S[27] ^ S[29] ^ S[31];
- S2[14] = S[ 0] ^ S[ 4] ^ S[ 8] ^ S[12] ^ S[24] ^ S[26] ^ S[28];
- S2[15] = S[ 1] ^ S[ 5] ^ S[ 9] ^ S[13] ^ S[25] ^ S[27] ^ S[29];
- S2[16] = S[ 2] ^ S[ 6] ^ S[10] ^ S[14] ^ S[26] ^ S[28] ^ S[30];
- S2[17] = S[ 3] ^ S[ 7] ^ S[11] ^ S[15] ^ S[27] ^ S[29] ^ S[31];
- S2[18] = S[ 0] ^ S[ 2] ^ S[ 6] ^ S[ 8] ^ S[12] ^ S[16] ^ S[24] ^ S[28];
- S2[19] = S[ 1] ^ S[ 3] ^ S[ 7] ^ S[ 9] ^ S[13] ^ S[17] ^ S[25] ^ S[29];
- S2[20] = S[ 2] ^ S[ 4] ^ S[ 8] ^ S[10] ^ S[14] ^ S[18] ^ S[26] ^ S[30];
- S2[21] = S[ 3] ^ S[ 5] ^ S[ 9] ^ S[11] ^ S[15] ^ S[19] ^ S[27] ^ S[31];
- S2[22] = S[ 0] ^ S[ 2] ^ S[10] ^ S[12] ^ S[16] ^ S[20] ^ S[24] ^ S[28] ^ S[30];
- S2[23] = S[ 1] ^ S[ 3] ^ S[11] ^ S[13] ^ S[17] ^ S[21] ^ S[25] ^ S[29] ^ S[31];
- S2[24] = S[ 0] ^ S[ 6] ^ S[12] ^ S[14] ^ S[18] ^ S[22] ^ S[24] ^ S[26];
- S2[25] = S[ 1] ^ S[ 7] ^ S[13] ^ S[15] ^ S[19] ^ S[23] ^ S[25] ^ S[27];
- S2[26] = S[ 2] ^ S[ 8] ^ S[14] ^ S[16] ^ S[20] ^ S[24] ^ S[26] ^ S[28];
- S2[27] = S[ 3] ^ S[ 9] ^ S[15] ^ S[17] ^ S[21] ^ S[25] ^ S[27] ^ S[29];
- S2[28] = S[ 4] ^ S[10] ^ S[16] ^ S[18] ^ S[22] ^ S[26] ^ S[28] ^ S[30];
- S2[29] = S[ 5] ^ S[11] ^ S[17] ^ S[19] ^ S[23] ^ S[27] ^ S[29] ^ S[31];
- S2[30] = S[ 0] ^ S[ 2] ^ S[ 4] ^ S[12] ^ S[18] ^ S[20] ^ S[28];
- S2[31] = S[ 1] ^ S[ 3] ^ S[ 5] ^ S[13] ^ S[19] ^ S[21] ^ S[29];
-
- xor_buf(S, S2, input + 32*i, 32);
-
- S2[0] = S[0] ^ S[2] ^ S[4] ^ S[6] ^ S[24] ^ S[30];
- S2[1] = S[1] ^ S[3] ^ S[5] ^ S[7] ^ S[25] ^ S[31];
-
- copy_mem(S, S+2, 30);
- S[30] = S2[0];
- S[31] = S2[1];
-
- xor_buf(S, &hash[0], 32);
-
- // 61 rounds of psi
- S2[ 0] = S[ 2] ^ S[ 6] ^ S[14] ^ S[20] ^ S[22] ^ S[26] ^ S[28] ^ S[30];
- S2[ 1] = S[ 3] ^ S[ 7] ^ S[15] ^ S[21] ^ S[23] ^ S[27] ^ S[29] ^ S[31];
- S2[ 2] = S[ 0] ^ S[ 2] ^ S[ 6] ^ S[ 8] ^ S[16] ^ S[22] ^ S[28];
- S2[ 3] = S[ 1] ^ S[ 3] ^ S[ 7] ^ S[ 9] ^ S[17] ^ S[23] ^ S[29];
- S2[ 4] = S[ 2] ^ S[ 4] ^ S[ 8] ^ S[10] ^ S[18] ^ S[24] ^ S[30];
- S2[ 5] = S[ 3] ^ S[ 5] ^ S[ 9] ^ S[11] ^ S[19] ^ S[25] ^ S[31];
- S2[ 6] = S[ 0] ^ S[ 2] ^ S[10] ^ S[12] ^ S[20] ^ S[24] ^ S[26] ^ S[30];
- S2[ 7] = S[ 1] ^ S[ 3] ^ S[11] ^ S[13] ^ S[21] ^ S[25] ^ S[27] ^ S[31];
- S2[ 8] = S[ 0] ^ S[ 6] ^ S[12] ^ S[14] ^ S[22] ^ S[24] ^ S[26] ^ S[28] ^ S[30];
- S2[ 9] = S[ 1] ^ S[ 7] ^ S[13] ^ S[15] ^ S[23] ^ S[25] ^ S[27] ^ S[29] ^ S[31];
- S2[10] = S[ 0] ^ S[ 4] ^ S[ 6] ^ S[ 8] ^ S[14] ^ S[16] ^ S[26] ^ S[28];
- S2[11] = S[ 1] ^ S[ 5] ^ S[ 7] ^ S[ 9] ^ S[15] ^ S[17] ^ S[27] ^ S[29];
- S2[12] = S[ 2] ^ S[ 6] ^ S[ 8] ^ S[10] ^ S[16] ^ S[18] ^ S[28] ^ S[30];
- S2[13] = S[ 3] ^ S[ 7] ^ S[ 9] ^ S[11] ^ S[17] ^ S[19] ^ S[29] ^ S[31];
- S2[14] = S[ 0] ^ S[ 2] ^ S[ 6] ^ S[ 8] ^ S[10] ^ S[12] ^ S[18] ^ S[20] ^ S[24];
- S2[15] = S[ 1] ^ S[ 3] ^ S[ 7] ^ S[ 9] ^ S[11] ^ S[13] ^ S[19] ^ S[21] ^ S[25];
- S2[16] = S[ 2] ^ S[ 4] ^ S[ 8] ^ S[10] ^ S[12] ^ S[14] ^ S[20] ^ S[22] ^ S[26];
- S2[17] = S[ 3] ^ S[ 5] ^ S[ 9] ^ S[11] ^ S[13] ^ S[15] ^ S[21] ^ S[23] ^ S[27];
- S2[18] = S[ 4] ^ S[ 6] ^ S[10] ^ S[12] ^ S[14] ^ S[16] ^ S[22] ^ S[24] ^ S[28];
- S2[19] = S[ 5] ^ S[ 7] ^ S[11] ^ S[13] ^ S[15] ^ S[17] ^ S[23] ^ S[25] ^ S[29];
- S2[20] = S[ 6] ^ S[ 8] ^ S[12] ^ S[14] ^ S[16] ^ S[18] ^ S[24] ^ S[26] ^ S[30];
- S2[21] = S[ 7] ^ S[ 9] ^ S[13] ^ S[15] ^ S[17] ^ S[19] ^ S[25] ^ S[27] ^ S[31];
- S2[22] = S[ 0] ^ S[ 2] ^ S[ 4] ^ S[ 6] ^ S[ 8] ^ S[10] ^ S[14] ^ S[16] ^
- S[18] ^ S[20] ^ S[24] ^ S[26] ^ S[28] ^ S[30];
- S2[23] = S[ 1] ^ S[ 3] ^ S[ 5] ^ S[ 7] ^ S[ 9] ^ S[11] ^ S[15] ^ S[17] ^
- S[19] ^ S[21] ^ S[25] ^ S[27] ^ S[29] ^ S[31];
- S2[24] = S[ 0] ^ S[ 8] ^ S[10] ^ S[12] ^ S[16] ^ S[18] ^ S[20] ^ S[22] ^
- S[24] ^ S[26] ^ S[28];
- S2[25] = S[ 1] ^ S[ 9] ^ S[11] ^ S[13] ^ S[17] ^ S[19] ^ S[21] ^ S[23] ^
- S[25] ^ S[27] ^ S[29];
- S2[26] = S[ 2] ^ S[10] ^ S[12] ^ S[14] ^ S[18] ^ S[20] ^ S[22] ^ S[24] ^
- S[26] ^ S[28] ^ S[30];
- S2[27] = S[ 3] ^ S[11] ^ S[13] ^ S[15] ^ S[19] ^ S[21] ^ S[23] ^ S[25] ^
- S[27] ^ S[29] ^ S[31];
- S2[28] = S[ 0] ^ S[ 2] ^ S[ 6] ^ S[12] ^ S[14] ^ S[16] ^ S[20] ^ S[22] ^ S[26] ^ S[28];
- S2[29] = S[ 1] ^ S[ 3] ^ S[ 7] ^ S[13] ^ S[15] ^ S[17] ^ S[21] ^ S[23] ^ S[27] ^ S[29];
- S2[30] = S[ 2] ^ S[ 4] ^ S[ 8] ^ S[14] ^ S[16] ^ S[18] ^ S[22] ^ S[24] ^ S[28] ^ S[30];
- S2[31] = S[ 3] ^ S[ 5] ^ S[ 9] ^ S[15] ^ S[17] ^ S[19] ^ S[23] ^ S[25] ^ S[29] ^ S[31];
-
- copy_mem(&hash[0], &S2[0], 32);
- }
- }
-
-/**
-* Produce the final GOST 34.11 output
-*/
-void GOST_34_11::final_result(byte out[])
- {
- if(position)
- {
- clear_mem(&buffer[0] + position, buffer.size() - position);
- compress_n(&buffer[0], 1);
- }
-
- secure_vector<byte> length_buf(32);
- const u64bit bit_count = count * 8;
- store_le(bit_count, &length_buf[0]);
-
- secure_vector<byte> sum_buf = sum;
-
- compress_n(&length_buf[0], 1);
- compress_n(&sum_buf[0], 1);
-
- copy_mem(out, &hash[0], 32);
-
- clear();
- }
-
-}
diff --git a/src/hash/gost_3411/gost_3411.h b/src/hash/gost_3411/gost_3411.h
deleted file mode 100644
index 5437ca4d8..000000000
--- a/src/hash/gost_3411/gost_3411.h
+++ /dev/null
@@ -1,44 +0,0 @@
-/*
-* GOST 34.11
-* (C) 2009 Jack Lloyd
-*
-* Distributed under the terms of the Botan license
-*/
-
-#ifndef BOTAN_GOST_3411_H__
-#define BOTAN_GOST_3411_H__
-
-#include <botan/hash.h>
-#include <botan/gost_28147.h>
-
-namespace Botan {
-
-/**
-* GOST 34.11
-*/
-class BOTAN_DLL GOST_34_11 : public HashFunction
- {
- public:
- std::string name() const { return "GOST-R-34.11-94" ; }
- size_t output_length() const { return 32; }
- size_t hash_block_size() const { return 32; }
- HashFunction* clone() const { return new GOST_34_11; }
-
- void clear();
-
- GOST_34_11();
- private:
- void compress_n(const byte input[], size_t blocks);
-
- void add_data(const byte[], size_t);
- void final_result(byte[]);
-
- GOST_28147_89 cipher;
- secure_vector<byte> buffer, sum, hash;
- size_t position;
- u64bit count;
- };
-
-}
-
-#endif
diff --git a/src/hash/gost_3411/info.txt b/src/hash/gost_3411/info.txt
deleted file mode 100644
index af8eddac6..000000000
--- a/src/hash/gost_3411/info.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-define GOST_34_11 20131128
-
-<requires>
-gost_28147
-</requires>
generated by cgit v1.2.3 (git 2.39.1) at 2024-12-17 02:47:46 +0000