Coverage Report

Created: 2025-04-11 06:45

/src/botan/src/lib/hash/md4/md4.cpp
Line
Count
Source (jump to first uncovered line)
1
/*
2
* MD4
3
* (C) 1999-2007 Jack Lloyd
4
*
5
* Botan is released under the Simplified BSD License (see license.txt)
6
*/
7
8
#include <botan/internal/md4.h>
9
10
#include <botan/internal/bit_ops.h>
11
#include <botan/internal/loadstor.h>
12
#include <botan/internal/rotate.h>
13
14
namespace Botan {
15
16
namespace {
17
18
inline void FF4(uint32_t& A, uint32_t& B, uint32_t& C, uint32_t& D, uint32_t M0, uint32_t M1, uint32_t M2, uint32_t M3)
19
20
0
{
21
0
   A += choose(B, C, D) + M0;
22
0
   A = rotl<3>(A);
23
24
0
   D += choose(A, B, C) + M1;
25
0
   D = rotl<7>(D);
26
27
0
   C += choose(D, A, B) + M2;
28
0
   C = rotl<11>(C);
29
30
0
   B += choose(C, D, A) + M3;
31
0
   B = rotl<19>(B);
32
0
}
33
34
inline void GG4(uint32_t& A, uint32_t& B, uint32_t& C, uint32_t& D, uint32_t M0, uint32_t M1, uint32_t M2, uint32_t M3)
35
36
0
{
37
   /*
38
   These are choose(D, B | C, B & C) but the below expression
39
   takes advantage of the fact that B & C is a subset of B | C
40
   to eliminate an and
41
   */
42
43
0
   A += ((B & C) | (D & (B | C))) + M0 + 0x5A827999;
44
0
   A = rotl<3>(A);
45
46
0
   D += ((A & B) | (C & (A | B))) + M1 + 0x5A827999;
47
0
   D = rotl<5>(D);
48
49
0
   C += ((D & A) | (B & (D | A))) + M2 + 0x5A827999;
50
0
   C = rotl<9>(C);
51
52
0
   B += ((C & D) | (A & (C | D))) + M3 + 0x5A827999;
53
0
   B = rotl<13>(B);
54
0
}
55
56
inline void HH4(uint32_t& A, uint32_t& B, uint32_t& C, uint32_t& D, uint32_t M0, uint32_t M1, uint32_t M2, uint32_t M3)
57
58
0
{
59
0
   A += (B ^ C ^ D) + M0 + 0x6ED9EBA1;
60
0
   A = rotl<3>(A);
61
62
0
   D += (A ^ B ^ C) + M1 + 0x6ED9EBA1;
63
0
   D = rotl<9>(D);
64
65
0
   C += (A ^ B ^ D) + M2 + 0x6ED9EBA1;
66
0
   C = rotl<11>(C);
67
68
0
   B += (A ^ C ^ D) + M3 + 0x6ED9EBA1;
69
0
   B = rotl<15>(B);
70
0
}
71
72
}  // namespace
73
74
/*
75
* MD4 Compression Function
76
*/
77
0
void MD4::compress_n(digest_type& digest, std::span<const uint8_t> input, size_t blocks) {
78
0
   uint32_t A = digest[0], B = digest[1], C = digest[2], D = digest[3];
79
80
0
   BufferSlicer in(input);
81
82
0
   std::array<uint32_t, 16> M;
83
84
0
   for(size_t i = 0; i != blocks; ++i) {
85
0
      load_le(M, in.take<block_bytes>());
86
87
      // clang-format off
88
89
0
      FF4(A, B, C, D, M[ 0], M[ 1], M[ 2], M[ 3]);
90
0
      FF4(A, B, C, D, M[ 4], M[ 5], M[ 6], M[ 7]);
91
0
      FF4(A, B, C, D, M[ 8], M[ 9], M[10], M[11]);
92
0
      FF4(A, B, C, D, M[12], M[13], M[14], M[15]);
93
94
0
      GG4(A, B, C, D, M[ 0], M[ 4], M[ 8], M[12]);
95
0
      GG4(A, B, C, D, M[ 1], M[ 5], M[ 9], M[13]);
96
0
      GG4(A, B, C, D, M[ 2], M[ 6], M[10], M[14]);
97
0
      GG4(A, B, C, D, M[ 3], M[ 7], M[11], M[15]);
98
99
0
      HH4(A, B, C, D, M[ 0], M[ 8], M[ 4], M[12]);
100
0
      HH4(A, B, C, D, M[ 2], M[10], M[ 6], M[14]);
101
0
      HH4(A, B, C, D, M[ 1], M[ 9], M[ 5], M[13]);
102
0
      HH4(A, B, C, D, M[ 3], M[11], M[ 7], M[15]);
103
104
      // clang-format on
105
106
0
      A = (digest[0] += A);
107
0
      B = (digest[1] += B);
108
0
      C = (digest[2] += C);
109
0
      D = (digest[3] += D);
110
0
   }
111
112
0
   BOTAN_ASSERT_NOMSG(in.empty());
113
0
}
114
115
0
void MD4::init(digest_type& digest) {
116
0
   digest.assign({0x67452301, 0xEFCDAB89, 0x98BADCFE, 0x10325476});
117
0
}
118
119
0
std::unique_ptr<HashFunction> MD4::new_object() const {
120
0
   return std::make_unique<MD4>();
121
0
}
122
123
0
std::unique_ptr<HashFunction> MD4::copy_state() const {
124
0
   return std::make_unique<MD4>(*this);
125
0
}
126
127
0
void MD4::add_data(std::span<const uint8_t> input) {
128
0
   m_md.update(input);
129
0
}
130
131
0
void MD4::final_result(std::span<uint8_t> output) {
132
0
   m_md.final(output);
133
0
}
134
135
}  // namespace Botan