TY - JOUR AU - Joye, M. AU - Paillier, P. PY - 2003 DA - 2003// TI - GCD-free algorithms for computing modular inverses JO - Proceedings of 5th International Workshop on Cryptographic Hardware and Embedded Systems (CHES '03) VL - 2779 ID - Joye2003 ER - TY - JOUR AU - Schönhage, A. AU - Strassen, V. PY - 1971 DA - 1971// TI - Schnelle Multiplikation großer Zahlen JO - Computing VL - 7 UR - https://doi.org/10.1007/BF02242355 DO - 10.1007/BF02242355 ID - Schönhage1971 ER - TY - STD TI - GNU Multiple Precision Arithmetic Library manual, http://www.swox.com/gmp/gmp-man-4.1.2.pdf UR - http://www.swox.com/gmp/gmp-man-4.1.2.pdf ID - ref3 ER - TY - BOOK AU - Hankerson, D. R. AU - Menezes, A. J. AU - Vanstone, S. A. PY - 2004 DA - 2004// TI - Guide to Elliptic Curve Cryptography PB - Springer CY - New York, NY, USA ID - Hankerson2004 ER - TY - BOOK AU - Menezes, A. J. AU - van Oorschot, P. C. AU - Vanstone, S. A. PY - 1996 DA - 1996// TI - Handbook of Applied Cryptography PB - CRC Press CY - Boca Raton, Fla, USA UR - https://doi.org/10.1201/9781439821916 DO - 10.1201/9781439821916 ID - Menezes1996 ER - TY - CHAP AU - Hars, L. PY - 2005 DA - 2005// TI - Fast truncated multiplication and its applications in cryptography BT - Proceedings of 7th International Workshop on Cryptographic Hardware and Embedded Systems (CHES '05) ID - Hars2005 ER - TY - CHAP AU - Shantz, S. C. PY - 2001 DA - 2001// TI - From Euclid's GCD to Montgomerymultiplication to the great divide BT - Tech. Rep. TR-2001-95 PB - Sun Microsystems Laboratories CY - Santa Clara, Calif, USA ID - Shantz2001 ER - TY - JOUR AU - Jedwab, J. AU - Mitchell, C. J. PY - 1989 DA - 1989// TI - Minimum weight modified signed-digit representations and fast exponentiation JO - Electronics Letters VL - 25 UR - https://doi.org/10.1049/el:19890785 DO - 10.1049/el:19890785 ID - Jedwab1989 ER - TY - CHAP AU - Cohen, H. AU - Miyaji, A. AU - Ono, T. ED - Ohta, K. ED - Pei, D. PY - 1998 DA - 1998// BT - Efficient elliptic curve exponentiation using mixed coordinates ID - Cohen1998 ER - TY - BOOK AU - Ercegovac, M. D. AU - Lang, T. PY - 2004 DA - 2004// TI - Digital Arithmetic PB - Morgan Kaufmann CY - San Francisco, Calif, USA ID - Ercegovac2004 ER - TY - BOOK AU - Hars, L. PY - 2004 DA - 2004// TI - Long modular multiplication for cryptographic applications ID - Hars2004 ER - TY - BOOK AU - Knuth, D. E. PY - 1997 DA - 1997// TI - The Art of Computer Programming, Volume 2: Seminumerical Algorithms PB - Addison-Wesley CY - Reading, Mass, USA ID - Knuth1997 ER - TY - JOUR AU - Stein, J. PY - 1967 DA - 1967// TI - Computational problems associated with Racah algebra JO - Journal of Computational Physics VL - 1 UR - https://doi.org/10.1016/0021-9991(67)90047-2 DO - 10.1016/0021-9991(67)90047-2 ID - Stein1967 ER - TY - CHAP AU - Brent, R. P. AU - Kung, H. T. ED - Anceau, V. ED - Aas, E. J. PY - 1983 DA - 1983// TI - Systolic VLSI arrays for linear-time GCD computation BT - Proceedings of International Conference on Very Large Scale Integration (VLSI' 83) ID - Brent1983 ER - TY - JOUR AU - Kaliski, B. S. PY - 1995 DA - 1995// TI - The Montgomery inverse and its applications JO - IEEE Transactions on Computers VL - 44 UR - https://doi.org/10.1109/12.403725 DO - 10.1109/12.403725 ID - Kaliski1995 ER - TY - JOUR AU - Savaş, E. AU - Koç, Ç. K. PY - 2000 DA - 2000// TI - The Montgomery modular inverse-revisited JO - IEEE Transactions on Computers VL - 49 UR - https://doi.org/10.1109/12.863048 DO - 10.1109/12.863048 ID - Savaş2000 ER - TY - JOUR AU - Lórencz, R. PY - 2002 DA - 2002// TI - New algorithm for classical modular inverse JO - Proceedings of 4th International Workshop on Cryptographic Hardware and Embedded Systems (CHES '02) VL - 2523 ID - Lórencz2002 ER - TY - CHAP AU - Jebelean, T. PY - 1993 DA - 1993// TI - Comparing several GCD algorithms BT - Proceedings of 11th IEEE Symposium on Computer Arithmetic (ARITH-11 '93), June- UR - https://doi.org/10.1109/ARITH.1993.378094 DO - 10.1109/ARITH.1993.378094 ID - Jebelean1993 ER - TY - STD TI - Vallée B: Complete Analysis of the Binary GCD Algorithm. 1998, http://citeseer.ist.psu.edu/79809.html UR - http://citeseer.ist.psu.edu/79809.html ID - ref19 ER - TY - CHAP AU - Schroeppel, R. AU - Orman, H. AU - O'Malley, S. PY - 1995 DA - 1995// TI - Fast key exchange with ellipticcurve systems BT - Tech. Rep. 95-03 PB - Department of Computer Science, The University ofArizona CY - Tucson, Ariz, USA ID - Schroeppel1995 ER - TY - JOUR AU - Jebelean, T. PY - 1995 DA - 1995// TI - A double-digit Lehmer-Euclid algorithm for finding the GCD of long integers JO - Journal of Symbolic Computation VL - 19 UR - https://doi.org/10.1006/jsco.1995.1009 DO - 10.1006/jsco.1995.1009 ID - Jebelean1995 ER - TY - JOUR AU - Weber, K. PY - 1995 DA - 1995// TI - The accelerated integer GCD algorithm JO - ACM Transactions on Mathematical Software VL - 21 UR - https://doi.org/10.1145/200979.201042 DO - 10.1145/200979.201042 ID - Weber1995 ER -