Exploring the Role of Prime Numbers in Cryptography and Modular Arithmetic Patterns — E8 Intelligence Research
Year: 2026
Type: preprint
Abstract: FINDING: Prime numbers are foundational in cryptography and numerical analysis. | MATH: The RSA encryption relies on the product of two large prime numbers \( n = p \times q \) and the totient function \( \phi(n) = (p-1)(q-1) \). | CONNECTION: No direct geometric harmony identified; however, prime distribution may relate to patterns in modular arithmetic akin to lattice structures. | DEPTH: 8 Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
Author: Caldin, Andrew Stewart
Language: English
Subfield: Algebra and Number Theory
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7234454138
