Mitigating security flaws in Baptista’s chaotic cryptosystem through superior and alternated logistic map approaches

Zapisane w:
Opis bibliograficzny
Wydane w:Scientific Reports (Nature Publisher Group) vol. 15, no. 1 (2025), p. 38342-38361
1. autor: Verma, Deepak Kumar
Kolejni autorzy: Rani, Mamta, Dikshit, Roli, Gupta, Himanshu, Kumar, Anuj
Wydane:
Nature Publishing Group
Hasła przedmiotowe:
Dostęp online:Citation/Abstract
Full Text
Full Text - PDF
Etykiety: Dodaj etykietę
Nie ma etykietki, Dołącz pierwszą etykiete!

MARC

LEADER 00000nab a2200000uu 4500
001 3268295485
003 UK-CbPIL
022 |a 2045-2322 
024 7 |a 10.1038/s41598-025-22269-8  |2 doi 
035 |a 3268295485 
045 2 |b d20250101  |b d20251231 
084 |a 274855  |2 nlm 
100 1 |a Verma, Deepak Kumar  |u Department of Computer Engineering, Marwadi University, 360006, Rajkot, Gujarat, India (ROR: https://ror.org/030dn1812) (GRID: grid.508494.4) (ISNI: 0000 0004 7424 8041) 
245 1 |a Mitigating security flaws in Baptista’s chaotic cryptosystem through superior and alternated logistic map approaches 
260 |b Nature Publishing Group  |c 2025 
513 |a Journal Article 
520 3 |a This research delves into the concerns raised by numerous researchers regarding the security of Baptista’s chaotic cryptosystem. The paper scrutinizes two fundamental issues in the Baptista algorithm: the imperfect distribution of chaotic data and the constraints of a single attractor. To address these issues, we propose a novel approach that leverages Parrondo’s paradox to switch between two chaotic attractors and integrates a more robust logistic map into the Baptista algorithm by introducing additional parameters to the secret key. The two innovative methods, Superior Baptista and alternated Superior Baptista cryptosystems, are proposed to yield improved chaotic data or two new chaotic attractors. Therefore, the security features of the cryptosystem are enhanced by increasing the number of system iterations used for encryption. Experimental evaluations show that the Superior Baptista Algorithm required iteration counts up to 2,823, while the Alternated variant reached 86,556 iterations for specific characters, significantly improving randomness and diffusion. Furthermore, the entropy values of these algorithms are calculated 67.35% and 42.86% higher than those of the Baptista algorithm, respectively. These findings demonstrate the superiority of the proposed cryptosystems over the base algorithm. 
653 |a Cryptography 
653 |a Algorithms 
653 |a Data integrity 
653 |a Data transmission 
653 |a Entropy 
653 |a Orbits 
653 |a Security systems 
653 |a Comparative analysis 
653 |a Economic 
700 1 |a Rani, Mamta  |u Department of Computer Science, Central University of Rajasthan, 305817, Kishangarh, Ajmer, Rajasthan, India (ROR: https://ror.org/056y7zx62) (GRID: grid.462331.1) (ISNI: 0000 0004 1764 745X) 
700 1 |a Dikshit, Roli  |u Department of Computer Science, Central University of Rajasthan, 305817, Kishangarh, Ajmer, Rajasthan, India (ROR: https://ror.org/056y7zx62) (GRID: grid.462331.1) (ISNI: 0000 0004 1764 745X) 
700 1 |a Gupta, Himanshu  |u Department of Instrumentation and Control Engineering, Manipal Institute of Technology, Manipal Academy of Higher Education, 576104, Manipal, Karnataka, India (ROR: https://ror.org/02xzytt36) (GRID: grid.411639.8) (ISNI: 0000 0001 0571 5193) 
700 1 |a Kumar, Anuj  |u Department of Design, Data Science and Cyber Security, Greater Noida Institute of Technology, 201310, Greater Noida, India (ROR: https://ror.org/03h56sg55) (GRID: grid.418403.a) (ISNI: 0000 0001 0733 9339) 
773 0 |t Scientific Reports (Nature Publisher Group)  |g vol. 15, no. 1 (2025), p. 38342-38361 
786 0 |d ProQuest  |t Science Database 
856 4 1 |3 Citation/Abstract  |u https://www.proquest.com/docview/3268295485/abstract/embedded/7BTGNMKEMPT1V9Z2?source=fedsrch 
856 4 0 |3 Full Text  |u https://www.proquest.com/docview/3268295485/fulltext/embedded/7BTGNMKEMPT1V9Z2?source=fedsrch 
856 4 0 |3 Full Text - PDF  |u https://www.proquest.com/docview/3268295485/fulltextPDF/embedded/7BTGNMKEMPT1V9Z2?source=fedsrch