Description
This repository contains SageMath code implementing an extension of the classical McEliece cryptosystem to algebraic geometry (AG) codes derived from higher genus curves. The construction generalizes the original proposal, which was based on Goppa codes (genus 0), to a wider class of AG codes, providing potential improvements in key size and cryptographic strength.
The implementation supports:
Encoding and decoding using AG codes from explicit curves
Key generation adapted to higher genus constructions
Basic parameter tuning and testing
This code was developed to accompany the forthcoming paper: Higher-genus McElieceby Daniel J. Bernstein, Tanja Lange, Alex Pellegrini.
The aim is to facilitate reproducibility and further research in post-quantum cryptography based on algebraic geometry codes.
Keywords: Post-quantum cryptography, McEliece cryptosystem, algebraic geometry codes, SageMath, higher genus curves, AG codes
The implementation supports:
Encoding and decoding using AG codes from explicit curves
Key generation adapted to higher genus constructions
Basic parameter tuning and testing
This code was developed to accompany the forthcoming paper: Higher-genus McElieceby Daniel J. Bernstein, Tanja Lange, Alex Pellegrini.
The aim is to facilitate reproducibility and further research in post-quantum cryptography based on algebraic geometry codes.
Keywords: Post-quantum cryptography, McEliece cryptosystem, algebraic geometry codes, SageMath, higher genus curves, AG codes
| Date made available | 22 Sept 2025 |
|---|---|
| Publisher | Zenodo |
Cite this
- DataSetCite