An implementation of the McEliece-cryptosystem
Matthias Leclerc · ACM SIGSAC Review · 1991
Most asymmetric cryptosystems are based on hard number-theoretic problems such as integer factorization or taking discrete logarithms in finite groups [2]. Their performance aspect are well investigated [3].