summaryrefslogtreecommitdiff
path: root/crypto_aead/lilliputaei128v1/ref/Makefile
diff options
context:
space:
mode:
authorKévin Le Gouguec <kevin.legouguec@airbus.com>2018-11-22 10:31:37 +0100
committerKévin Le Gouguec <kevin.legouguec@airbus.com>2018-11-22 10:40:47 +0100
commitad7bfa1e842c8493880a860b7275048ba5dc730c (patch)
tree1bb219a0cde0b5cfb168b91d649068364665e5b7 /crypto_aead/lilliputaei128v1/ref/Makefile
parent6c7cceee3c7627d3c26dd3c064183d8a26d7fca5 (diff)
downloadlilliput-ae-implem-ad7bfa1e842c8493880a860b7275048ba5dc730c.tar.xz
Ajout du test de déchiffrement et correction de l'implémentation
J'étais parti du principe que pour inverser non-linear layer r0 linear layer permutation layer … non-linear layer r31 linear layer / Il allait falloir faire non-linear layer r0 linear layer / … non-linear layer r31 linear layer permutation layer Mais en fait non, on procède comme au chiffrement : c'est le dernier tour qui saute la permutation. C'est bien précisé dans Lilliput (annexe B, figure 8). ✨ MathéMagie ✨
Diffstat (limited to 'crypto_aead/lilliputaei128v1/ref/Makefile')
-rw-r--r--crypto_aead/lilliputaei128v1/ref/Makefile4
1 files changed, 3 insertions, 1 deletions
diff --git a/crypto_aead/lilliputaei128v1/ref/Makefile b/crypto_aead/lilliputaei128v1/ref/Makefile
index db1d5ca..44fbd03 100644
--- a/crypto_aead/lilliputaei128v1/ref/Makefile
+++ b/crypto_aead/lilliputaei128v1/ref/Makefile
@@ -1,4 +1,4 @@
-tests = test-tweakey test-tbc-encrypt
+tests = test-tweakey test-tbc-encrypt test-tbc-decrypt
.PHONY: clean test $(tests)
@@ -27,10 +27,12 @@ $(tests): %: results/%
diff -ru test/$*-ref results/$@-output
+results/test-tbc-decrypt: results/cipher.o results/tweakey.o results/constants.o | results
results/test-tbc-encrypt: results/cipher.o results/tweakey.o results/constants.o | results
results/test-tweakey: results/tweakey.o results/constants.o | results
results/test-*.o: test/helpers.h parameters.h
+results/test-tbc-decrypt.o: cipher.h
results/test-tbc-encrypt.o: cipher.h
results/test-tweakey.o: tweakey.h