Results 211 to 220 of about 11,539 (251)
The intrinsic preference of guanosine bases for cleavage-facilitating interactions with phosphodiester moieties in RNA anions revealed by base modifications and mass spectrometry. [PDF]
Nucleic Acids ResPloner A +5 more
europepmc +1 more source
A novel deep learning approach for intrusion detection in maritime radar networks. [PDF]
Sci RepShakil MMN +3 more
europepmc +1 more source
Single solvent molecule effect over S<sub>N</sub>2 and E2 competition in the hydroperoxide anion reaction with ethyl-iodide. [PDF]
Chem SciWu X, Zhu C, Francisco JS, Xie J.
europepmc +1 more source
Biologically inspired warning patterns deter a passerine, <i>Parus major</i>, from digital turbine blades. [PDF]
Behav EcolHancock GRA +6 more
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, Zhu Wang, Degang Sun
exaly +2 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, Zhu Wang, Degang Sun
exaly +2 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 +2 more sources
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 +2 more sources
Improved Collision Attacks on MD4 and MD5
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2007At 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.
Yu Sasaki 0001 +3 more
openaire +1 more source
An Improved Collision Attack on MD5 Algorithm
2008The research on the attack algorithm for a MD5 collision is one of the focuses in cryptology nowadays. In this paper, by analyzing the properties of the nonlinear Boolean functions used in MD5 and the differences in term of XOR and subtraction modulo 232, we prove that some sufficient conditions presented by Jie Liang and Xuejia Lai are also necessary ...
Shiwei Chen, Chenhui Jin
openaire +1 more source
Meet-in-the-Middle Attacks Revisited: Key-Recovery, Collision, and Preimage Attacks
2021At 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 0001 +5 more
openaire +1 more source