Hardware implementation of Extended Euclid Algorithm
Location
Ada, Ohio
Start Date
3-12-2024 12:00 AM
End Date
3-12-2024 12:00 AM
Description
Encryption algorithms become increasingly important in the world as computers continue to dominate more areas. Many public key encryption algorithms, such as RSA, use Bezout’s identity. It has become apparent that software applications of these algorithms are limited in their use, especially when it comes to encryption using incredibly large numbers. Due to this, I have begun work on a hardware implementation of the Extended Euclid Algorithm which uses Bezout’s identity in order to find modular inverses of coprime numbers. The goal of this is to find how good a hardware implementation of the Extended Euclid Algorithm is in areas such as speed and power usage.
Recommended Citation
Hammond, Jakob, "Hardware implementation of Extended Euclid Algorithm" (2024). College of Engineering Student Research Colloquium. 15.
https://digitalcommons.onu.edu/eng_student_research_colloquium/2024/Presentations/15
Hardware implementation of Extended Euclid Algorithm
Ada, Ohio
Encryption algorithms become increasingly important in the world as computers continue to dominate more areas. Many public key encryption algorithms, such as RSA, use Bezout’s identity. It has become apparent that software applications of these algorithms are limited in their use, especially when it comes to encryption using incredibly large numbers. Due to this, I have begun work on a hardware implementation of the Extended Euclid Algorithm which uses Bezout’s identity in order to find modular inverses of coprime numbers. The goal of this is to find how good a hardware implementation of the Extended Euclid Algorithm is in areas such as speed and power usage.