.png){kind=icon}
Return
Enhancing RSA algorithm security through advanced combinatorial n! permutations in cryptographic protocols
.png){kind=icon}
PRE
AI
DOI：10.47974/JDMSC-2476.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
gingtheprocessThireduces brute-forceandfactoriationrsksThe Quantum computing and improved cryptanalysis have rendered the RSA algorithm lesssafe, butitremains a vitalaspectof public-keyencryption.Newly,thiswork enhancesthe design additionally employs these padding and message encoding variants to RSA algorithm's secureprotocol by addingsophisticated combinatorial n! Permutations.To improve spread and confusion following Shannon's cryptography principles create a vast and surprisingkeyspace,factorial-based permutationsofkeycomponents like The entropy and statistical unpredictability of protected data have improved and ciphertext and plaintext are used.These n! variants arecarefullyexploited for key creation, theoretical study supports the assumption that the numb r of key configurations encryption,and decoding.Theymake illegal file decodingtougher without changing the may expand exponentialy wthout affecting data processing speed process. This reduces brute-force and factorisation risks. The design additionally employs these paddingandmessageencodingvariants to improve spread and confusion, following Subject Classification: 11T71 Shannon'scryptographyprinciples.The entropyandstatistical unpredictability of protected Keywords: RSA Algorithm Factorial-based Permutation Public-Key data have improved,and theoretical studysupports the assumption that the number of key Security Combinatorial Cryptography configurations may expand exponentially without affecting data processing speed.
Keywords:
RSA algorithm
Factorial-based permutation
Public-key security
Combinatorial cryptography
Journal
J
IF:
1.1
Papers:
185
Citations:
0
Organization
View more organizations
Cited Papers
No cited papers available