An Authentic Algorithm for Ciphering and Deciphering Called Latin Djokovic

Authors: Diogen Babuc

Abstract:

The question that is a motivation of writing is how many devote themselves to discovering something in the world of science where much is discerned and revealed, but at the same time, much is unknown. The insightful elements of this algorithm are the ciphering and deciphering algorithms of Playfair, Caesar, and Vigen`ere. Only a few of their main properties are taken and modified, with the aim of forming a specific functionality of the algorithm called Latin Djokovic. Specifically, a string is entered as input data. A key k is given, with a random value between the values a and b = a+3. The obtained value is stored in a variable with the aim of being constant during the run of the algorithm. In correlation to the given key, the string is divided into several groups of substrings, and each substring has a length of k characters. The next step involves encoding each substring from the list of existing substrings. Encoding is performed using the basis of Caesar algorithm, i.e. shifting with k characters. However, that k is incremented by 1 when moving to the next substring in that list. When the value of k becomes greater than b + 1, it will return to its initial value. The algorithm is executed, following the same procedure, until the last substring in the list is traversed. Using this polyalphabetic method, ciphering and deciphering of strings are achieved. The algorithm also works for a 100-character string. The x character is not used when the number of characters in a substring is incompatible with the expected length. The algorithm is simple to implement, but it is questionable if it works better than the other methods, from the point of view of execution time and storage space.

Keywords: Ciphering and deciphering, Authentic Algorithm, Polyalphabetic Cipher, Random Key, methods comparison.

References:

[1] Jain, A., et al. (2015). Enhancing the security of the Caesar cipher substitution method using a randomized approach for secure communication. arXiv:1512.05483.
[2] Mishra, A. Enhancing security of Caesar cipher using different methods. International Journal of Research in Engineering and Technology.
[3] Omolara, O. E., Oludare, A. I., & Abdulahi, S. E. (2014). Developing a modified Hybrid Caesar cipher and Vigen`ere cipher for secure Data Communication. Computer Engineering and Intelligent Systems, 5(5), 34-46.
[4] Soofi, A. A., Riaz, I., & Rasheed, U. (2016). An enhanced Vigen`ere cipher for data security. Int. J. Sci. Technol. Res, 5(3), 141-145.
[5] Tunga, H., & Mukherjee, S. (2012). A new modified Playfair algorithm based on frequency analysis. International Journal of Emerging Technology and Advanced Engineering, ISSN, 2250-2459.
[6] Patni, P. A poly-alphabetic approach to Caesar cipher algorithm. International Journal of Computer Science and Information Technologies, 4(6), 954-959.
[7] Sharma, V., Jalwa, S., Siddiqi, A. R., Gupta, I., & Singh, A. K. (2021). A Lightweight Effective Randomized Caesar Cipher Algorithm for Security of Data. In Evolutionary Computing and Mobile Sustainable Networks. Springer, Singapore.
[8] Goyal, P., Sharma, G., & Kushwah, S. S. (2015, December). A new modified Playfair algorithm using CBC. In 2015 International Conference on Computational Intelligence and Communication Networks (CICN) (pp. 1008-1012). IEEE.
[9] Marzan, R. M., & Sison, A. M. (2019, February). An enhanced key security of Playfair cipher algorithm. In Proceedings of the 2019 8th International Conference on Software and Computer Applications (pp. 457-461).
[10] Dhenakaran, S. S., & Ilayaraja, M. (2012). Extension of Playfair cipher using 16X16 matrix. International Journal of Computer Applications, 48(7).