Hardness Assumptions
Hardness Assumptions is a foundational premise in computational complexity theory that posits the intractability of specific mathematical problems over lattices, distinguishing it from other cryptographic assumptions by its reliance on worst-case or average-case hardness of lattice problems such as Learning With Errors or Shortest Vector Problem.
122
Publications
8.8K
Citations
263
Authors
156
Institutions
Publications per year
2017–2026
41
Parents
122
CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM
Joppe W. Bos, Léo Ducas, Eike Kiltz et al. · 2018 · 1K citations · Full text
Computing, Computer Science, Algebra +14
Average Case Complete Problems
Leonid A. Levin · SIAM Journal on Computing · 1986 · 431 citations
Security in quantum cryptography
Christopher Portmann, Renato Renner · Reviews of Modern Physics · 2022 · 372 citations · Full text
Computing, Computer Science, Physics +12
1–5 of 122
263
7
h-index
5
h-index
4
h-index
4
h-index
3
h-index
1–5 of 263
156
Massachusetts Institute of Technology
Cambridge, United States
8 h-index
15 publications
1.5K citations

Weizmann Institute of Science
Rehovot, Israel
7 h-index
11 publications
717 citations

University of Waterloo
Waterloo, Canada
6 h-index
8 publications
1.7K citations
IBM Research - Almaden
San Jose, United States
6 h-index
6 publications
319 citations

Cornell University
Ithaca, United States
5 h-index
8 publications
649 citations
Georgia Institute of Technology
Atlanta, United States
5 h-index
6 publications
634 citations
Carnegie Mellon University
Pittsburgh, United States
4 h-index
8 publications
157 citations
Ruhr University Bochum
Bochum, Germany
4 h-index
4 publications
1K citations
1–8 of 156
Repository · 6 publications · 177 citations
6
h-index
5 publications · 540 citations
5
h-index
3 publications · 119 citations
3
h-index
Repository · 3 publications · 99 citations
3
h-index
JACM · 3 publications · 330 citations
3
h-index
1–5