Arshi Fatima

Work place: Department of Mathematics, School of Basic Sciences, CSJM University Kanpur, India

E-mail: arshianees29@gmail.com

Website: https://orcid.org/0009-0005-3403-342X

Research Interests:

Biography

Arshi Fatima was born in Kanpur, India. She received her B.Sc. degree in Mathematics from Brahmanand College, Kanpur (affiliated to CSJM University Kanpur), India, in 2023, and her M.Sc. degree in Mathematics from CSJM University Kanpur, India, in 2025. Her major field of study is cryptography, with a focus on public key security and mathematical foundations of encryption. She is currently engaged in research in Cryptography, where she is working on enhancing the RSA cryptosystem through chaotic exponent selection and ciphertext blinding techniques. Her research has resulted in the development of a lightweight chaos-based RSA variant suitable for secure communication environments, and her work has been submitted to peer-reviewed journals. Her research interests include number theory, cryptographic algorithms, chaotic maps, and mathematical security analysis. Ms. Fatima aims to pursue doctoral studies in Cryptography and Mathematical Sciences. She is an active academic researcher and has participated in university-level research initiatives.

Author Articles
A Novel RSA Cryptosystem Variant Using Chaotic Exponent Selection and Ciphertext Blinding

By Arshi Fatima Namita Tiwari

DOI: https://doi.org/10.5815/ijmsc.2026.01.02, Pub. Date: 8 Feb. 2026

This paper presents an enhanced variant of the RSA cryptosystem that integrates chaotic exponent selection and ciphertext blinding to address security limitations inherent in classical RSA. Traditional RSA relies on a fixed public exponent, which generates predictable encryption patterns and increases exposure to exponent-based attacks. In the proposed scheme, the encryption exponent is dynamically derived from a logistic-map–based chaotic sequence, introducing high sensitivity to initial conditions and producing session-dependent exponent values. This chaotic exponentiation increases unpredictability without modifying the established RSA framework. Additionally, a ciphertext blinding factor is incorporated to prevent deterministic outputs and strengthen resistance against chosen-ciphertext and side-channel attacks. The paper outlines the mathematical background of the logistic map, details the complete encryption and decryption procedures, and demonstrates the correctness of the method through a numerical example using small primes. A theoretical security analysis shows that the combined effects of chaotic exponent selection and blinding significantly improve resistance to key-related attacks while maintaining compatibility with the original RSA structure. These enhancements offer a lightweight and practical improvement to RSA for environments requiring increased confidentiality and unpredictability in exponent selection.

[...] Read more.
Other Articles