vf_node_title_variants
| ANGOL CÍM | Computational hardness assumptions | 11080 |
field_in_importance
2
vf_node_webs
| title (web) | field_t_title_web | |
|---|---|---|
| https://en.wikipedia.org/wiki/Template:Computational_hardness_assumptions |
vf_node_items
| vf_node_pictures_all | title (item) | field_cer_web | field_cer_navbox | g_geofield | field_t_coordinates | |
|---|---|---|---|---|---|---|
| prímfelbontás (törzstényezős felbontás, prímfaktorizáció) - integer factorization - Primfaktorzerlegung - Факторизация целых чисел |
body
| Computational hardness assumptions | |
|---|---|
| Number theoretic | Integer factorization • Phi-hiding • RSA problem • Strong RSA • Quadratic residuosity • Decisional composite residuosity • Higher residuosity |
| Group theoretic | Discrete logarithm • Diffie-Hellman • Decisional Diffie-Hellman • Computational Diffie-Hellman |
| Pairings | External Diffie-Hellman • Sub-group hiding • Decision linear |
| Lattices | Shortest vector problem (gap) • Closest vector problem (gap) • Learning with errors • Ring learning with errors • Short integer solution |
| Non-cryptographic | Exponential time hypothesis • Unique games conjecture • Planted clique conjecture |
fr_importance