Multi-Prime RSA Over Galois Approach

TL;DR

This paper extends the RSA cryptosystem by applying a Galois approach, using irreducible polynomials instead of primes, and introduces a multi-prime variant over polynomials.

Contribution

It introduces a novel multi-prime RSA scheme over polynomials based on Galois theory, expanding the cryptographic framework beyond traditional prime-based RSA.

Findings

Proposed a multi-prime RSA scheme over polynomials

Extended Galois-based RSA to multi-prime setting

Potential for enhanced security and efficiency

Abstract

Many variants of RSA cryptosystem exist in the literature. One of them is RSA over polynomials based on Galois approach. In standard RSA modulus is product of two large primes whereas in the Galois approach author considered the modulus as a product of two irriduciable polynomials. We use this idea and extend Multi-prime RSA over polynomials.