Binary Goppa Codes

Every code listing from this chapter of Applied Post-Quantum Cryptography — 1 in total, 1 runnable here. Edit any cell and press Run.

The book's snippets build on each other down the chapter, but a Sage Cell kernel runs one cell and keeps no state afterwards, so each cell replays the earlier listings with apqc_book. That call is the only thing added to the book's own code.

← the playground

Listing 1 — A construction in SageMath

The whole object is short to build. Take m=4, so 𝔽₁₆, and a squarefree Goppa polynomial of degree t=2.