Dynamical Analysis of the Parametrized Lehmer–Euclid Algorithm
Combinatorics, Probability and Computing
Modular inverse algorithms without multiplications for cryptographic applications
EURASIP Journal on Embedded Systems
Regularity of the Euclid Algorithm; application to the analysis of fast GCD Algorithms
Journal of Symbolic Computation
Robust HGCD with no backup steps
ICMS'06 Proceedings of the Second international conference on Mathematical Software
Improved exponentiation and key agreement in the infrastructure of a real quadratic field
LATINCRYPT'12 Proceedings of the 2nd international conference on Cryptology and Information Security in Latin America
A novel fast hybrid GCD computation algorithm
International Journal of Computing Science and Mathematics
| Hi-index | 0.00 |