Cryptology City

Cryptology City
Home

❯

Reductions

❯

McEliece assumptions ⇒ Goppa code indistinguishability

Nov 21, 2026

McEliece assumptions ⇒ Goppa code indistinguishability

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

Statement

If the McEliece assumptions hold for (n,m,t), then Goppa codes are indistinguishable for (n,m,t), with the same advantage — folklore.


Graph View

  • McEliece assumptions ⇒ Goppa code indistinguishability
  • Statement

Backlinks

  • Syndrome decoding

Created with Quartz v4.5.2 © 2026

  • GitHub
  • Bluesky