The Extended Euclidian Algorithm on Polynomials, and the Computational Efficiency of Hyperelliptic Cryptosystems

Andreas Enge. The Extended Euclidian Algorithm on Polynomials, and the Computational Efficiency of Hyperelliptic Cryptosystems. Des. Codes Cryptography, 23(1):53-74, 2001.

Authors

Andreas Enge

This author has not been identified. Look up 'Andreas Enge' in Google