Namita Tiwari

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

E-mail: namitatiwari@csjmu.ac.in

Website: https://orcid.org/0000-0002-9039-5696

Research Interests:

Biography

Namita Tiwari is associate professor and serving as join faculty in the Department of Mathematics, School of Basic Sciences and Department of Computer Application, University Institute of Technology, CSJMU Kanpur. She received her B.Sc. from CSJMU Kanpur in 2006, M.Sc. in Pure Mathematics from IIT Kanpur in 2008, and Ph.D. in Cryptography from MNNIT Allahabad in 2013. She also qualified CSIR-NET (AIR-81) and GATE (Mathematics). Her professional experience spans more than fifteen years, during which she has served in various academic positions at engineering institutions and universities. Her research interests include cryptography, elliptic-curve based digital signatures, proxy signatures, network security, and applications of machine learning in secure communication. She has authored several SCI/Scopus-indexed research papers, book chapters, and patents, and has presented her work at numerous international conferences.Dr. Tiwari has delivered several invited lectures in cryptography, quantum computing, and mathematical modeling. She is a life member of the Cryptology Research Society of India (CRSI) and the Indian Society for Technical Education (ISTE). She has also contributed to organising national and international workshops, seminars, and conferences, and currently serves in multiple administrative roles at CSJMU Kanpur.

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