International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Finding Roots in GF(p^n) with the Successive Resultant Algorithm

Authors:
Christophe Petit
Download:
URL: https://eprint.iacr.org/2014/506
Search ePrint
Search Google
BibTeX
@article{eprint-2014-25700,
  title={Finding Roots in GF(p^n) with the Successive Resultant Algorithm},
  journal={IACR Cryptology ePrint Archive},
  volume={2014},
  pages={506},
  url={https://eprint.iacr.org/2014/506},
  author={Christophe Petit},
  year=2014
}