Copyright © 2024 Jiri Kriz, www.nosco.ch

Extended Euclidean Algorithm

Kommentare (0)
Extended Euclidean algorithm computes the greatest common divisor of two numbers as well as the coefficients of the Bézout's idententity. This is used for computing the modulo inverse of a number and that is needed in public cryptography.

This post has been relocated

Please visit the new location


Neuer Kommentar