DUAL-LAYER PROTECTED RSA-CRT ARCHITECTURE: GOPPA CODES FOR COMMUNICATION CHANNEL AND RRNS FOR FAULT INJECTION RESISTANCE
DOI:
https://doi.org/10.28925/2663-4023.2026.34.1326Keywords:
RSA-CRT algorithm, fault injection, redundant residue number system, Reed-Solomon codes, fault toleranceAbstract
The growing complexity of cyber threats and the increasing susceptibility of cryptographic hardware to fault injection attacks and communication channel disturbances require the development of integrated fault-tolerant cryptographic architectures. Although the Chinese Remainder Theorem optimization of the RSA algorithm (RSA-CRT) significantly accelerates modular exponentiation, it remains highly vulnerable to computational faults, where even a single induced error may reveal confidential information or compromise the private key. In addition, communication channels are exposed to random and burst errors that reduce the reliability of transmitted cryptographic data. Therefore, ensuring both computational integrity and transmission reliability is an important challenge for modern secure information systems.
This paper proposes a dual-protection architecture for RSA-CRT that combines computational fault tolerance with communication error correction. The first protection layer employs a Redundant Residue Number System (RRNS) consisting of three information moduli and two redundant moduli. The introduced redundancy enables the detection, localization, and correction of erroneous residues through a majority-voting reconstruction procedure while preserving the inherent parallelism of modular arithmetic. The second protection layer utilizes Reed–Solomon error-correcting codes over the Galois field GF(28)GF(2^8)GF(28) to protect transmitted data against channel noise and burst errors, thereby ensuring reliable delivery of encrypted information before cryptographic processing.
A software prototype of the proposed architecture was developed and experimentally evaluated under combined fault scenarios including communication channel errors and injected computational faults. The obtained results demonstrate reliable correction of transmission errors together with successful localization and recovery of corrupted modular residues during RSA-CRT execution. The obtained performance confirms that the proposed architecture achieves a favorable trade-off between fault tolerance and computational efficiency without significantly affecting the throughput of cryptographic operations. The proposed architecture extends conventional RSA-CRT implementations by integrating two complementary protection mechanisms operating at different stages of information processing. Such an approach improves the robustness of cryptographic systems against both communication errors and computational fault attacks and may be applied in secure embedded systems, industrial controllers, cyber-physical systems, and other security-critical applications requiring high reliability of public-key cryptography.
Downloads
References
Vavruk, Ye. Ya., Popovych, B. R., & Popovych, R. B. (2021). Software model of Reed-Solomon codes. Computer Systems and Networks, 3(1), 1-6. https://doi.org/10.23939/csn2021.01.001
Davletova, A. (2024). Data encryption algorithm with error correction. Herald of Khmelnytskyi National University. Technical Sciences, 341(5), 168-176. https://doi.org/10.31891/2307-5732-2024-341-5-26
Bernstein, D. J. (2011). List decoding for binary Goppa codes. In Y. M. Chee et al. (Eds.), Coding and cryptology: Third International Conference, IWCC 2011 (Lecture Notes in Computer Science, Vol. 6639, pp. 62-80). Springer. https://doi.org/10.1007/978-3-642-20901-7_4
Chakraborty, A., Bhattacharya, S., Saha, S., & Mukhopadhyay, D. (2020). Rowhammer induced intermittent fault attack on ECC-hardened memory. IACR Transactions on Cryptographic Hardware and Embedded Systems, 2020(1), 328-350. https://doi.org/10.46586/tches.v2020.i1.328-350
Cintas Canto, A., Kaur, J., Mozaffari Kermani, M., & Azarderakhsh, R. (2023). Algorithmic security is insufficient: A comprehensive survey on implementation attacks haunting post-quantum security. arXiv. https://arxiv.org/abs/2305.13544
Dottax, E., Giraud, C., Rivain, M., & Sierra, Y. (2009). On second-order fault analysis resistance for CRT-RSA implementations. In O. Markowitch et al. (Eds.), Information security theory and practice (Lecture Notes in Computer Science, Vol. 5746, pp. 68–83). Springer. https://doi.org/10.1007/978-3-642-03944-7_6
Imam, R., Areeb, Q. M., Alturki, A., & Anwer, F. (2021). Systematic and critical review of RSA based public key cryptographic schemes: Past and present status. IEEE Access, 9, 155949-155976. https://doi.org/10.1109/ACCESS.2021.3129224
Kim, C. H., & Quisquater, J.-J. (2007). Fault attacks for CRT based RSA: New attacks, new results, and new countermeasures. In D. Sauveron et al. (Eds.), Information security theory and practice (Lecture Notes in Computer Science, Vol. 4462, pp. 215-228). Springer. doi.org/10.1007/978-3-540-72354-7_18
Krasnobayev, V., Yanko, A., & Kovalchuk, D. (2023). Control, diagnostics and error correction in the modular number system. In S. Subbotin (Ed.), Proceedings of the Sixth International Workshop on Computer Modeling and Intelligent Systems (CMIS-2023) (CEUR Workshop Proceedings, Vol. 3392, pp. 219–233). CEUR-WS. https://ceur-ws.org/Vol-3392/paper17.pdf
Rauzy, P., & Guilley, S. (2014). Countermeasures against high-order fault-injection attacks on CRT-RSA. Journal of Cryptographic Engineering, 4(3), 173–185. https://doi.org/10.1007/s13389-013-0065-3
Yatskiv, V., Nyemkova, E., Kulyna, S., Kulyna, H., & Ivasiev, S. (2024). Data encryption method based on the redundant residue number system. In S. Caron et al. (Eds.), Proceedings of the 5th International Workshop on Intelligent Information Technologies and Systems of Information Security (IntelITSIS 2024) (CEUR Workshop Proceedings, Vol. 3675, pp. 195–204). CEUR-WS. https://ceur-ws.org/Vol-3675/paper16.pdf
Published
How to Cite
Issue
Section
License
Copyright (c) 2026 Степан Івасьєв, Іван Янік

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.