Results 141 to 150 of about 442,051 (179)

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

Some of the next articles are maybe not open access.

Related searches:

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

Lecture Notes in Computer Science, 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
Siwei Sun, Xiaoyun Wang
exaly   +3 more sources

Improved (Pseudo) Preimage Attack and Second Preimage Attack on Round-Reduced Grøstl. [PDF]

IACR Cryptol. ePrint Arch., 2012
Grøstl is one of the five finalists in the third round of SHA-3 competition hosted by NIST. In this paper, we use many techniques to improve the pseudo preimage attack on Grøstl hash function, such as subspace preimage attack and guess-and-determine ...
Jian Zou 0002, Wenling Wu, Shuang Wu 0004, Le Dong   +3 more
core   +3 more sources

Preimage Attack on ARIRANG. [PDF]

IACR Cryptol. ePrint Arch., 2009
The hash function ARIRANG is one of the 1st round SHA-3 candidates. In this paper, we present preimage attacks on ARIRANG with step-reduced compression functions. We consider two step-reduced variants of the compression function.
Deukjo Hong, Woo-Hwan Kim, Bonwook Koo
core   +3 more sources

An improved preimage attack on MD2. [PDF]

IACR Cryptol. ePrint Arch., 2008
This paper describes an improved preimage attack on the cryptographic hash function MD2. The attack has complexity equivalent to about $2^{73}$ evaluations of the MD2 compression function.
Søren S. Thomsen
core   +3 more sources

Functional Graph Revisited: Updates on (Second) Preimage Attacks on Hash Combiners [PDF]

Lecture Notes in Computer Science, 2017
This paper studies functional-graph-based (second) preimage attacks against hash combiners. By exploiting more properties of cyclic nodes of functional graph, we find an improved preimage attack against the XOR combiner with a complexity of $2^{5n/8 ...
Jian Guo, Dawu Gu, Zhenzhen Bao
exaly   +2 more sources

Preimage Attacks on Reduced DHA-256. [PDF]

IACR Cryptol. ePrint Arch., 2009
DHA-256 (Double Hash Algorithm) was proposed at the Cryptographic Hash Workshop hosted by NIST in November 2005. DHA-256 is a dedicated hash function with output length of 256 bits and 64 steps of operations designed to enhance SHA-256 security.
Jinmin Zhong, Xuejia Lai
core   +4 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   +4 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