Computes the coefficient of Bezouts identity
Project description
The Extended Euclidean Algorithm is an extension of the Euclidean Algorithm for finding the greatest common divisor (GCD) of two integers. In addition to finding the GCD, the Extended Euclidean Algorithm also computes the coefficients of Bézout’s identity, which are integers x and y such that:
GCD(a,b)=ax+by
This algorithm is particularly useful in various areas, including number theory and cryptography.
Change Log
0.0.1 (12/12/2023)
First Release
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
File details
Details for the file crypto_math_utils-0.0.1.tar.gz.
File metadata
- Download URL: crypto_math_utils-0.0.1.tar.gz
- Upload date:
- Size: 2.6 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
- Uploaded via: twine/4.0.2 CPython/3.12.0
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 |
d8419717a5b54909505feaf2a59a4a22c01f63b26572e1677c615bb6965b8d86
|
|
| MD5 |
933de00002e876249206352e2198b2f5
|
|
| BLAKE2b-256 |
825afc19b617492c338f2c215cddb00480431e595b332954707b469ed4ddff25
|
