Clocked adversaries for hashing

DOI10.1007/BF01190898MaRDI QIDQ1209734zbMATH OpenOpenAlexWikidataFDO

Authors Jeffrey F. Naughton, Richard J. Lipton

Publication date 16 May 1993

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01190898

zbMATH Keywords

adversary techniquesclocked adversarieshashingPRAM model

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• scientific article; zbMATH DE number 1950613
• scientific article; zbMATH DE number 1088941
• Timing Attacks on NTRUEncrypt Via Variation in the Number of Hash Calls
• scientific article; zbMATH DE number 1804022
• Multicollision attacks and generalized iterated hash functions
• Cryptography and Coding
• The circulant hash revisited

Cites work

• Dynamic Perfect Hashing: Upper and Lower Bounds
• How to emulate shared memory
• How to share memory in a distributed system
• Parallel hashing
• Universal classes of hash functions

Cited in

(4)

• Perfect hashing
• Fast rehashing in PRAM emulations
• Succinct filters for sets of unknown sizes
• Are your keys protected? Time will tell

This page was built for publication: Clocked adversaries for hashing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1209734)