Active Bibliography

1 Approximate Constructions In Finite Fields – Igor Shparlinski
A Survey of Elliptic Curve Cryptosystems, Part I: Introductory – San C. Vo - 2003
PROGRAMME DOCTORAL EN INFORMATIQUE, COMMUNICATIONS ET INFORMATION ÉCOLE POLYTECHNIQUE FÉDÉRALE DE LAUSANNE POUR L'OBTENTION DU GRADE DE DOCTEUR ÈS SCIENCES PAR – Prof S. Vaudenay, Hasan Mirjalili, Re Karlov, Shahram Khazaei, Dag Arne Osvik, Onur Özen
8 Fast computation with two algebraic numbers – Alin Bostan, Philippe Flajolet, Bruno Salvy, Éric Schost - 2002
on Factoring Polynomials Over Finite Fields: A Survey – Joachim Von, Zur Gathen, Daniel Panario
9 Implementation Of The Atkin-Goldwasser-Kilian Primality Testing Algorithm – François Morain - 1988
1 Computational Methods in Public Key Cryptology – Arjen K. Lenstra - 2002
4 Cryptography meets voting – Warren D. Smith - 2005
68 Subquadratic-time factoring of polynomials over finite fields – Erich Kaltofen, Victor Shoup - 1998
2 Efficient Approximation Algorithms for Sparse Polynomials over Finite Fields – Marek Karpinski, Igor Shparlinski - 1994
6 A Binary Algorithm for the Jacobi Symbol – Jeffrey Shallit, Jonathan Sorenson - 1993
4 Space-efficient evaluation of hypergeometric series – Howard Cheng, Barry Gergel, Ethan Kim, Eugene Zima
GENERATORS OF ELLIPTIC CURVES OVER FINITE – Igor E. Shparlinski, José, Felipe Voloch
4 Computing the eigenvalue in the Schoof-Elkies-Atkin algorithm using Abelian lifts – P. Mihăilescu, F. Morain, É. Schost
2 Modular composition modulo triangular sets and applications – Adrien Poteaux, Éric Schost - 2010
20 Fast Computation of Special Resultants – Alin Bostan , Philippe Flajolet, Bruno Salvy, Éric Schost - 2006
A Computational Introduction to Number Theory and Algebra (BETA version 5) – Victor Shoup Ii
10 Counting Curves and Their Projections – Joachim Von Zur Gathen, Marek Karpinski, Igor Shparlinski - 1996
1 MpNT: A Multi-Precision Number Theory Package. Number-Theoretic . . . – F. L. Tiplea, S. Iftene, I. Goriac, R. M. Gordân, E. Erbiceanu, et al. - 2003