Black-box analysis of the block-cipher-based hash-function constructions from PGV
Abstract Preneel, Govaerts, and Vandewalle [6] considered the 64 most basic ways to
construct a hash function H:(0, 1)*→(0, 1) n from a block cipher E:(0, 1) n×(0, 10 n→(0, 1) n …
construct a hash function H:(0, 1)*→(0, 1) n from a block cipher E:(0, 1) n×(0, 10 n→(0, 1) n …
Construction of secure and fast hash functions using nonbinary error-correcting codes
This paper considers iterated hash functions. It proposes new constructions of fast and
secure compression functions with nl-bit outputs for integers n> 1 based on error-correcting …
secure compression functions with nl-bit outputs for integers n> 1 based on error-correcting …
Bounds and improvements for BiBa signature schemes
MD Mitzenmacher, A Perrig - 2002 - dash.harvard.edu
This paper analyzes and improves the recently proposed bins and balls signature (BiBa
[23]), a new approach for designing signatures from one-way functions without trapdoors …
[23]), a new approach for designing signatures from one-way functions without trapdoors …
[PDF][PDF] Bounds and Improvements for BiBa Ыignature Ыchemes
M Mitzenmacher, A Perrig, H Univerзity, M Cambridge - eecs.harvard.edu
This paper analyzes and improves the recently proposed bins and balls signature (BiBa
[23]), a new approach for designing signatures from one-way functions without trapdoors …
[23]), a new approach for designing signatures from one-way functions without trapdoors …
Cryptanalysis of Some Hash Functions Based on Block Ciphers and Codes
Abstract At PKC 2000, Inoue and Sakurai proposed some methods to design hash functions
from block ciphers and codes (block codes and convolutional codes). They claimed that their …
from block ciphers and codes (block codes and convolutional codes). They claimed that their …