搜索结果: 1-11 共查到“军队指挥学 Cryptographic hash functions”相关记录11条 . 查询时间(0.125 秒)
Low-Complexity Cryptographic Hash Functions
collision resistant hashing cryptography with low complexity
font style='font-size:12px;'>
2017/2/20
Cryptographic hash functions are efficiently computable functions that shrink a long input into a shorter output while achieving some of the useful security properties of a random function. The most c...
Bad directions in cryptographic hash functions
symmetric cryptography hash functions password hashing
font style='font-size:12px;'>
2016/1/4
A 25-gigabyte “point obfuscation” challenge “using security
parameter 60” was announced at the Crypto 2014 rump session; “point
obfuscation” is another name for password hashing. This paper shows
t...
Cryptographic Hash Functions: Recent Design Trends and Security Notions
Hash Functions Design Compression Function Security Notions Survey
font style='font-size:12px;'>
2012/3/23
Recent years have witnessed an exceptional research interest in cryptographic hash functions, especially after the popular attacks against MD5 and SHA-1 in 2005. In 2007, the U.S. National Institute o...
Black-box property of Cryptographic Hash Functions
cryptographic hash function pseudo-random oracle black-box
font style='font-size:12px;'>
2010/12/14
We define a new black-box property for cryptographic hash function families $H:\{0,1\}^K\times\{0,1\}^*\rightarrow\{0,1\}^y$ which guarantees that for a randomly chosen hash function $H_K$ from the fa...
Combining properties of cryptographic hash functions
cryptographic hash function combiner pseudo-randomness collision resistance
font style='font-size:12px;'>
2010/10/20
A ``strong'' cryptographic hash function suitable for practical applications should simultaneously satisfy many security properties, like pseudo-randomness, collision resistance and unforgeability. Th...
Properties of Cryptographic Hash Functions
cryptographic hash function provable security properties of hash functions
font style='font-size:12px;'>
2009/6/11
This paper extends the work of Rogaway and Shrimpton [6], where they
formalized seven security properties: notions of preimage resistance (Pre, aPre, ePre),
second-preimage resistance (Sec, aSec, eS...
On a Probabilistic Appproach to the Security Analysis of Cryptographic Hash Functions
Hash functions Brute force attacks resistance
font style='font-size:12px;'>
2009/4/2
In this paper we focus on the three basic security requirements for
a cryptographic hash function, commonly referred as preimage, second
preimage and collision resistance. We examine these security ...
Dynamic Cryptographic Hash Functions
Hash function dynamic hash function security parameter
font style='font-size:12px;'>
2009/1/8
We present the dynamic cryptographic hash function, a new
type of hash function which takes two parameters instead of one. The
additional parameter, the security parameter, specifies the internal wo...
Cryptographic hash functions from expander graphs
Cryptographic hash functions expander graphs
font style='font-size:12px;'>
2008/10/22
We propose constructing provable collision resistant hash
functions from expander graphs. As examples, we investigate two specific
families of optimal expander graphs for provable hash function cons...
Edon--${\cal R}(256,384,512)$ -- an Efficient Implementation of Edon--${\cal R}$ Family of Cryptographic Hash Functions
hash function Edon-R quasigroup
font style='font-size:12px;'>
2008/9/1
We have designed three fast implementations of recently proposed family of hash func-
tions Edon{R. They produce message digests of length 256, 384 and 512 bits. We have de¯ned huge quasigroups ...
Cryptanalysis of a class of cryptographic hash functions
XOR-linear/additive checksums 3C GOST multi-block collision
font style='font-size:12px;'>
2008/8/15
We apply new cryptanalytical techniques to perform the generic multi-block multicollision,second preimage and herding attacks on the Damgard-Merkle hash functions with linear-XOR/additive checksums. T...