Fast Transciphering Via Batched And Reconfigurable LUT Evaluation

The purpose of the dataset is to support the findings of the paper in the form of code in C++ and Python/Sagemath.

First, the dataset implements the novel algorithm for homomorphic lookup table evaluation described in the paper (Section 3, Algorithm 8) and all required subroutines.

All subroutines are described in the work or can be accessed through the references which are publicly available.

Then, the dataset contains a first script, demonstrating that parameters chosen by a related work yield a setting in which the cryptographic scheme is not secure. Finally, it contains a second script showing that another algorithm presented in a related work fails to provide the correct result with a very large probability.