Results 1 to 10 of about 1,639 (282)
Improving deep learning-based neural distinguisher with multiple ciphertext pairs for speck and Simon [PDF]
The neural network-based differential distinguisher has attracted significant interest from researchers due to its high efficiency in cryptanalysis since its introduction by Gohr in 2019.
Nie Xuan, Ma Zhongjun, Ye Xi
exaly +5 more sources
Quantum Neural Network Based Distinguisher on SPECK-32/64 [PDF]
As IoT technology develops, many sensor devices are being used in our life. To protect such sensor data, lightweight block cipher techniques such as SPECK-32 are applied.
Hwajeong Seo +2 more
exaly +6 more sources
A new distinguishing attack on reduced round ChaCha permutation [PDF]
This work concentrates on differential-linear distinguishing attacks on the prominent ARX-based permutation ChaCha. Here, we significantly improve the 7-round differential-linear distinguisher for ChaCha permutation by introducing a new path of linear ...
Chandan Dey, Santanu Sarkar
doaj +2 more sources
Enhanced related-key differential neural distinguishers for SIMON and SIMECK block ciphers [PDF]
At CRYPTO 2019, Gohr pioneered the application of deep learning to differential cryptanalysis and successfully attacked the 11-round NSA block cipher Speck32/64 with a 7-round and an 8-round single-key differential neural distinguisher.
Gao Wang, Gaoli Wang
doaj +3 more sources
The Distinguishing Number and Distinguishing Chromatic Number for Posets [PDF]
23 pages, 4 ...
Karen L. Collins, Ann N. Trenk
openaire +3 more sources
Dimensionality distinguishers [PDF]
14 ...
Nayana Das +2 more
openaire +2 more sources
Distinguishing orthogonality graphs [PDF]
AbstractA graph is said to be ‐distinguishable if there is a labeling of the vertices with labels so that only the trivial automorphism preserves the labels. The smallest such is the distinguishing number, . A set of vertices is a determining set for if every automorphism of is uniquely determined by its action on .
Debra L. Boutin, Sally Cockburn
openaire +3 more sources
The Distinguishing Numbers and the Distinguishing Indexes of Cayley Graphs
The distinguishing number (index) $D(G)$ ($D'(G)$) of a graph $G$ is the least integer $d$ such that $G$ has an vertex labeling (edge labeling) with $d$ labels that is preserved only by a trivial automorphism. In this paper, we investigate the distinguishing number and the distinguishing index of Cayley graphs.
Alikhani, S., Soltani, S.
openaire +3 more sources
Exploiting Weak Diffusion of Gimli: Improved Distinguishers and Preimage Attacks
The Gimli permutation proposed in CHES 2017 was designed for cross-platform performance. One main strategy to achieve such a goal is to utilize a sparse linear layer (Small-Swap and Big-Swap), which occurs every two rounds.
Fukang Liu, Takanori Isobe, Willi Meier
doaj +1 more source
Related-key Differential Analysis of Khudra Algorithm [PDF]
Khudra algorithm is a kind of lightweight block cipher algorithm which has 18 rounds.The existing analysis method,which uses the impossibility relevant key difference to analysis Khudra algorithm,constructs a 14 rounds distinguisher to attack the 16 ...
REN Yaoyao,ZHANG Wenying,XING Chaohui
doaj +1 more source

