Results 241 to 250 of about 136,963 (275)
Post-Quantum Revocable Linkable Ring Signature Scheme Based on SPHINCS+ for V2G Scenarios. [PDF]
Sensors (Basel)Liu S, Du YN, Wang XA, Hu X, Su HE.
europepmc +1 more source
From Concrete to Code: A Survey of AI-Driven Transportation Infrastructure, Security, and Human Interaction. [PDF]
Sensors (Basel)Kose NA, Kose K, Liang F.
europepmc +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 +3 more sources
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 +3 more sources
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
Collision attack on NaSHA-384/512
2010 International Conference on Networking and Information Technology, 2010NaSHA 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