Today's world has witnessed the accumulation of data through social media like Twitter and Facebook, which have been growing enormously day by day. Using these social media, users tweet or post on many topics from anyplace in the world through the Internet. Tweets are used to analyze positive and negative messages to drive polarity scores and also to predict future trends. These polarity scores could be extracted from Twitter, even though polarity score data are placed under security. The data can be easily hacked, and changing the score results can lead to lots of issues, such as affecting the worldwide economic status, company brands, and the reputations of firms. To tackle these issues, Daniel Bernstein proposed the implementation of Salsa, which has faster encryption because of the quarter round with better data security. In the present work, a novel algorithm is proposed by modifying the Salsa20/4 to further enhance the security of the polarity scores, which is an important requirement of the present world. The proposed algorithm has two stages. The first stage consists of a secret key and the second stage constructs the diagonal keys in N-1 steps. The proposed algorithm is tested with different file sizes to calculate the encryption time. The results show that the proposed encryption algorithm takes relatively large execution time but provides high data security when compared to that of the existing algorithm of Salsa20/4.

当今世界见证了通过社交媒体（如Twitter和Facebook）积累的数据，而这些社交媒体每天都在迅速增长。使用这些社交媒体，用户可以通过Internet在世界任何地方发推文或发布许多主题。推文用于分析正面和负面消息，以推动极性得分并预测未来趋势。即使将极性分数数据置于安全之下，也可以从Twitter提取这些极性分数。数据很容易被黑客入侵，改变得分结果可能会导致很多问题，例如影响全球经济状况，公司品牌和公司声誉。为了解决这些问题，丹尼尔·伯恩斯坦（Daniel Bernstein）提出了实施莎莎（Salsa）的方法，该方法的加密速度更快，因为它每季度进行一次，数据安全性更高。在目前的工作中，提出了一种通过修改Salsa20 / 4来进一步提高极性评分的安全性的新算法，这是当今世界的重要要求。所提出的算法具有两个阶段。第一阶段由一个秘密密钥组成，第二阶段以N-1个步骤构造对角密钥。对所提出的算法进行了不同文件大小的测试，以计算加密时间。结果表明，与现有的Salsa20 / 4算法相比，所提出的加密算法执行时间相对较长，但具有较高的数据安全性。第一阶段由一个秘密密钥组成，第二阶段以N-1个步骤构造对角密钥。对所提出的算法进行了不同文件大小的测试，以计算加密时间。结果表明，与现有的Salsa20 / 4算法相比，所提出的加密算法执行时间相对较长，但具有较高的数据安全性。第一阶段由一个秘密密钥组成，第二阶段以N-1个步骤构造对角密钥。对所提出的算法进行了不同文件大小的测试，以计算加密时间。结果表明，与现有的Salsa20 / 4算法相比，所提出的加密算法执行时间相对较长，但具有较高的数据安全性。