Results 291 to 300 of about 1,691,785 (320)
Some of the next articles are maybe not open access.

Related-Key Collision Attack of AES_256

2010 International Symposium on Intelligence Information Processing and Trusted Computing, 2010
This paper utilized the arrangement points of AES_256 key, analyzed the difference features of AES_256, and found a method of collision attack. This paper also made use of connection differential features and collision method of AES_256 to analyze the 72 bytes of the initial key of AES_256, with a complexity of 2128.
Zhihua Hu, Zhongping Qin
openaire   +1 more source

A New Collision Attack on MD5

2009 International Conference on Networks Security, Wireless Communications and Trusted Computing, 2009
In 2005, collision resistance of several hash functions was broken by Wang et al. The strategy of determining message differential is the most important part of collision attacks against hash functions. So far, there are only three other message differentials attack published, one of which is 6 bits difference and two are 1 bit difference.
Wang Yu, Chen Jianhua, He Debiao
openaire   +1 more source

Fault Based Collision Attacks on AES

2006
In this paper we present a new class of collision attacks that are based on inducing faults into the encryption process. We combine the classical fault attack of Biham and Shamir with the concept of collision attacks of Schramm et al. Unlike previous fault attacks by Blomer and Seifert our new attacks only need bit flips not bit resets.
Johannes Blömer, Volker Krummel
openaire   +1 more source

Collision attack on NaSHA-384/512

2010 International Conference on Networking and Information Technology, 2010
NaSHA is a family of hash functions submitted by Markovski and Mileva, it is accepted as one of the first SHA-3 round candidates. In this paper, we present a collision attack on NaSHA for the output sizes 384-bit and 512-bit. This attack is based on the the weakness in the generate course of the state words, and the fact that the quasigroup operation ...
null Zhimin Li   +2 more
openaire   +1 more source

MitM Attack by Name Collision: Cause Analysis and Vulnerability Assessment in the New gTLD Era

IEEE Symposium on Security and Privacy, 2016
Recently, Man in the Middle (MitM) attacks on web browsing have become easier than they have ever been before because of a problem called "Name Collision" and a protocol called the Web Proxy Auto-Discovery (WPAD) protocol.
Qi Alfred Chen   +3 more
semanticscholar   +1 more source

Collision-Free Distributed Adaptive Resilient Formation Control for Underactuated USVs Subject to Intermittent Actuator Faults and Denial-of-Service Attacks

IEEE Transactions on Vehicular Technology
This paper investigates a collision-free distributed fuzzy adaptive resilient formation control scheme for underactuated unmanned surface vehicles (USVs) with unknown nonlinear dynamics under intermittent actuator faults and denial-of-service (DoS ...
Xiangjun Wu   +4 more
semanticscholar   +1 more source

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
openaire   +1 more source

Plaintext Recovery Attacks Against XTS Beyond Collisions

2020
\(\mathsf {XTS}\) is a popular encryption scheme for storage devices standardized by IEEE and NIST. It is based on Rogaway’s \(\mathsf {XEX}\) tweakable block cipher and is known to be secure up to the collisions between the blocks, thus up to around \(2^{n/2}\) blocks for n-bit blocks.
Takanori Isobe, Kazuhiko Minematsu
openaire   +1 more source

Restricted near collision attack on Plantlet

Journal of Cryptographic Engineering, 2023
Satyam Kumar   +5 more
openaire   +1 more source

Algebraic Methods in Side-Channel Collision Attacks and Practical Collision Detection

2008
This paper presents algebraic collision attacks, a new powerful cryptanalytic method based on side-channel leakage which allows for low measurement counts needed for a successful key recovery in case of AES. As opposed to many other side-channel attacks, these techniques are essentially based on the internal structure of the attacked cryptographic ...
Andrey Bogdanov   +2 more
openaire   +1 more source

Home - About - Disclaimer - Privacy