Multi-Prime RSA Over Galois Approach

2016/05/17 by Swati Rawal, Rawal, Swati
Computer Science · #94A60 #Chaos-based Image/Signal Encryption #Coding theory and cryptography #Cryptography and Residue Arithmetic #Cryptography and Security (cs.CR) #FOS: Computer and information sciences

paper · pdf · doi:10.48550/arxiv.1605.05024

openalex publication_date 2016/05/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• Cryptoanalysis of RSA variants with special structure of RSA primes
• A multifactor RSA-like scheme with fast decryption based on Rédei rational functions over the Pell hyperbola
• Revisiting Fermat's Factorization for the RSA Modulus
• Cryptanalysis of RSA Cryptosystem: Prime Factorization using Genetic Algorithm
• Notions for RSA integers