Cryptology City

Cryptology City
Home

❯

Reductions

❯

Quasi polynomially hard LWE ⇒ LWE with polynomial ratio

Oct 20, 2026

Quasi-polynomially hard LWE ⇒ LWE with polynomial ratio

Fully-black-box reduction · standard model · folklore · security loss: none

Statement

Quasi-polynomially hard LWE implies LWE with polynomial modulus-to-noise ratio with the same parameters: an adversary of size nk has size at most 2(logn)2 for all large n, so its advantage is at most 2−(logn)2, which is negligible — folklore.


Graph View

  • Quasi-polynomially hard LWE ⇒ LWE with polynomial ratio
  • Statement

Backlinks

  • Learning with errors

Created with Quartz v4.5.2 © 2026

  • GitHub
  • Bluesky