Results 21 to 30 of about 131,000 (194)
Autonomous collision attack on OCSP services
, 2016 16 pages, 4 ...
Ken Ivanov
openalex +4 more sources
Cache-Collision Timing Attacks Against AES
, 2006 This paper describes several novel timing attacks against the common table-driven software implementation of the AES cipher. We define a general attack strategy using a simplified model of the cache to predict timing variation due to cache-collisions in the sequence of lookups performed by the encryption.
Joseph Bonneau, Ilya Mironov
openalex +3 more sources
New hash function based on C-MD structure and chaotic neural network
网络与信息安全学报, 2023 In recent years, widely used hash algorithms such as MD5 and SHA-1 have been found to have varying degrees of security risks.The iterative structure of the SHA-2 algorithm is similar to that of SHA-1, making it vulnerable to attacks as well.Meanwhile ...
Liquan CHEN +4 more
doaj +3 more sources
Revisit two memoryless state‐recovery cryptanalysis methods on A5/1
IET Information Security, 2023 At ASIACRYPT 2019, Zhang proposed a near collision attack on A5/1 claiming to recover the 64‐bit A5/1 state with a time complexity around 232 cipher ticks with negligible memory requirements.
Yanbin Xu, Yonglin Hao, Mingxing Wang
doaj +1 more source
Finding Collisions against 4-Round SHA-3-384 in Practical Time
IACR Transactions on Symmetric Cryptology, 2022 The Keccak sponge function family, designed by Bertoni et al. in 2007, was selected by the U.S. National Institute of Standards and Technology (NIST) in 2012 as the next generation of Secure Hash Algorithm (SHA-3).
Senyang Huang +3 more
doaj +1 more source
IACR Transactions on Symmetric Cryptology, 2020 Fast Near collision attacks on the stream ciphers Grain v1 and A5/1 were presented at Eurocrypt 2018 and Asiacrypt 2019 respectively. They use the fact that the entire internal state can be split into two parts so that the second part can be recovered from the first one which can be found using the keystream prefix and some guesses of the key materials.
Pierre-Alain Fouque +2 more
openaire +6 more sources
Transactions on Cryptographic Hardware and Embedded Systems, 2021 In this paper, we propose a novel key recovery attack against secure ECDSA signature generation employing regular table-based scalar multiplication.
Sunghyun Jin +4 more
doaj +1 more source
Collision Based Attacks in Practice [PDF]
2015 Euromicro Conference on Digital System Design, 2015 Chosen-Message Simple Power Analysis, also called Collision Based Attacks (CBA), have been proposed by Fouque, Yen and Homma. These attacks aim at inducing and detecting collisions during modular operations. However, detecting collisions is a challenging task in real environments. Doing it in an automated manner is even more challenging. In this paper,
Diop, Ibrahima +3 more
openaire +3 more sources
Optimal Collision Side-Channel Attacks [PDF]
, 2020 Collision side-channel attacks are effective attacks against cryptographic implementations, however, optimality and efficiency of collision side-channel attacks is an open question. In this paper, we show that collision side-channel attacks can be derived using maximum likelihood principle when the distribution of the values of the leakage function is ...
Vincent Grosso, Cezary Glowacz
openaire +2 more sources
Asymmetric Leakage from Multiplier and Collision-Based Single-Shot Side-Channel Attack [PDF]
, 2016 The single-shot collision attack on RSA proposed by Hanley et al. is studied focusing on the difference between two operands of multiplier. It is shown that how leakage from integer multiplier and long-integer multiplication algorithm can be asymmetric ...
Daisuke SUZUKI +2 more
core +2 more sources