Results 291 to 300 of about 1,678,458 (327)

Traffic Collision Avoidance System: Threat Actor Model and Attack Taxonomy

2020 New Trends in Civil Aviation (NTCA), 2020
As air travel increases across the globe, the opportunities for exploiting air communications increase as well. In modern aviation technology, the Traffic Collision Avoidance System (TCAS) is used to deter mid-air collisions between aircraft.
John Hannah, R. Mills, Richard Dill
semanticscholar   +1 more source

SHA-256 Collision Attack with Programmatic SAT

PAAR+SC²@IJCAR
Cryptographic hash functions play a crucial role in ensuring data security, generating fixed-length hashes from variable-length inputs. The hash function SHA-256 is trusted for data security due to its resilience after over twenty years of intense ...
Nahiyan Alamgir, Saeed Nejati, Curtis Bright   +2 more
semanticscholar   +1 more source

How to Launch a Powerful Side-Channel Collision Attack?

IEEE transactions on computers
A cryptographic implementation produces very similar power leakages when fed with the same input. Side-channel collision attacks exploit these similarities to establish the relationship between sub-keys and improve the efficiency of key recovery ...
Jiangshan Long, Changhai Ou, Yajun Ma, Yifan Fan, Hua Chen, Shihui Zheng   +5 more
semanticscholar   +1 more source

Improved Collision Attacks on MD4 and MD5

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2007
At Eurocrypt'05, Wang et al. presented efficient collision attacks on MD5 and MD4 hash functions. They found a collision of MD5 with a complexity of less than 237 MD5 hash operations, and a collision of MD4 with complexity less than 28 MD4 hash operations. In their attack, the procedure to generate a collision is divided into 4 steps.
Y. SASAKI, Y. NAITO, N. KUNIHIRO, K. OHTA   +3 more
openaire   +1 more source

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

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, E. Osterweil, Matthew Thomas, Z. Morley Mao   +3 more
semanticscholar   +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

Meet-in-the-Middle Attacks Revisited: Key-Recovery, Collision, and Preimage Attacks

2021
At EUROCRYPT 2021, Bao et al. proposed an automatic method for systematically exploring the configuration space of meet-in-the-middle (MITM) preimage attacks. We further extend it into a constraint-based framework for finding exploitable MITM characteristics in the context of key-recovery and collision attacks by taking the subtle peculiarities of both
Xiaoyang Dong, Jialiang Hua, Siwei Sun, Zheng Li, Xiaoyun Wang, Lei Hu   +5 more
openaire   +1 more source

Near Collision Attack Against Grain V1

International Conference on Applied Cryptography and Network Security, 2023
S. Banik, Daniel Collins, W. Meier
semanticscholar   +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, null Hongan Jian, null Cunhua Li   +2 more
openaire   +1 more source