lilliput-ae-reference-implementation

Implementations of Lilliput-AE submitted to the NIST LWC standardization process
git clone https://git.kevinlegouguec.net/lilliput-ae-reference-implementation
Log | Files | Refs | README

commit 3ffe28672860a63fd95ed9e97601f30258ea2bdb
parent e744e3907713a073100cfe96769fe235b1bf50b8
Author: Kévin Le Gouguec <kevin.legouguec@airbus.com>
Date:   Fri, 15 Mar 2019 17:28:28 +0100

Nettoyage d'espaces

… En vrai je ne vois pas de  bonne raison de se soucier des espaces en
bout de  ligne. Les outils  de diff  savent les ignorer,  les éditeurs
savent les ignorer…

🤷

Diffstat:
Msrc/add_threshold/cipher.c | 12++++++------
1 file changed, 6 insertions(+), 6 deletions(-)

diff --git a/src/add_threshold/cipher.c b/src/add_threshold/cipher.c @@ -16,12 +16,12 @@ http://creativecommons.org/publicdomain/zero/1.0/ --- -This file provides a first-order threshold implementation of the Lilliput-AE -tweakable block cipher. The input block is split into 3 shares while the key -is split into 2 shares for the tweakey schedule. The S-box relies on look-up -tables and saves some memory usage at the cost of additional operations as -described in the specification. This implementation operates on 3 shares -throughout the entire round function in order to avoid extra randomness +This file provides a first-order threshold implementation of the Lilliput-AE +tweakable block cipher. The input block is split into 3 shares while the key +is split into 2 shares for the tweakey schedule. The S-box relies on look-up +tables and saves some memory usage at the cost of additional operations as +described in the specification. This implementation operates on 3 shares +throughout the entire round function in order to avoid extra randomness generation to switch from 2 shares to 3 shares and vice versa. */