Results 11 to 20 of about 454,487 (179)
Assigning Channels Via the Meet-in-the-Middle Approach [PDF]
Algorithmica, 2014 We study the complexity of the Channel Assignment problem. By applying the meet-in-the-middle approach we get an algorithm for the $\ell$-bounded Channel Assignment (when the edge weights are bounded by $\ell$) running in time $O^*((2\sqrt{\ell+1})^n)$. This is the first algorithm which breaks the $(O(\ell))^n$ barrier.
Kowalik, Łukasz, Socała, Arkadiusz
core +6 more sources
Equal-Subset-Sum Faster Than the Meet-in-the-Middle [PDF]
, 2019 In the Equal-Subset-Sum problem, we are given a set $S$ of $n$ integers and the problem is to decide if there exist two disjoint nonempty subsets $A,B \subseteq S$, whose elements sum up to the same value. The problem is NP-complete. The state-of-the-art algorithm runs in $O^{*}(3^{n/2}) \le O^{*}(1.7321^n)$ time and is based on the meet-in-the-middle ...
Mucha, Marcin +3 more
openaire +12 more sources
A 3-Subset Meet-in-the-Middle Attack: Cryptanalysis of the Lightweight Block Cipher KTANTAN [PDF]
, 2010 status ...
Bogdanov, Andrey, Rechberger, Christian
core +2 more sources
Meet-in-the-Middle Attacks on Reduced-Round Midori64
IACR Transactions on Symmetric Cryptology, 2017 Midori is a lightweight block cipher designed by Banik et al. at ASIACRYPT 2015 to achieve low energy consumption. One version of Midori uses a 64-bit state, another uses a 128-bit state and we denote these versions Midori64 and Midori128.
Li Lin, Wenling Wu
doaj +1 more source
SL2 homomorphic hash functions: Worst case to average case reduction and short collision search [PDF]
, 2015 We study homomorphic hash functions into SL(2,q), the 2x2 matrices with determinant 1 over the field with $q$ elements. Modulo a well supported number theoretic hypothesis, which holds in particular for concrete homomorphisms proposed thus far, we ...
Mullan, Ciaran, Tsaban, Boaz
core +2 more sources
Quantum meet-in-the-middle attack on Feistel construction
Quantum Information Processing, 2023 18 pages, 3 ...
Xu, Yinsong, Yuan, Zheng
openaire +3 more sources
A Hybrid of Dual and Meet-in-the-Middle Attack on Sparse and Ternary Secret LWE
IEEE Access, 2019 The dual attack is one of the most efficient attack algorithms for learning with errors (LWE) problem. Recently, an efficient variant of the dual attack for sparse and small secret LWE was reported by Albrecht (Eurocrypt 2017), which forces some LWE ...
Jung Hee Cheon +3 more
doaj +1 more source
Meeting in the middle: pediatric abdominal wall reconstruction for omphalocele
Pediatric Surgery International, 2022 Abstract PurposeOmphalocele is a congenital abdominal wall defect with an incidence of 1/4,200 births. Repair timing varies from the neonatal period to the first few years of life. Surgical technique has changed over the last two decades. We sought to establish improved surgical/ventilation protocols for patients with omphaloceles requiring ...
Katelyn, Kondra +5 more
openaire +2 more sources
Classical and Quantum Meet-in-the-Middle Nostradamus Attacks on AES-like Hashing
IACR Transactions on Symmetric Cryptology, 2023 At EUROCRYPT 2006, Kelsey and Kohno proposed the so-called chosen target forced-prefix (CTFP) preimage attack, where for any challenge prefix P, the attacker can generate a suffix S such that H(P∥S) = y for some hash value y published in advance by the ...
Zhiyu Zhang +3 more
doaj +1 more source
Meet-in-the-Middle Attacks on Reduced-Round XTEA [PDF]
, 2011 Summary: The block cipher GOST (GOST 28147-89) is a Russian standard for encryption and message authentication that is included in OpenSSL 1.0.0. In this paper, we present meet-in-the-middle attacks on several block ciphers, each consisting of 22 or fewer rounds of GOST.
Sekar, Gautham +3 more
openaire +3 more sources