From 79ef56dfc57d18eb86df36bf5bb39c039f541e08 Mon Sep 17 00:00:00 2001 From: Kévin Le Gouguec Date: Tue, 21 May 2019 11:28:26 +0200 Subject: Réutilisation de tweakey.c dans l'implémentation itérative MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- src/add_tweakeyloop/tweakey.c | 149 +----------------------------------------- 1 file changed, 1 insertion(+), 148 deletions(-) mode change 100644 => 120000 src/add_tweakeyloop/tweakey.c (limited to 'src/add_tweakeyloop/tweakey.c') diff --git a/src/add_tweakeyloop/tweakey.c b/src/add_tweakeyloop/tweakey.c deleted file mode 100644 index 3360a70..0000000 --- a/src/add_tweakeyloop/tweakey.c +++ /dev/null @@ -1,148 +0,0 @@ -/* -Implementation of the Lilliput-AE tweakable block cipher. - -Authors, hereby denoted as "the implementer": - Kévin Le Gouguec, - 2019. - -For more information, feedback or questions, refer to our website: -https://paclido.fr/lilliput-ae - -To the extent possible under law, the implementer has waived all copyright -and related or neighboring rights to the source code in this file. -http://creativecommons.org/publicdomain/zero/1.0/ - ---- - -This file provides an implementation of Lilliput-TBC's tweakey schedule, -where multiplications by matrices M and M_R to the power n are performed -by applying functions for M and M_R n times. -*/ - -#include -#include - -#include "constants.h" -#include "tweakey.h" - - -#define LANE_BITS 64 -#define LANE_BYTES (LANE_BITS/8) -#define LANES_NB (TWEAKEY_BYTES/LANE_BYTES) - - -void tweakey_state_init( - uint8_t TK[TWEAKEY_BYTES], - const uint8_t key[KEY_BYTES], - const uint8_t tweak[TWEAK_BYTES] -) -{ - memcpy(TK, tweak, TWEAK_BYTES); - memcpy(TK+TWEAK_BYTES, key, KEY_BYTES); -} - - -void tweakey_state_extract( - const uint8_t TK[TWEAKEY_BYTES], - uint8_t round_constant, - uint8_t round_tweakey[ROUND_TWEAKEY_BYTES] -) -{ - memset(round_tweakey, 0, ROUND_TWEAKEY_BYTES); - - for (size_t j=0; j>3 ^ x[3]; - y[3] = x[2]; - y[2] = x[6]<<2 ^ x[1]; - y[1] = x[0]; - y[0] = x[7]; -} - -static void _multiply_M2(const uint8_t x[LANE_BYTES], uint8_t y[LANE_BYTES]) -{ - uint8_t M_x[LANE_BYTES]; - _multiply_M(x, M_x); - _multiply_M(M_x, y); -} - -static void _multiply_M3(const uint8_t x[LANE_BYTES], uint8_t y[LANE_BYTES]) -{ - uint8_t M_x[LANE_BYTES]; - uint8_t M2_x[LANE_BYTES]; - _multiply_M(x, M_x); - _multiply_M(M_x, M2_x); - _multiply_M(M2_x, y); -} - -static void _multiply_MR(const uint8_t x[LANE_BYTES], uint8_t y[LANE_BYTES]) -{ - y[0] = x[1]; - y[1] = x[2]; - y[2] = x[3] ^ x[4]>>3; - y[3] = x[4]; - y[4] = x[5] ^ x[6]<<3; - y[5] = x[3]<<2 ^ x[6]; - y[6] = x[7]; - y[7] = x[0]; -} - -static void _multiply_MR2(const uint8_t x[LANE_BYTES], uint8_t y[LANE_BYTES]) -{ - uint8_t MR_x[LANE_BYTES]; - _multiply_MR(x, MR_x); - _multiply_MR(MR_x, y); -} - -static void _multiply_MR3(const uint8_t x[LANE_BYTES], uint8_t y[LANE_BYTES]) -{ - uint8_t MR_x[LANE_BYTES]; - uint8_t MR2_x[LANE_BYTES]; - _multiply_MR(x, MR_x); - _multiply_MR(MR_x, MR2_x); - _multiply_MR(MR2_x, y); -} - -typedef void (*matrix_multiplication)(const uint8_t x[LANE_BYTES], uint8_t y[LANE_BYTES]); - -static const matrix_multiplication ALPHAS[6] = { - _multiply_M, - _multiply_M2, - _multiply_M3, - _multiply_MR, - _multiply_MR2, - _multiply_MR3 -}; - - -void tweakey_state_update(uint8_t TK[TWEAKEY_BYTES]) -{ - /* Skip lane 0, as it is multiplied by the identity matrix. */ - - for (size_t j=1; j