gimli24.c 9.9 KB
Newer Older
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 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330
/*
 * Copyright (C) 2020 Southern Storm Software, Pty Ltd.
 *
 * Permission is hereby granted, free of charge, to any person obtaining a
 * copy of this software and associated documentation files (the "Software"),
 * to deal in the Software without restriction, including without limitation
 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
 * and/or sell copies of the Software, and to permit persons to whom the
 * Software is furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included
 * in all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
 * DEALINGS IN THE SOFTWARE.
 */

#include "gimli24.h"
#include "internal-gimli24.h"
#include <string.h>

aead_cipher_t const gimli24_cipher = {
    "GIMLI-24",
    GIMLI24_KEY_SIZE,
    GIMLI24_NONCE_SIZE,
    GIMLI24_TAG_SIZE,
    AEAD_FLAG_LITTLE_ENDIAN,
    gimli24_aead_encrypt,
    gimli24_aead_decrypt
};

aead_hash_algorithm_t const gimli24_hash_algorithm = {
    "GIMLI-24-HASH",
    sizeof(gimli24_hash_state_t),
    GIMLI24_HASH_SIZE,
    AEAD_FLAG_LITTLE_ENDIAN,
    gimli24_hash,
    (aead_hash_init_t)gimli24_hash_init,
    (aead_hash_update_t)gimli24_hash_absorb,
    (aead_hash_finalize_t)gimli24_hash_finalize,
    (aead_xof_absorb_t)gimli24_hash_absorb,
    (aead_xof_squeeze_t)gimli24_hash_squeeze
};

/**
 * \brief Number of bytes of input or output data to process per block.
 */
#define GIMLI24_BLOCK_SIZE 16

/**
 * \brief Structure of the GIMLI-24 state as both an array of words
 * and an array of bytes.
 */
typedef union
{
    uint32_t words[12];     /**< Words in the state */
    uint8_t bytes[48];      /**< Bytes in the state */

} gimli24_state_t;

/**
 * \brief Absorbs data into a GIMLI-24 state.
 *
 * \param state The state to absorb the data into.
 * \param data Points to the data to be absorbed.
 * \param len Length of the data to be absorbed.
 */
static void gimli24_absorb
    (gimli24_state_t *state, const unsigned char *data, unsigned long long len)
{
    unsigned temp;
    while (len >= GIMLI24_BLOCK_SIZE) {
        lw_xor_block(state->bytes, data, GIMLI24_BLOCK_SIZE);
        gimli24_permute(state->words);
        data += GIMLI24_BLOCK_SIZE;
        len -= GIMLI24_BLOCK_SIZE;
    }
    temp = (unsigned)len;
    lw_xor_block(state->bytes, data, temp);
    state->bytes[temp] ^= 0x01; /* Padding */
    state->bytes[47] ^= 0x01;
    gimli24_permute(state->words);
}

/**
 * \brief Encrypts a block of data with a GIMLI-24 state.
 *
 * \param state The state to encrypt with.
 * \param dest Points to the destination buffer.
 * \param src Points to the source buffer.
 * \param len Length of the data to encrypt from \a src into \a dest.
 */
static void gimli24_encrypt
    (gimli24_state_t *state, unsigned char *dest,
     const unsigned char *src, unsigned long long len)
{
    unsigned temp;
    while (len >= GIMLI24_BLOCK_SIZE) {
        lw_xor_block_2_dest(dest, state->bytes, src, GIMLI24_BLOCK_SIZE);
        gimli24_permute(state->words);
        dest += GIMLI24_BLOCK_SIZE;
        src += GIMLI24_BLOCK_SIZE;
        len -= GIMLI24_BLOCK_SIZE;
    }
    temp = (unsigned)len;
    lw_xor_block_2_dest(dest, state->bytes, src, temp);
    state->bytes[temp] ^= 0x01; /* Padding */
    state->bytes[47] ^= 0x01;
    gimli24_permute(state->words);
}

/**
 * \brief Decrypts a block of data with a GIMLI-24 state.
 *
 * \param state The state to decrypt with.
 * \param dest Points to the destination buffer.
 * \param src Points to the source buffer.
 * \param len Length of the data to decrypt from \a src into \a dest.
 */
static void gimli24_decrypt
    (gimli24_state_t *state, unsigned char *dest,
     const unsigned char *src, unsigned long long len)
{
    unsigned temp;
    while (len >= GIMLI24_BLOCK_SIZE) {
        lw_xor_block_swap(dest, state->bytes, src, GIMLI24_BLOCK_SIZE);
        gimli24_permute(state->words);
        dest += GIMLI24_BLOCK_SIZE;
        src += GIMLI24_BLOCK_SIZE;
        len -= GIMLI24_BLOCK_SIZE;
    }
    temp = (unsigned)len;
    lw_xor_block_swap(dest, state->bytes, src, temp);
    state->bytes[temp] ^= 0x01; /* Padding */
    state->bytes[47] ^= 0x01;
    gimli24_permute(state->words);
}

int gimli24_aead_encrypt
    (unsigned char *c, unsigned long long *clen,
     const unsigned char *m, unsigned long long mlen,
     const unsigned char *ad, unsigned long long adlen,
     const unsigned char *nsec,
     const unsigned char *npub,
     const unsigned char *k)
{
    gimli24_state_t state;
    (void)nsec;

    /* Set the length of the returned ciphertext */
    *clen = mlen + GIMLI24_TAG_SIZE;

    /* Format the initial GIMLI state from the nonce and the key */
    memcpy(state.words, npub, GIMLI24_NONCE_SIZE);
    memcpy(state.words + 4, k, GIMLI24_KEY_SIZE);

    /* Permute the initial state */
    gimli24_permute(state.words);

    /* Absorb the associated data */
    gimli24_absorb(&state, ad, adlen);

    /* Encrypt the plaintext to produce the ciphertext */
    gimli24_encrypt(&state, c, m, mlen);

    /* Generate the authentication tag at the end of the ciphertext */
    memcpy(c + mlen, state.bytes, GIMLI24_TAG_SIZE);
    return 0;
}

