Extended Euclidean Algorithm and CRT Algorithm1
نویسندگان
چکیده
In this article we formalize some number theoretical algorithms, Euclidean Algorithm and Extended Euclidean Algorithm [9]. Besides the a gcd b, Extended Euclidean Algorithm can calculate a pair of two integers (x, y) that holds ax + by = a gcd b. In addition, we formalize an algorithm that can compute a solution of the Chinese remainder theorem by using Extended Euclidean Algorithm. Our aim is to support the implementation of number theoretic tools. Our formalization of those algorithms is based on the source code of the NZMATH, a number theory oriented calculation system developed by Tokyo Metropolitan University [8].
منابع مشابه
GCD-Free Algorithms for Computing Modular Inverses
This paper describes new algorithms for computing a modular inverse e−1 mod f given coprime integers e and f . Contrary to previously reported methods, we neither rely on the extended Euclidean algorithm, nor impose conditions on e or f . The main application of our gcd-free technique is the computation of an RSA private key in both standard and CRT modes based on simple modular arithmetic oper...
متن کاملAssessment of the Log-Euclidean Metric Performance in Diffusion Tensor Image Segmentation
Introduction: Appropriate definition of the distance measure between diffusion tensors has a deep impact on Diffusion Tensor Image (DTI) segmentation results. The geodesic metric is the best distance measure since it yields high-quality segmentation results. However, the important problem with the geodesic metric is a high computational cost of the algorithms based on it. The main goal of this ...
متن کاملNew Branch Prediction Vulnerabilities in OpenSSL and Necessary Software Countermeasures
Software based side-channel attacks allow an unprivileged spy process to extract secret information from a victim (cryptosystem) process by exploiting some indirect leakage of “side-channel” information. It has been realized that some components of modern computer microarchitectures leak certain side-channel information and can create unforeseen security risks. An example of such MicroArchitect...
متن کاملComputing Multiplicative Inverses in GY{p)
Two familiar algorithms, the extended Euclidean algorithm and the Fermât algorithm (based on Fermat's theorem ap = a (mod p)), are analyzed and compared as methods for computing multiplicative inverses in GF(p). Using Knuth's results on the average number of divisions in the Euclidean algorithm, it is shown that the average number of arithmetic operations required by the Fermât algorithm is nea...
متن کاملCryptanalysis of Multicast Protocols with Key Refreshment Based on the Extended Euclidean Algorithm
Recently, Naranjo, López-Ramos and Casado have proposed a key refreshment for multicast schemes based on the extended Euclidean algorithm. We show in this paper that the key refreshment is not secure, describing several weaknesses and the algorithm to obtain the private key of any user. Hence, every system in which the key refreshment is applied will be compromised.
متن کامل