Decoding binary Goppa codes
Recover an error from a public scrambled binary-Goppa parity-check matrix and syndrome, without the private decoding trapdoor.
Classical · public-code decoding
Fix (n,k,t) or an explicit asymptotic family
Results
| # | PUBLICATION / AUTHORS | DATE | TIME BOUND | SPACE BOUND | EVIDENCE |
|---|---|---|---|---|---|
| No checked result has been added for this comparison contract. | |||||
Comparison definition & assumptions
- Regime
- Fix (n,k,t) or an explicit asymptotic family
- Computation
- Classical
- Rigor
- Source analysis
- Instances
- Binary Goppa public codes
- Cost scale
- Parameterized in n,k,t
- Parameter
- n,k,t
- Description
- Generic decoding cost for Goppa public keys.
- Comparison rules
- Generic ISD applies to the public code but a random-code full-GV maximum is not the cost of a particular McEliece parameter set. The private Goppa trapdoor is unavailable. Key recovery, distinguishers and side-information attacks belong in separate lists.
- Tags
- Goppa codes, public key only, generic ISD