Provably Secure Double-Block-Length Hash Functions in a Black-Box Model
スポンサーリンク
概要
- 論文の詳細を見る
In CRYPTO'89, Merkle presented three double-block-lengthhash functions based on DES. They are optimally collision resistant ina black-box model, that is, the time complexity of any collision-findingalgorithm for them is Ω(2^<l/2>) if DES is a random block cipher, wherel is the output length. Their drawback is that their rates are low. Inthis article, new double-block-length hash functions with higher ratesare presented which are also optimally collision resistant in the blackboxmodel. They are composed of block ciphers whose key length is twicelarger than their block length.
- Springer Verlagの論文
Springer Verlag | 論文
- Nitrous oxide in brackish Lakes Shinji and Nakaumi, Japan
- A pretreatment method for the determination of nitrate in brackish water and seawater based on the hydrazinium reduction technique
- Urea decomposing activity of fractionated brackish phytoplankton in Lake Nakaumi
- Liver steatosis, but not fibrosis, is associated with insulin resistance in nonalcoholic fatty liver disease
- Arsenic accumulation in rice (Oryza sativa L.) varieties of Bangladesh: A glass house study