Publications
Chosen filters:
Chosen filters:
An Optimal Universal Construction for the Threshold Implementation of Bijective S-Boxes KU Leuven
Threshold implementation is a method based on secret sharing to secure cryptographic ciphers (and in particular S-boxes) against differential power analysis side-channel attacks which was proposed by Nikova, Rechberger, and Rijmen in 2006. Until now, threshold implementations were only constructed for specific types of functions and some small S-boxes, but no generic construction was ever presented. In this paper, we present the first universal ...
Cryptanalysis Techniques for Lightweight Symmetric-Key Primitives KU Leuven
Currently, the only method known to achieve absolute security, is the One-Time Pad, which uses impractically long keys. For all modern purposes we use encryption methods that have no proof of absolute security. Instead, we can prove that certain classes of attacks do not work or that they would require a very large amount of computations or certain extra information. The study of the security of encryption methods against various attacks is ...
Chaghri - A FHE-friendly Block Cipher KU Leuven
The Recent progress in practical applications of secure computation protocols has also attracted attention to the symmetric-key primitives underlying them. Whereas traditional ciphers have evolved to be efficient with respect to certain performance metrics, advanced cryptographic protocols call for a different focus. The so called arithmetic complexity is viewed through the number and layout of non-linear operations in the circuit implemented by ...
Characteristic automated search of cryptographic algorithms for distinguishing attacks (CASCADA) KU Leuven
A bit-vector differential model for the modular addition by a constant and its applications to differential and impossible-differential cryptanalysis KU Leuven
ARX algorithms are a class of symmetric-key algorithms constructed by Addition, Rotation, and XOR. To evaluate the resistance of an ARX cipher against differential and impossible-differential cryptanalysis, the recent automated methods employ constraint satisfaction solvers to search for optimal characteristics or impossible differentials. The main difficulty in formulating this search is finding the differential models of the non-linear ...