ngosangns Knowledge Base

#cryptography

  • Extended Euclidean Algorithm
    Explains how the Extended Euclidean Algorithm solves the linear Diophantine equation ax + by = c and how RSA uses it to compute modular inverses.