Results 121 to 130 of about 234 (160)

Generative AI in Medical Practice: In-Depth Exploration of Privacy and Security Challenges. [PDF]

J Med Internet Res
Chen Y, Esmaeilzadeh P.
europepmc   +1 more source

An efficient blockchain-based authentication scheme with transferability. [PDF]

PLoS One
Jin X, Omote K.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Preimage Attack on the Parallel FFT-Hashing Function

2007
The parallel FFT-Hashing function was designed by C. P. Schnorr and S. Vaudenay in 1993. The function is a simple and light weight hash algorithm with 128-bit digest. Its basic component is a multipermutation which helps in proving its resistance to collision attacks.
Lee Sangjin, Hong Seokhie, Sung JAECHUL   +2 more
exaly   +2 more sources

Construction of the Initial Structure for Preimage Attack of MD5

2009 International Conference on Computational Intelligence and Security, 2009
The construction of the initial structure for preimage attack of MD5 is proposed in this paper. With the help of “divide-and-rule” technique, the successful possibility of the construction is higher than 2-32 . Our construction is based on the MD5 structure, the message modification technique which is improved from Wang’ s. Some related techniques such
Ming Mao, Shaohui Chen, Jin Xu
exaly   +2 more sources

A Preimage Attack on Reduced Gimli-Hash

Lecture Notes in Computer Science, 2022
Seokhie Hong, Donghoon Chang, Chang Donghoon   +2 more
exaly   +2 more sources

Preimage Attack on Hash Function RIPEMD

Journal of Computer Science and Technology, 2009
RIPEMD is a cryptographic hash function devised in the framework of the RIPE project (RACE Integrity Primitives Evaluation, 1988-1992). It consists of two parallel lines, and each line is identical to MD4 except for some internal constants. It has been broken by the collision attack, but no preimage attack was given.
Gaoli Wang, Shaohui Wang
openaire   +3 more sources

Inverse operation and preimage attack on BioHashing

2009 IEEE Workshop on Computational Intelligence in Biometrics: Theory, Algorithms, and Applications, 2009
BioHashing generates a BioCode from a user's biometric features by projecting them onto user-specific random vectors and then discritizes the projection coefficients into zero or one. Since biometric features are distorted by the non-invertible transforms and template matching is performed in a transformed state, it has been claimed that BioHashing is ...
Yongjin Lee, Yunsu Chung, Kiyoung Moon
openaire   +1 more source

Preimage Attacks on Step-Reduced MD5

2008
In this paper, we propose preimage attacks on step-reduced MD5. We show that a preimage of a 44-step MD5 can be computed to a complexity of 296. We also consider a preimage attack against variants of MD5 where the round order is modified from the real MD5.
Yu Sasaki 0001, Kazumaro Aoki
openaire   +1 more source