Pages that link to "Item:Q2708246"
From MaRDI portal
The following pages link to A new practical algorithm for the construction of a perfect hash function (Q2708246):
Displaying 12 items.
- A class of hash functions based on the Algebraic Eraser\(^{\text{TM}}\) (Q285901) (← links)
- A compact hash function for paths in PERT networks (Q797503) (← links)
- A backtracking method for constructing perfect hash functions from a set of mapping functions (Q1059411) (← links)
- An algebraic approach to Cichelli's perfect hashing (Q1825632) (← links)
- A sequence approach to linear perfect hash families (Q2384060) (← links)
- Construct a perfect word hash function in time independent of the size of integers (Q2404612) (← links)
- Geometric constructions of optimal linear perfect hash families (Q2469464) (← links)
- A new dynamic programming algorithm for the simplified partial digest problem (Q2697542) (← links)
- A new multivariate hash algorithm based on an improved Merkle-Damgård construction (Q2886873) (← links)
- New Constructions for Secure Hash Functions (Q4639447) (← links)
- Construction of secure and fast hash functions using nonbinary error-correcting codes (Q4677572) (← links)
- Merkle-Damgård Revisited: How to Construct a Hash Function (Q5451041) (← links)