Antoine Joux, Cécile Pierrot. Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms - Simplified Setting for Small Characteristic Finite Fields. In Palash Sarkar, Tetsu Iwata, editors, Advances in Cryptology - ASIACRYPT 2014 - 20th International Conference on the Theory and Application of Cryptology and Information Security, Kaoshiung, Taiwan, R.O.C., December 7-11, 2014. Proceedings, Part I. Volume 8873 of Lecture Notes in Computer Science, pages 378-397, Springer, 2014. [doi]
@inproceedings{JouxP14,
title = {Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms - Simplified Setting for Small Characteristic Finite Fields},
author = {Antoine Joux and Cécile Pierrot},
year = {2014},
doi = {10.1007/978-3-662-45611-8_20},
url = {http://dx.doi.org/10.1007/978-3-662-45611-8_20},
researchr = {https://researchr.org/publication/JouxP14},
cites = {0},
citedby = {0},
pages = {378-397},
booktitle = {Advances in Cryptology - ASIACRYPT 2014 - 20th International Conference on the Theory and Application of Cryptology and Information Security, Kaoshiung, Taiwan, R.O.C., December 7-11, 2014. Proceedings, Part I},
editor = {Palash Sarkar and Tetsu Iwata},
volume = {8873},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-662-45610-1},
}