A provably secure non-iterative hash function resisting birthday attack (Q344781): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 94A60 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 94A62 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6655875 / rank
 
Normal rank
Property / zbMATH Keywords
 
hash function
Property / zbMATH Keywords: hash function / rank
 
Normal rank
Property / zbMATH Keywords
 
compression algorithm
Property / zbMATH Keywords: compression algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
non-iterative structure
Property / zbMATH Keywords: non-iterative structure / rank
 
Normal rank
Property / zbMATH Keywords
 
provable security
Property / zbMATH Keywords: provable security / rank
 
Normal rank
Property / zbMATH Keywords
 
birthday attack
Property / zbMATH Keywords: birthday attack / rank
 
Normal rank
Property / zbMATH Keywords
 
meet-in-the-middle attack
Property / zbMATH Keywords: meet-in-the-middle attack / rank
 
Normal rank

Revision as of 08:02, 28 June 2023

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
    0 references
    0 references
    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

    Identifiers