About this document
Extenden Euclidean Algorithm by doruklevent05 is a document available to read on EtoBox.
The lecture discusses number theory concepts essential for a factoring algorithm, focusing on the Euclidean and Extended Euclidean Algorithms for finding factors of a number N. It illustrates the process of factoring using examples, such as factoring 33, and explains how to find the modular inverse using the Extended Euclidean Algorithm. Additionally, the lecture covers continued fractions and their properties, demonstrating how they can be used to find approximations for fractions relevant to the factoring
- Author
- doruklevent05
- Language
- EN