Polynomials over finite fields free from large and small degree irreducible factors
Journal of Algorithms - Analysis of algorithms
A Rigorous Proof of the Waterloo Algorithm for the Discrete Logarithm Problem
Designs, Codes and Cryptography
The Generalized Weil Pairing and the Discrete Logarithm Problem on Elliptic Curves
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
The generalized Weil pairing and the discrete logarithm problem on elliptic curves
Theoretical Computer Science - Latin American theorotical informatics
Hi-index | 0.00 |