Improving algorithms an‎d applications of polynomial modular number systems in advanced cryptography

11/22/2025 12:00:00 AM

This research improves modular computing algorithms using polynomial modular number systems (PMNS) an‎d residue number systems (RNS) to increase the efficiency an‎d security of post-quantum cryptography. By designing optimized algorithms an‎d implementing software an‎d hardware (on Raspberry Pi 5), the results show that the proposed methods perform better than classical methods (such as Montgomery an‎d Barrett), both in terms of execution speed an‎d memory consumption, an‎d by implementing "constant time", they show high resistance to side-channel attacks (especially timing attacks). These achievements are an effective step towards developing secure an‎d efficient cryptographic infrastructures for the quantum era. The topic I worked on is taken from article number 29 in the references.

رمزنگاري پسا-كوانتومي ، ، سيستم عددي چندجمله‌اي مدولار ، سيستم عددي باقيمانده ، بهينه‌سازي الگوريتم

Post-quantum cryptography; polynomial modular number system; Residue Number System; Algorithm Optimization

Mohammad Mahdi Kiyani

Masoud Hadian Dehkordi