A provably secure non-iterative hash function resisting birthday attack (Q344781)
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: A provably secure non-iterative hash function resisting birthday attack |
scientific article; zbMATH DE number 6655875
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A provably secure non-iterative hash function resisting birthday attack |
scientific article; zbMATH DE number 6655875 |
Statements
A provably secure non-iterative hash function resisting birthday attack (English)
0 references
24 November 2016
0 references
hash function
0 references
compression algorithm
0 references
non-iterative structure
0 references
provable security
0 references
birthday attack
0 references
meet-in-the-middle attack
0 references
0.8941304683685303
0 references
0.725212812423706
0 references
