A provably secure non-iterative hash function resisting birthday attack (Q344781): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 03:40, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A provably secure non-iterative hash function resisting birthday attack |
scientific article |
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