نتایج جستجو برای: one way hash function

تعداد نتایج: 3241299  

2000
Yu-Lun Huang Shiuh-Pyng Shieh Jian-Chyuan Wang

This paper presents three key distribution schemes for channel protection. With the proposed schemes, encryption keys of the ordered programs can be distributed to the authorized subscribers efficiently and securely. In these schemes, for key updates, at most two messages are transmitted and simpler computation functions, including one-way hash function and XOR operation, are used to reduce the...

Journal: :IACR Cryptology ePrint Archive 2014
Jian Guo Jérémy Jean Gaëtan Leurent Thomas Peyrin Lei Wang

Streebog is a new Russian hash function standard. It follows the HAIFA framework as domain extension algorithm and claims to resist recent generic second-preimage attacks with long messages. However, we demonstrate in this article that the specific instantiation of the HAIFA framework used in Streebog makes it weak against such attacks. More precisely, we observe that Streebog makes a rather po...

Journal: :Computer Communications 2008
Min-Shiang Hwang Cheng-Chi Lee Song-Kong Chong

This paper proposes an improved address ownership scheme in Mobile IPv6 (MIPv6). The authors combine the idea of lossless compression with one-way hash function, and present an improved method to protect the binding update in MIPv6 against redirect attacks. Crown copyright 2008 Published by Elsevier B.V. All rights reserved.

2007
Florian Mendel Vincent Rijmen

HAS-V is a cryptographic hash function which processes 1024-bit message blocks and produces a hash value of variable length. The design of the hash function is based on design principles of the MD4 family. Recently, weaknesses have been shown in members of this family. Therefore, the analysis of the HAS-V hash function is of great interest. To the best of our knowledge this is the first article...

Journal: :IACR Cryptology ePrint Archive 2013
Jian Guo Pierre Karpman Ivica Nikolic Lei Wang Shuang Wu

We present a thorough security analysis of the hash function family BLAKE2, a recently proposed and already in use tweaked version of the SHA-3 finalist BLAKE. We study how existing attacks on BLAKE apply to BLAKE2 and to what extent the modifications impact the attacks. We design and run two improved searches for (impossible) differential attacks — the outcomes suggest higher number of attacke...

Journal: :IACR Cryptology ePrint Archive 2008
Søren S. Thomsen

This paper describes an improved preimage attack on the cryptographic hash function MD2. The attack has complexity equivalent to about 2 evaluations of the MD2 compression function. This is to be compared with the previous best known preimage attack, which has complexity about 2.

2004
Wouter Teepe

This paper introduces and describes new protocols for proving knowledge of secrets without giving them away: if the verifier does not know the secret, he does not learn it. Three role configurations exist for this type of protocols: (1) the prover may want to pro-actively prove knowledge of a secret, (2) a verifier may ask someone to prove knowledge of a secret, or (3) two players may mutually ...

1990
Yuliang Zheng Tsutomu Matsumoto Hideki Imai

We study the following two kinds of one-way hash functions: universal oneway hash functions (UOHs) and collision intractable hash functions (CIHs). The main property of the former is that given an initial-string x, it is computationally difficult to find a different string y that collides with x. And the main property of the latter is that it is computationally difficult to find a pair x 6= y o...

2004
Dirk Henrici Paul Müller

This paper introduces shortly into the security and privacy issues of RFID systems and presents a simple approach to greatly enhance location privacy by changing traceable identifiers securely on every read attempt. The scheme gets by with only a single, unreliable message exchange. By employing one-way hash functions the scheme is safe from many security threats. It is intended for use in item...

2004
Deukjo Hong Bart Preneel Sangjin Lee

Universal One-Way Hash Functions (UOWHFs) are families of cryptographic hash functions for which first a target input is chosen and subsequently a key which selects a member from the family. Their main security property is that it should be hard to find a second input that collides with the target input. This paper generalizes the concept of UOWHFs to UOWHFs of order r. We demonstrate that it i...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید