A provably secure non-iterative hash function resisting birthday attack (Q344781): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q120900609, #quickstatements; #temporary_batch_1714830594367 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q120900609 / rank | |||
Normal rank | |||
Revision as of 15:51, 4 May 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