int gimli24_aead_decrypt
    (unsigned char *m, unsigned long long *mlen,
     unsigned char *nsec,
     const unsigned char *c, unsigned long long clen,
     const unsigned char *ad, unsigned long long adlen,
     const unsigned char *npub,
     const unsigned char *k)
{
    gimli24_state_t state;
    (void)nsec;

    /* Validate the ciphertext length and set the return "mlen" value */
    if (clen < GIMLI24_TAG_SIZE)
        return -1;
    *mlen = clen - GIMLI24_TAG_SIZE;

    /* Format the initial GIMLI state from the nonce and the key */
    memcpy(state.words, npub, GIMLI24_NONCE_SIZE);
    memcpy(state.words + 4, k, GIMLI24_KEY_SIZE);

    /* Permute the initial state */
    gimli24_permute(state.words);

    /* Absorb the associated data */
    gimli24_absorb(&state, ad, adlen);

    /* Decrypt the ciphertext to produce the plaintext */
    gimli24_decrypt(&state, m, c, *mlen);

    /* Check the authentication tag at the end of the packet */
    return aead_check_tag
        (m, *mlen, state.bytes, c + *mlen, GIMLI24_TAG_SIZE);
}

int gimli24_hash
    (unsigned char *out, const unsigned char *in, unsigned long long inlen)
{
    gimli24_state_t state;

    /* Initialize the hash state to all zeroes */
    memset(&state, 0, sizeof(state));

    /* Absorb the input */
    gimli24_absorb(&state, in, inlen);

    /* Generate the output hash */
    memcpy(out, state.bytes, GIMLI24_HASH_SIZE / 2);
    gimli24_permute(state.words);
    memcpy(out + GIMLI24_HASH_SIZE / 2, state.bytes, GIMLI24_HASH_SIZE / 2);
    return 0;
}

void gimli24_hash_init(gimli24_hash_state_t *state)
{
    memset(state, 0, sizeof(gimli24_hash_state_t));
}

#define GIMLI24_XOF_RATE 16
#define gimli24_xof_permute() \
    gimli24_permute((uint32_t *)(state->s.state))

void gimli24_hash_absorb
    (gimli24_hash_state_t *state, const unsigned char *in,
     unsigned long long inlen)
{
    unsigned temp;

    if (state->s.mode) {
        /* We were squeezing output - go back to the absorb phase */
        state->s.mode = 0;
        state->s.count = 0;
        gimli24_xof_permute();
    }

    /* Handle the partial left-over block from last time */
    if (state->s.count) {
        temp = GIMLI24_XOF_RATE - state->s.count;
        if (temp > inlen) {
            temp = (unsigned)inlen;
            lw_xor_block(state->s.state + state->s.count, in, temp);
            state->s.count += temp;
            return;
        }
        lw_xor_block(state->s.state + state->s.count, in, temp);
        state->s.count = 0;
        in += temp;
        inlen -= temp;
        gimli24_xof_permute();
    }

    /* Process full blocks that are aligned at state->s.count == 0 */
    while (inlen >= GIMLI24_XOF_RATE) {
        lw_xor_block(state->s.state, in, GIMLI24_XOF_RATE);
        in += GIMLI24_XOF_RATE;
        inlen -= GIMLI24_XOF_RATE;
        gimli24_xof_permute();
    }

    /* Process the left-over block at the end of the input */
    temp = (unsigned)inlen;
    lw_xor_block(state->s.state, in, temp);
    state->s.count = temp;
}

void gimli24_hash_squeeze
    (gimli24_hash_state_t *state, unsigned char *out,
     unsigned long long outlen)
{
    unsigned temp;

    /* Pad the final input block if we were still in the absorb phase */
    if (!state->s.mode) {
        state->s.state[state->s.count] ^= 0x01;
        state->s.state[47] ^= 0x01;
        state->s.count = 0;
        state->s.mode = 1;
    }

    /* Handle left-over partial blocks from last time */
    if (state->s.count) {
        temp = GIMLI24_XOF_RATE - state->s.count;
        if (temp > outlen) {
            temp = (unsigned)outlen;
            memcpy(out, state->s.state + state->s.count, temp);
            state->s.count += temp;
            return;
        }
        memcpy(out, state->s.state + state->s.count, temp);
        out += temp;
        outlen -= temp;
        state->s.count = 0;
    }

    /* Handle full blocks */
    while (outlen >= GIMLI24_XOF_RATE) {
        gimli24_xof_permute();
        memcpy(out, state->s.state, GIMLI24_XOF_RATE);
        out += GIMLI24_XOF_RATE;
        outlen -= GIMLI24_XOF_RATE;
    }

    /* Handle the left-over block */
    if (outlen > 0) {
        temp = (unsigned)outlen;
        gimli24_xof_permute();
        memcpy(out, state->s.state, temp);
        state->s.count = temp;
    }
}

void gimli24_hash_finalize
    (gimli24_hash_state_t *state, unsigned char *out)
{
    gimli24_hash_squeeze(state, out, GIMLI24_HASH_SIZE);
}