summaryrefslogtreecommitdiffstats
path: root/test/unit/nts_ntp_auth.c
blob: c3a743228cb531adeaf94c2cf289b2fe660ea9e8 (plain)
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
/*
 **********************************************************************
 * Copyright (C) Miroslav Lichvar  2020
 * 
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of version 2 of the GNU General Public License as
 * published by the Free Software Foundation.
 * 
 * This program is distributed in the hope that it will be useful, but
 * WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * General Public License for more details.
 * 
 * You should have received a copy of the GNU General Public License along
 * with this program; if not, write to the Free Software Foundation, Inc.,
 * 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA.
 * 
 **********************************************************************
 */

#include <config.h>
#include "test.h"

#ifdef FEAT_NTS

#include <nts_ntp_auth.c>

#include "ntp_ext.h"
#include "siv.h"

void
test_unit(void)
{
  unsigned char key[SIV_MAX_KEY_LENGTH], nonce[256], plaintext[256], plaintext2[256];
  NTP_PacketInfo info;
  NTP_Packet packet;
  SIV_Algorithm algo;
  SIV_Instance siv;
  int i, j, r, packet_length, nonce_length, key_length;
  int plaintext_length, plaintext2_length, min_ef_length;

  for (algo = 1; algo < 100; algo++) {
    siv = SIV_CreateInstance(algo);
    if (!siv) {
      TEST_CHECK(algo != AEAD_AES_SIV_CMAC_256);
      continue;
    }

    DEBUG_LOG("algo=%d", (int)algo);

    for (i = 0; i < 10000; i++) {
      key_length = SIV_GetKeyLength(algo);
      for (j = 0; j < key_length; j++)
        key[j] = random() % 256;
      TEST_CHECK(SIV_SetKey(siv, key, key_length));

      assert(sizeof (nonce) >= SIV_GetMinNonceLength(siv));
      nonce_length = SIV_GetMinNonceLength(siv) +
                     random() % (MIN(sizeof (nonce), SIV_GetMaxNonceLength(siv)) -
                                 SIV_GetMinNonceLength(siv) + 1);
      for (j = 0; j < nonce_length; j++)
        nonce[j] = random() % 256;

      plaintext_length = random() % (sizeof (plaintext) + 1);
      for (j = 0; j < plaintext_length; j++)
        plaintext[j] = random() % 256;

      packet_length = NTP_HEADER_LENGTH + random() % 100 * 4;
      min_ef_length = random() % (sizeof (packet) - packet_length);

      memset(&packet, 0, sizeof (packet));
      packet.lvm = NTP_LVM(0, 4, 0);
      memset(&info, 0, sizeof (info));
      info.version = 4;
      info.length = packet_length;

      DEBUG_LOG("packet_length=%d nonce_length=%d plaintext_length=%d min_ef_length=%d",
                packet_length, nonce_length, plaintext_length, min_ef_length);

      r = NNA_GenerateAuthEF(&packet, &info, siv, nonce, nonce_length, plaintext,
                             -1, 0);
      TEST_CHECK(!r);
      r = NNA_GenerateAuthEF(&packet, &info, siv, nonce, 0, plaintext,
                             plaintext_length, 0);
      TEST_CHECK(!r);
      if (SIV_GetMinNonceLength(siv) > 1) {
        r = NNA_GenerateAuthEF(&packet, &info, siv, nonce, SIV_GetMinNonceLength(siv) - 1,
                               plaintext, plaintext_length, 0);
        TEST_CHECK(!r);
        TEST_CHECK(info.ext_fields == 0);
      }
      if (SIV_GetMaxNonceLength(siv) <= sizeof (nonce)) {
        r = NNA_GenerateAuthEF(&packet, &info, siv, nonce, SIV_GetMaxNonceLength(siv) - 1,
                               plaintext, plaintext_length, 0);
        TEST_CHECK(!r);
        TEST_CHECK(info.ext_fields == 0);
      }
      r = NNA_GenerateAuthEF(&packet, &info, siv, nonce, nonce_length, plaintext,
                             plaintext_length, sizeof (packet) - info.length + 1);
      TEST_CHECK(!r);

      r = NNA_GenerateAuthEF(&packet, &info, siv, nonce, nonce_length, plaintext,
                             plaintext_length, min_ef_length);
      TEST_CHECK(r);
      TEST_CHECK(info.length - packet_length >= min_ef_length);

      r = NNA_DecryptAuthEF(&packet, &info, siv, packet_length, plaintext2,
                            -1, &plaintext2_length);
      TEST_CHECK(!r);

      r = NNA_DecryptAuthEF(&packet, &info, siv, packet_length, plaintext2,
                            sizeof (plaintext2), &plaintext2_length);
      TEST_CHECK(r);
      TEST_CHECK(plaintext_length == plaintext2_length);
      TEST_CHECK(memcmp(plaintext, plaintext2, plaintext_length) == 0);

      j = random() % (packet_length + plaintext_length +
                      nonce_length + SIV_GetTagLength(siv) + 8) / 4 * 4;
      ((unsigned char *)&packet)[j]++;
      r = NNA_DecryptAuthEF(&packet, &info, siv, packet_length, plaintext2,
                            sizeof (plaintext2), &plaintext2_length);
      TEST_CHECK(!r);
      ((unsigned char *)&packet)[j]--;
    }

    SIV_DestroyInstance(siv);
  }
}
#else
void
test_unit(void)
{
  TEST_REQUIRE(0);
}
#endif