The fast growth of quantum computing puts widely used public-key cryptosystems like RSA and Elliptic Curve Cryptography (ECC) at risk because Shor's algorithm can quickly factor integers and find discrete logarithms. Grover’s algorithm similarly weakens symmetric ciphers like AES, necessitating larger key sizes. This work proposes the Hyperring RSA–AES Hybrid Encryption Scheme (HRA-HES), a hybrid cryptosystem that achieves post-quantum security for simple ciphers while preserving practical usability. HRA-HES derives session keys via Hyperring Learning with Noise within a Key Encapsulation Mechanism, and AES-256-GCM uses these keys to encrypt large data blocks. The multi-valued hyperaddition in the underlying hyperring structure disrupts the periodicity exploited by quantum period-finding algorithms. Implementation results show an encryption throughput of 850 Mbps and an average key generation time of about 2.1 ms, yielding improvements of up to 44% over prior baselines while maintaining low resource consumption, thus offering a scalable, quantum-aware transition framework.
Alkhalidy et al. (Sun,) studied this question.