Securing the Prediction Data Using Rb27 Algorithm

Shalini, K. Shantha; Leelavathy, S.; Otk, Amal Krishna; Varghese, Reno Thomas; Viswanathan, Nived

doi:10.37418/amsj.9.9.28

Cited by 1 publication

(1 citation statement)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The RB29 algorithm is a property of commutative & associative and provides good security while compared with the Salsa algorithm [12]. The RB27 algorithm has two main processes are quadratic equation and perfect numbers, and security is good while compared with the ChaCha algorithm [13]. The RB23 algorithm is a prime number with quadratic equations and security is good while compared to ChaCha [14].…”

Section: Literature Surveymentioning

confidence: 99%

A Novel Security Algorithm RPBB31 for Securing the Social Media Analyzed Data using Machine Learning Algorithms

Batcha¹,

Singaravelu

Ramachandran³

et al. 2023

Wireless Pers Commun

View full text Add to dashboard Cite

The present world data is most important in public because without data cannot live in the world. This data is big data and that data daily increases through Social Media like "Twitter, Facebook, Youtube, WhatsApp, Instagram, LinkedIn", etc.., because this media only share public opinion very fast through the net. From this media, more people used especially Twitter. Thus media are used to analyze the public opinion of the tweets and predict the future through Machine Learning Algorithm. This analyzed data should make it polarity score. This score data has very little security because, this score can change the score and affected the future, so apply the existing security algorithms is Salsa and ChaCha. The Salsa algorithm is diagonal values moved to the first row. The ChaCha algorithm is diagonal values moved to the first column. The existing algorithms do not have good security because they focused only on performance, not security. So, the novel security algorithm is RPBB31. This algorithm has seven stages. The 1 st stage is to find the secret key N, n, and p values from the matrix. The 2 nd stage is to apply the secret key in equation ( 1). The 3 rd stage operation of PN(n) up to n=1. The 4 th stage is all PN(n) operations make their single line. The 5 th stage is to pair the values and swap the values in the matrix. The 6 th stage is column operations in the matrix. The 7 th stage is again Step 4 values used to swap but "0 th " cell value start from reverse in the matrix. The proposed algorithm has provide good security and performance while compare to existing algorithms.

show abstract

Section: Literature Surveymentioning

confidence: 99%