5 hasil untuk "David Gerault"
Menampilkan 1–5 · 0,27 detik · RSS
-
Artikel Jurnal
Exploring Differential-Based Distinguishers and Forgeries for ASCON
Automated methods have become crucial components when searching for distinguishers against symmetric-key cryptographic primitives. While MILP and SAT solvers are among the most popular tools to model ciphers and perform cryptanalysis, other methods with different performance profiles are appearing…
-
Artikel Jurnal
A Cipher-Agnostic Neural Training Pipeline with Automated Finding of Good Input Differences
Neural cryptanalysis is the study of cryptographic primitives through machine learning techniques. Following Gohr’s seminal paper at CRYPTO 2019, a focus has been placed on improving the accuracy of such distinguishers against specific primitives, using dedicated training schemes, in order to…
-
Artikel Jurnal
On the Usage of Deterministic (Related-Key) Truncated Differentials and Multidimensional Linear Approximations for SPN Ciphers
Among the few works realising the search of truncated differentials (TD) and multidimensional linear approximations (MDLA) holding for sure, the optimality of the distinguisher should be confirmed via an exhaustive search over all possible input differences/masks, which cannot be afforded when the…
-
Artikel Jurnal
Boosting Differential-Linear Cryptanalysis of ChaCha7 with MILP
In this paper, we present an improved differential-linear cryptanalysis of the ChaCha stream cipher. Our main contributions are new differential-linear distinguishers that we were able to build thanks to the following improvements: a) we considered a larger search space, including 2-bit differences…
-
Artikel Jurnal
Analysis of AES, SKINNY, and Others with Constraint Programming
…First, we show that a simple application of the CP approach proposed by Gerault et al. leads to the solution of the open problem of determining the exact lower bound of the number of active S-boxes for 6-round AES-128 in the related-key model. Subsequently, we show that the same approach can be…