搜索结果: 1-8 共查到“密码学 birthday attack”相关记录8条 . 查询时间(0.228 秒)
Birthday Attack on Dual EWCDM
secret-key cryptography EWCDM
font style='font-size:12px;'>
2017/6/22
In CRYPTO 2017, Mennink and Neves showed almost n-bit security for a dual version of EWCDM. In this paper we describe a birthday attack on this construction which violates their claim.
A Lightweight Hash Function Resisting Birthday Attack and Meet-in-the-middle Attack
Lightweight hash function Compression algorithm
font style='font-size:12px;'>
2014/3/12
In this paper, to match a lightweight digital signing scheme of which the length of modulus is between 80 and 160 bits, a lightweight hash function called JUNA is proposed. It is based on the intracta...
Improved Generalized Birthday Attack
Generalized Birthday Attack Linearization Information-Set Decoding
font style='font-size:12px;'>
2011/7/25
Let r, B and w be positive integers. Let C be a linear code of length Bw and subspace of Fr .
Improved Generalized Birthday Attack
Generalized Birthday Attack Linearization Information-Set Decoding Wagner Low memory requirement SWIFFT FSB LPN
font style='font-size:12px;'>
2012/3/27
Let r, B and w be positive integers. Let C be a linear code of length Bw and subspace of Fr . The k-regular-decoding problem is to find 2 a nonzero codeword consisting of w length-B blocks with Hammin...
FSBday:Implementing Wagner’s generalized birthday attack against the SHA-3 candidate FSB
SHA-3 Birthday FSB – Wagner
font style='font-size:12px;'>
2009/6/23
The hash function FSB is one of the candidates submitted
to NIST’s competition to find the new standard hash function, SHA-3.
The compression function of FSB is based on error correcting codes. In
...
How to Launch A Birthday Attack Against DES
DES Differential cryptanalysis Linear cryptanalysis
font style='font-size:12px;'>
2009/6/5
We present a birthday attack against DES. It is entirely based on the relationship
Li+1 = Ri and the simple key schedule in DES. It requires about 216 ciphertexts of the same
R16, encrypted by the s...
Bounds on Birthday Attack Times
Birthday attack hash function
font style='font-size:12px;'>
2009/3/4
We analyze a generic birthday attack where distinct inputs to some function f are
selected until two of the inputs map through f to the same output, meaning that the attack has
succeeded. We give ti...
General Distinguishing Attacks on NMAC and HMAC with Birthday Attack Complexity
NMAC HMAC Distinguishing Attack Birthday Attack
font style='font-size:12px;'>
2009/1/5
Kim et al. [4] and Contini et al. [3] studied on the security of
HMAC and NMAC based on HAVAL, MD4, MD5, SHA-0 and SHA-1.
Especially, they considered the distinguishing attacks. However, they did
n...