Coverage Report

Created: 2026-07-25 07:00

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/samba/third_party/heimdal/lib/hcrypto/camellia.c
Line
Count
Source
1
/*
2
 * Copyright (c) 2007 Kungliga Tekniska Högskolan
3
 * (Royal Institute of Technology, Stockholm, Sweden).
4
 * All rights reserved.
5
 *
6
 * Redistribution and use in source and binary forms, with or without
7
 * modification, are permitted provided that the following conditions
8
 * are met:
9
 *
10
 * 1. Redistributions of source code must retain the above copyright
11
 *    notice, this list of conditions and the following disclaimer.
12
 *
13
 * 2. Redistributions in binary form must reproduce the above copyright
14
 *    notice, this list of conditions and the following disclaimer in the
15
 *    documentation and/or other materials provided with the distribution.
16
 *
17
 * 3. Neither the name of the Institute nor the names of its contributors
18
 *    may be used to endorse or promote products derived from this software
19
 *    without specific prior written permission.
20
 *
21
 * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
22
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
25
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31
 * SUCH DAMAGE.
32
 */
33
34
#include <config.h>
35
#include <roken.h>
36
37
#ifdef KRB5
38
#include <krb5-types.h>
39
#endif
40
41
#include "camellia-ntt.h"
42
#include "camellia.h"
43
44
int
45
CAMELLIA_set_key(const unsigned char *userkey,
46
     const int bits, CAMELLIA_KEY *key)
47
0
{
48
0
    key->bits = bits;
49
0
    Camellia_Ekeygen(bits, userkey, key->key);
50
0
    return 1;
51
0
}
52
53
void
54
CAMELLIA_encrypt(const unsigned char *in, unsigned char *out,
55
     const CAMELLIA_KEY *key)
56
0
{
57
0
    Camellia_EncryptBlock(key->bits, in, key->key, out);
58
59
0
}
60
61
void
62
CAMELLIA_decrypt(const unsigned char *in, unsigned char *out,
63
     const CAMELLIA_KEY *key)
64
0
{
65
0
    Camellia_DecryptBlock(key->bits, in, key->key, out);
66
0
}
67
68
void
69
CAMELLIA_cbc_encrypt(const unsigned char *in, unsigned char *out,
70
         unsigned long size, const CAMELLIA_KEY *key,
71
         unsigned char *iv, int mode_encrypt)
72
0
{
73
0
    unsigned char tmp[CAMELLIA_BLOCK_SIZE];
74
0
    int i;
75
76
0
    if (mode_encrypt) {
77
0
  while (size >= CAMELLIA_BLOCK_SIZE) {
78
0
      for (i = 0; i < CAMELLIA_BLOCK_SIZE; i++)
79
0
    tmp[i] = in[i] ^ iv[i];
80
0
      CAMELLIA_encrypt(tmp, out, key);
81
0
      memcpy(iv, out, CAMELLIA_BLOCK_SIZE);
82
0
      size -= CAMELLIA_BLOCK_SIZE;
83
0
      in += CAMELLIA_BLOCK_SIZE;
84
0
      out += CAMELLIA_BLOCK_SIZE;
85
0
  }
86
0
  if (size) {
87
0
      for (i = 0; i < size; i++)
88
0
    tmp[i] = in[i] ^ iv[i];
89
0
      for (i = size; i < CAMELLIA_BLOCK_SIZE; i++)
90
0
    tmp[i] = iv[i];
91
0
      CAMELLIA_encrypt(tmp, out, key);
92
0
      memcpy(iv, out, CAMELLIA_BLOCK_SIZE);
93
0
  }
94
0
    } else {
95
0
  while (size >= CAMELLIA_BLOCK_SIZE) {
96
0
      memcpy(tmp, in, CAMELLIA_BLOCK_SIZE);
97
0
      CAMELLIA_decrypt(tmp, out, key);
98
0
      for (i = 0; i < CAMELLIA_BLOCK_SIZE; i++)
99
0
    out[i] ^= iv[i];
100
0
      memcpy(iv, tmp, CAMELLIA_BLOCK_SIZE);
101
0
      size -= CAMELLIA_BLOCK_SIZE;
102
0
      in += CAMELLIA_BLOCK_SIZE;
103
0
      out += CAMELLIA_BLOCK_SIZE;
104
0
  }
105
0
  if (size) {
106
0
      memcpy(tmp, in, CAMELLIA_BLOCK_SIZE);
107
0
      CAMELLIA_decrypt(tmp, out, key);
108
0
      for (i = 0; i < size; i++)
109
0
    out[i] ^= iv[i];
110
0
      memcpy(iv, tmp, CAMELLIA_BLOCK_SIZE);
111
0
  }
112
0
    }
113
0
}