On the sequences ri, si, ti ∈ ℤ related to extended Euclidean algorithm and continued fractions
The extended Euclidean Algorithm is a practical technique used in many cryptographic applications, where it computes the sequences ri, si, ti ∈ ℤ that always satisfy ri = si a+ tib. The integer ri is the remainder in the ith sequences. The sequences si and ti arising from the extended Euclidean algo...
| Main Authors: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
AIP Publishing
2016
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/57195/1/On%20the%20sequences%20ri%2C%20si%2C%20ti%20%E2%88%88%20%E2%84%A4%20related%20to%20extended%20Euclidean%20algorithm%20and%20continued%20fractions.pdf |