GitHub

kapilpalanisamy/Comparative-Study-of-GCD-Algorithms-in-Multiple-Languages-Euclidean-and-Stein-s-algorithms

Overview: This project benchmarks and compares six methods for computing the greatest common divisor (GCD): Euclidean Iterative, Euclidean Recursive, Stein’s Iterative, Stein’s Recursive, Subtraction ...
GitHub

An efficient implementation of the Lehmer GCD algorithm for computing the greatest common divisor of large integers in Elixir.

The Lehmer GCD algorithm is particularly efficient for very large integers, using matrix operations to reduce the problem size while maintaining mathematical correctness. For smaller numbers (less ...
IEEE

Fast prime generation algorithms using proposed GCD test on mobile smart devices

Abstract: As mobile smart devices are widely used, mobile security becomes more and more important. However, the performance of these devices are not powerful enough to use the same security ...
IEEE

A Universal List Decoding Algorithm With Application to Decoding of Polar Codes

Abstract: This paper is concerned with a guessing codeword decoding (GCD) of linear block codes, which is optimal and typically requires a fewer number of searches than the naive exhaustive search ...