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 Vigenere. 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 the 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.

翻译：撰写本文的动机源于：在科学领域，已知与未知并存，众多研究者致力于探索未知。本算法的核心灵感来源于Playfair、凯撒和维吉尼亚加密与解密算法，仅保留并改进其部分主要特性，以形成名为拉丁乔科维奇的特定功能算法。具体而言，输入数据为一个字符串。给定一个密钥k，其取值为介于a和b = a + 3之间的随机数。该值存储于一个变量中，并在算法运行期间保持恒定。根据给定密钥，字符串被划分为若干子字符串组，每个子字符串长度为k个字符。下一步是对现有子字符串列表中的每个子字符串进行编码。编码过程基于凯撒算法原理，即每个字符移位k个位置。然而，在处理列表中的下一个子字符串时，k值递增1。当k值大于b + 1时，它将恢复为初始值。算法重复上述步骤，直至遍历列表中的最后一个子字符串。通过这种多表替换方法，实现了字符串的加密与解密。该算法同样适用于100字符长度的字符串。当子字符串中的字符数量与预期长度不匹配时，不使用字符x。该算法实现简单，但从执行时间和存储空间角度来看，其是否优于其他方法仍有待验证。