Limits on the efficiency of one-way permutation-based hash functions

DOI10.1109/SFFCS.1999.814627MaRDI QIDQ7238320zbMATH OpenFDO

Authors Jeong Han Kim, Daniel Simon, Prasad Tetali

Publication date 6 May 2026

Full work available at URL https://doi.org/10.1109/SFFCS.1999.814627

Mathematics Subject Classification ID

Graph theory (05Cxx) Data structures (68P05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Formal languages and automata (68Q45) Discrete mathematics in relation to computer science (68Rxx) Nonnumerical algorithms (68W05) Quantum computation (81P68)

Cited in

(1)

• On the efficiency of generic, quantum cryptographic constructions

This page was built for publication: Limits on the efficiency of one-way permutation-based hash functions

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