Results 1 to 10 of about 391 (108)
The Generative Mechanism of Boomerang Intention: From the Perspective of Legacy Identification
Boomerang employment has become an increasingly significant third way to obtain employees, yet little research has focused on why does ex-employee want to come back.
Shanshan Qian
exaly +3 more sources
New Properties of the Double Boomerang Connectivity Table
The double boomerang connectivity table (DBCT) is a new table proposed recently to capture the behavior of two consecutive S-boxes in boomerang attacks.
Qianqian Yang +4 more
doaj +1 more source
On Boomerang Attacks on Quadratic Feistel Ciphers
The recent introduction of the Boomerang Connectivity Table (BCT) at Eurocrypt 2018 revived interest in boomerang cryptanalysis and in the need to correctly build boomerang distinguishers.
Xavier Bonnetain, Virginie Lallemand
doaj +1 more source
Throwing Boomerangs into Feistel Structures
Automatic tools to search for boomerang distinguishers have seen significant advances over the past few years. However, most previous work has focused on ciphers based on a Substitution Permutation Network (SPN), while analyzing the Feistel structure is
Hosein Hadipour +2 more
doaj +1 more source
SAT-aided Automatic Search of Boomerang Distinguishers for ARX Ciphers
In Addition-Rotation-Xor (ARX) ciphers, the large domain size obstructs the application of the boomerang connectivity table. In this paper, we explore the problem of computing this table for a modular addition and the automatic search of boomerang ...
Dachao Wang, Baocang Wang, Siwei Sun
doaj +1 more source
Improved Rectangle Attacks on SKINNY and CRAFT
The boomerang and rectangle attacks are adaptions of differential cryptanalysis that regard the target cipher E as a composition of two sub-ciphers, i.e., E = E1 ∘ E0, to construct a distinguisher for E with probability p2q2 by concatenating two short ...
Hosein Hadipour +2 more
doaj +1 more source
A Formal Analysis of Boomerang Probabilities
In the past 20 years since their conception, boomerang attacks have become an important tool in the cryptanalysis of block ciphers. In the classical estimate of their success probability, assumptions are made about the independence of the underlying ...
Andreas B. Kidmose, Tyge Tiessen
doaj +1 more source
This paper introduces the Boomerang Sampler as a novel class of continuous-time non-reversible Markov chain Monte Carlo algorithms. The methodology begins by representing the target density as a density, $e^{-U}$, with respect to a prescribed (usually) Gaussian measure and constructs a continuous trajectory consisting of a piecewise elliptical path ...
Joris Bierkens +3 more
openaire +3 more sources
Catching the Fastest Boomerangs
In this paper we describe a new tool to search for boomerang distinguishers. One limitation of the MILP model of Liu et al. is that it handles only one round for the middle part while Song et al. have shown that dependencies could affect much more rounds,
Stéphanie Delaune +2 more
doaj +3 more sources

