Results 21 to 30 of about 1,639 (282)
Weak Keys in Reduced AEGIS and Tiaoxin
IACR Transactions on Symmetric Cryptology, 2021 AEGIS-128 and Tiaoxin-346 (Tiaoxin for short) are two AES-based primitives submitted to the CAESAR competition. Among them, AEGIS-128 has been selected in the final portfolio for high-performance applications, while Tiaoxin is a third-round candidate ...
Fukang Liu +3 more
doaj +1 more source
New Results on Machine Learning-Based Distinguishers
IEEE Access, 2023 Machine Learning (ML) is almost ubiquitously used in multiple disciplines nowadays. Recently, we have seen its usage in the realm of differential distinguishers for symmetric key ciphers. It has been shown that ML-based differential distinguishers can be
Anubhab Baksi +5 more
doaj +1 more source
RNA, 2007 Given two organisms, how can one distinguish whether they belong to the same species or not? This might be straightforward for two divergent organisms, but can be extremely difficult and laborious for closely related ones. A molecular marker giving a clear distinction would therefore be of immense benefit.
Tobias, Müller +4 more
openaire +2 more sources
An Improved Distinguisher for Dragon [PDF]
, 2007 . Dragon stream cipher is one of the focus ciphers which have reached Phase 2 of the eSTREAM project. In this paper, we present a new method of building a linear distinguisher for Dragon. The distinguisher is constructed by exploiting the biases of two S-
Cho, Joo Yeon +3 more
core +1 more source
Academia de Direito, 2021 This chapter talks about identifying and evaluating implications that are not common implications of the alternatives on offer called distinguishing implication. Many mechanisms are at work in most real-world targets and it is important not to overinterpret a claim about distinguishing.
Scott Ashworth +2 more
+5 more sources
The Electronic Journal of Combinatorics, 2011 The distinguishing number of a group $A$ acting faithfully on a set $X$, denoted $D(A,X)$, is the least number of colors needed to color the elements of $X$ so that no nonidentity element of $A$ preserves the coloring. Given a map $M$ (an embedding of a graph in a closed surface) with vertex set $V$ and without loops or multiples edges, let $D(M)=D ...
openaire +2 more sources
Automated Search Oriented to Key Recovery on Ciphers with Linear Key Schedule
IACR Transactions on Symmetric Cryptology, 2021 Automatic modelling to search distinguishers with high probability covering as many rounds as possible, such as MILP, SAT/SMT, CP models, has become a very popular cryptanalysis topic today.
Lingyue Qin +4 more
doaj +1 more source
Improving Differential-Neural Distinguisher Model For DES, Chaskey and PRESENT [PDF]
, 2022 In CRYPTO 2019, Gohr first introduced the deep learning method to cryptanalysis for Speck32/64. A differential-neural distinguisher was obtained using ResNet neural network. Zhang et al.
Liu Zhang, Zilong Wang
core
On the Distinguishing Number of Functigraphs [PDF]
Symmetry, 2018 Let G 1 and G 2 be disjoint copies of a graph G and g : V ( G 1 ) → V ( G 2 ) be a function. A functigraph F G consists of the vertex set V ( G 1 ) ∪ V ( G 2 ) and the edge set E ( G 1 ) ∪ E ( G 2 ) ∪ { u v : g ( u ) = v } .
Muhammad Fazil +4 more
openaire +2 more sources
Boosting Differential-Linear Cryptanalysis of ChaCha7 with MILP
IACR Transactions on Symmetric Cryptology, 2023 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 ...
Emanuele Bellini +4 more
doaj +1 more source