Results 251 to 260 of about 11,604 (291)
A hybrid deep learning and residual connection-based architecture for intrusion detection in autonomous vehicles. [PDF]
PLoS OneKibriya H +5 more
europepmc +1 more source
Time-Efficient Cooperative Attack Strategy Considering Collision Avoidance for Missile Swarm
Yixin Hu, Yun Xu, Zhaohui Dang
openalex +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
IEEE Transactions on Information Forensics and Security, 2019
Key enumeration schemes are used to post-process the scores given by side channel distinguishers and enumerate the key candidates from the most possible one to the least possible one, which can be regarded as optimal tools of key search. However, the application of them is limited by very large key candidate space and computing power consumption.
Changhai Ou +3 more
openaire +1 more source
Key enumeration schemes are used to post-process the scores given by side channel distinguishers and enumerate the key candidates from the most possible one to the least possible one, which can be regarded as optimal tools of key search. However, the application of them is limited by very large key candidate space and computing power consumption.
Changhai Ou +3 more
openaire +1 more source
Journal of Cryptology, 2014
Hash functions have been among the most scrutinized cryptographic primitives in the previous decade, mainly due to the cryptanalysis breakthroughs on MD-SHAfamily and the NIST SHA-3 competition that followed. Grindahl is a hash function proposed at FSE 2007 that inspired several SHA-3 candidates.
openaire +1 more source
Hash functions have been among the most scrutinized cryptographic primitives in the previous decade, mainly due to the cryptanalysis breakthroughs on MD-SHAfamily and the NIST SHA-3 competition that followed. Grindahl is a hash function proposed at FSE 2007 that inspired several SHA-3 candidates.
openaire +1 more source
Related-Key Collision Attack of AES_256
2010 International Symposium on Intelligence Information Processing and Trusted Computing, 2010This 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
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
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
2006In 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