From 1989002054111cc5301f9aa229957cbd59a9e2f5 Mon Sep 17 00:00:00 2001 From: Kévin Le Gouguec Date: Wed, 20 Feb 2019 17:30:10 +0100 Subject: Changement de l'implémentation de référence MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit Et suppression de l'implémentation add_tweakeysequences, qui n'a plus aucun intérêt (plus lente et plus grosse que les deux autres). --- src/add_tweakeysequences/tweakey.c | 240 ------------------------------------- 1 file changed, 240 deletions(-) delete mode 100644 src/add_tweakeysequences/tweakey.c (limited to 'src/add_tweakeysequences/tweakey.c') diff --git a/src/add_tweakeysequences/tweakey.c b/src/add_tweakeysequences/tweakey.c deleted file mode 100644 index fa77e36..0000000 --- a/src/add_tweakeysequences/tweakey.c +++ /dev/null @@ -1,240 +0,0 @@ -/* -Implementation of the Lilliput-AE tweakable block cipher. - -Author: 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 functions expressing the exponentiated matrices with shifts and XORs, -with 8×8 matrices M_1, M_2, M_3 and M_4 pre-computed as lookup tables. -*/ - -#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]) -{ - y[7] = x[5]; - y[6] = x[5]<<3 ^ x[4]; - y[5] = x[5]<<6 ^ M_1[x[4]] ^ x[3]; - y[4] = x[4]>>6 ^ x[3]>>3 ^ x[2]; - y[3] = x[6]<<2 ^ x[1]; - y[2] = x[5]<<2 ^ x[0]; - y[1] = x[7]; - y[0] = x[6]; -} - -static void _multiply_M3(const uint8_t x[LANE_BYTES], uint8_t y[LANE_BYTES]) -{ - y[7] = x[5]<<3 ^ x[4]; - y[6] = x[5]<<6 ^ M_1[x[4]] ^ x[3]; - y[5] = M_2[x[4]] ^ M_1[x[3]] ^ x[2]; - y[4] = x[6]<<2 ^ x[3]>>6 ^ x[2]>>3 ^ x[1]; - y[3] = x[5]<<2 ^ x[0]; - y[2] = x[7] ^ x[5]<<5 ^ x[4]<<2; - y[1] = x[6]; - y[0] = x[5]; -} - -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]) -{ - y[0] = x[2]; - y[1] = x[3] ^ x[4]>>3; - y[2] = x[4] ^ x[5]>>3 ^ M_3[x[6]]; - y[3] = x[5] ^ x[6]<<3; - y[4] = x[3]<<2 ^ x[6] ^ x[7]<<3; - y[5] = x[4]<<2 ^ x[7]; - y[6] = x[0]; - y[7] = x[1]; -} - -static void _multiply_MR3(const uint8_t x[LANE_BYTES], uint8_t y[LANE_BYTES]) -{ - y[0] = x[3] ^ x[4]>>3; - y[1] = x[4] ^ x[5]>>3 ^ M_3[x[6]]; - y[2] = M_4[x[3]] ^ x[5] ^ M_1[x[6]] ^ M_3[x[7]]; - y[3] = x[3]<<2 ^ x[6] ^ x[7]<<3; - y[4] = x[0]<<3 ^ x[4]<<2 ^ x[7]; - y[5] = x[0] ^ x[5]<<2 ^ x[6]<<5; - y[6] = x[1]; - y[7] = x[2]; -} - -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