CRMay 17, 2016
Multi-Prime RSA Over Galois Approach
arXiv:1605.05024v11 citations
Originality Synthesis-oriented
AI Analysis
This is an incremental extension of existing cryptographic methods, potentially relevant for researchers in cryptography.
The paper tackles the problem of extending RSA cryptosystems by applying a Galois approach to multi-prime RSA over polynomials, where the modulus is a product of irreducible polynomials instead of primes, but no specific results or numbers are provided.
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.