Quantum-resistant adaptive RSA (QR-ARSA) for secure networks

This paper introduces Quantum-Resistant Adaptive RSA (QR-ARSA), a groundbreaking cryptographic algorithm that enhances traditional RSA with three innovative mechanisms: (1) dynamic prime morphing to prevent factorization attacks, (2) quantum-entangled key pairing for MITM resistance, and (3) noise-injected modular exponentiation to eliminate side-channel vulnerabilities. QR-ARSA achieves 2256 security against quantum attacks while maintaining <20% overhead over standard RSA-3072. Theoretical analysis proves its resistance to Shor’s algorithm (requiring 4× more qubits) and differential power analysis (SNR < -120dB). Benchmark results on FPGA platforms demonstrate 37% faster key rotation compared to post-quantum NIST finalists. The algorithm is backward compatible with existing PKI infrastructure, making it immediately deployable for secure network protocols.

Publication Details

Journal
Journal of Discrete Mathematical Sciences and Cryptography
Published
2025-01-01
DOI
https://doi.org/10.47974/jdmsc-2420
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Quantum-resistant adaptive RSA (QR-ARSA) for secure networks

1 links
Journal of Discrete Mathematical Sciences and Cryptography
Quantum Computing Algorithms and Architecture
article

Quantum-resistant adaptive RSA (QR-ARSA) for secure networks

article en

Abstract

This paper introduces Quantum-Resistant Adaptive RSA (QR-ARSA), a groundbreaking cryptographic algorithm that enhances traditional RSA with three innovative mechanisms: (1) dynamic prime morphing to prevent factorization attacks, (2) quantum-entangled key pairing for MITM resistance, and (3) noise-injected modular exponentiation to eliminate side-channel vulnerabilities. QR-ARSA achieves 2256 security against quantum attacks while maintaining <20% overhead over standard RSA-3072. Theoretical analysis proves its resistance to Shor’s algorithm (requiring 4× more qubits) and differential power analysis (SNR < -120dB). Benchmark results on FPGA platforms demonstrate 37% faster key rotation compared to post-quantum NIST finalists. The algorithm is backward compatible with existing PKI infrastructure, making it immediately deployable for secure network protocols.

Journal of Discrete Mathematical Sciences and CryptographyVol. 28(5-B)
Openalex Percentile: Top 88%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.