Results 51 to 60 of about 131,000 (194)
Near Collision Side Channel Attacks [PDF]
, 2016 Side channel collision attacks are a powerful method to exploit side channel leakage. Otherwise than a few exceptions, collision attacks usually combine leakage from distinct points in time, making them inherently bivariate. This work introduces the notion of near collisions to exploit the fact that values depending on the same sub-key can have similar
Lejla Batina +2 more
openaire +2 more sources
A Meaningful MD5 Hash Collision Attack [PDF]
, 2006 It is now proved by Wang et al., that MD5 hash is no more secure, after they proposed an attack that would generate two different messages that gives the same MD5 sum. Many conditions need to be satisfied to attain this collision.
Kashyap, Narayana D.
core +1 more source
A Practical Collision-Based Power Analysis on RSA Prime Generation and Its Countermeasure
IEEE Access, 2019 We analyze the security of RSA prime generation implemented on embedded devices by a practical power analysis attack. Unlike previous differential power analysis-based attack on primality tests of RSA prime generation exploiting the deterministic ...
Sangyub Lee +3 more
doaj +1 more source
IEEE Access, 2020 Advanced collision-based single trace attacks which can be applied on simple power analysis resistant scalar multiplications become virtual threat on elliptic curve cryptosystems recently as their practical experimental results are increasingly reported ...
Sangyub Lee +3 more
doaj +1 more source
Analysis of DoS Attacks at MAC Layer in Mobile Adhoc Networks [PDF]
, 2015 —Wireless network security has received tremendous attention due to the vulnerabilities exposed in the open communication medium. The most common wireless Medium Access Control (MAC) protocol is IEEE 802.11, which assumes all the nodes in the network are
Alocious, Chaminda +2 more
core +2 more sources
Chosen-Prefix Collisions on AES-like Hashing
IACR Transactions on Symmetric CryptologyChosen-prefix collision (CPC) attack was first presented by Stevens, Lenstra and de Weger on MD5 at Eurocrypt 2007. A CPC attack finds a collision for any two chosen prefixes, which is a stronger variant of collision attack. CPCs are naturally harder to
Shiyao Chen +3 more
doaj +1 more source
Preimage and pseudo-collision attacks on 29-step SM3 hash function with padding
Tongxin xuebao, 2014 The security of SM3 hash function was revaluated by using the meet-in-the-middle attack. The preimage and pseudo-collision attack on 29-step SM3 hash function (from the 1-st step) with padding was presented.
Gao-li WANG, Yan-zhao SHEN
doaj +2 more sources
IACR Transactions on Symmetric Cryptology, 2016 In this paper, we describe attacks on the recently proposed Haraka hash functions. First, for the two hash functions Haraka-256/256 and Haraka-512/256 in the family, we show how two colliding messages can be constructed in about 216 function ...
Jérémy Jean
doaj +1 more source
Improvement on a Masked White-Box Cryptographic Implementation
IEEE Access, 2020 White-box cryptography is a software technique to protect secret keys of cryptographic algorithms from attackers who have access to memory. By adapting techniques of differential power analysis to computation traces consisting of runtime information ...
Seungkwang Lee, Myungchul Kim
doaj +1 more source
Navigating in the Cayley graph of $SL_2(F_p)$ and applications to hashing [PDF]
, 2014 Cayley hash functions are based on a simple idea of using a pair of (semi)group elements, $A$ and $B$, to hash the 0 and 1 bit, respectively, and then to hash an arbitrary bit string in the natural way, by using multiplication of elements in the (semi ...
Bromberg, Lisa +2 more
core +1 more source