Improved cryptographic hash functions with worst-case/average-case connection

DOI10.1145/509907.509995MaRDI QIDQ3579190zbMATH OpenOpenAlexFDO

Authors Daniele Micciancio

Publication date 5 August 2010

Published in Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/509907.509995

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Cited in

(3)

• Quantum algorithms for variants of average-case lattice problems via filtering
• New transference theorems on lattices possessing \(n^\varepsilon\)-unique shortest vectors
• \textsf{FrodoKEM}: a CCA-secure learning with errors key encapsulation mechanism

This page was built for publication: Improved cryptographic hash functions with worst-case/average-case connection

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