Results 41 to 50 of about 454,487 (179)
Improved meet-in-the-middle attack on ARIA cipher
Tongxin xuebao, 2015 A study on the structure of ARIA cipher is presented. A new 4-round distinguishing property for the meet-in-the-middle attack on ARIA cipher is presented by making use of the multiset and the truncated differential char-acteristic. The new distinguishing
Man-man LI, Shao-zhen CHEN
doaj +2 more sources
Differential, Linear, and Meet-in-the-Middle Attacks on the Lightweight Block Cipher RBFK
IET Information Security, 2023 Randomized butterfly architecture of fast Fourier transform for key cipher (RBFK) is the lightweight block cipher for Internet of things devices in an edge computing environment.
Sugio Nobuyuki
doaj +1 more source
Meeting in the Middle: Towards Successful Multidisciplinary Bioimage Analysis Collaboration
Frontiers in Bioinformatics, 2022 With an increase in subject knowledge expertise required to solve specific biological questions, experts from different fields need to collaborate to address increasingly complex issues. To successfully collaborate, everyone involved in the collaboration must take steps to “meet in the middle.” We thus present a guide on truly cross-disciplinary work ...
Schlaeppi, Anjalie +13 more
openaire +5 more sources
Applying Grover's algorithm to AES: quantum resource estimates
, 2015 We present quantum circuits to implement an exhaustive key search for the Advanced Encryption Standard (AES) and analyze the quantum resources required to carry out such an attack.
A Barenco +17 more
core +1 more source
A Meet-in-the-Middle Attack on 8-Round AES [PDF]
, 2008 We present a 5-round distinguisher for AES. We exploit this distinguisher to develop a meet-in-the-middle attack on 7 rounds of AES-192 and 8 rounds of AES-256. We also give a time-memory tradeoff generalization of the basic attack which gives a better balancing between different costs of the attack.
Demirci, Hueseyin, Selcuk, Ali Aydin
openaire +3 more sources
Front-to-End Bidirectional Heuristic Search with Near-Optimal Node Expansions
, 2017 It is well-known that any admissible unidirectional heuristic search algorithm must expand all states whose $f$-value is smaller than the optimal solution cost when using a consistent heuristic. Such states are called "surely expanded" (s.e.).
Chen, Jingwei +3 more
core +1 more source
A Meet-in-the-middle Attack Method of Deoxys-BC [PDF]
Jisuanji kexueThe Deoxys-BC adopting the SPN structure and TWEAK framework is a lightweight tweakable block cipher published at ASIACRPYPT 2014.By researching the internal characteristic and key schedule of the Deoxys-BC,a 6-round meet-in-the-middle distinguisher ...
LI Zheng, LI Manman, CHEN Shaozhen
doaj +1 more source
Correlates of Meeting the Muscle-Strengthening Exercise Guidelines in Children and Adolescent
Frontiers in Public Health, 2022 This study aimed to explore the potential correlates of muscle-strengthening exercise (MSE) in Chinese children and adolescents. A convenient sample (n = 3733) was recruited into this study.
Jiayi Gu +5 more
doaj +1 more source
Improved Meet-in-the-Middle Preimage Attacks against AES Hashing Modes
IACR Transactions on Symmetric Cryptology, 2020 Hashing modes are ways to convert a block cipher into a hash function, and those with AES as the underlying block cipher are referred to as AES hashing modes.
Zhenzhen Bao +4 more
doaj +1 more source
Space--Time Tradeoffs for Subset Sum: An Improved Worst Case Algorithm
, 2013 The technique of Schroeppel and Shamir (SICOMP, 1981) has long been the most efficient way to trade space against time for the SUBSET SUM problem. In the random-instance setting, however, improved tradeoffs exist.
A. Becker +7 more
core +1 more source