VSH, an Efficient and Provable Collision-Resistant Hash Function (Q3593095)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: VSH, an Efficient and Provable Collision-Resistant Hash Function |
scientific article; zbMATH DE number 5194979
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | VSH, an Efficient and Provable Collision-Resistant Hash Function |
scientific article; zbMATH DE number 5194979 |
Statements
VSH, an Efficient and Provable Collision-Resistant Hash Function (English)
0 references
24 September 2007
0 references
hashing
0 references
provable reducibility
0 references
integer factoring
0 references
0.928425669670105
0 references
0.8729751110076904
0 references
0.8725488185882568
0 references
0.8687538504600525
0 references
