Paper 2024/1002 Original: eprint.iacr.org/2024/1002 ↗
Elementary Formulas for Greatest Common Divisors and Semiprime Factors
Abstract
We conjecture new elementary formulas for computing the greatest common divisor (GCD) of two integers, alongside an elementary formula for extracting the prime factors of semiprimes. These formulas are of fixed-length and require only the basic arithmetic operations of: addition, subtraction, multiplication, division with remainder, and exponentiation. Our GCD formulas result from simplifying a formula of Mazzanti and are derived using Kronecker substitution techniques from our earlier research. By applying these GCD formulas together with our recent discovery of an arithmetic expression for $\sqrt{n}$, we are able to derive explicit elementary formulas for the prime factors of a semiprime $n=p q$.
Metadata
- Available format(s)
PDF- Category
- Foundations
- Publication info
- Preprint.
- History
- 2024-11-06: last updated
- 2024-06-21: published
- Short URL
- https://ia.cr/2024/1002
- License
- https://creativecommons.org/licenses/by-nc-nd/4.0/
BibTeX
@misc{cryptoeprint:2024/1002,
author = {Joseph M. Shunia},
title = {Elementary Formulas for Greatest Common Divisors and Semiprime Factors},
howpublished = {Cryptology {ePrint} Archive, Paper 2024/1002},
year = {2024},
url = {https://eprint.iacr.org/2024/1002}
}