Agung Purnomo Sidik


This investigation was conducted to move forward the security of the vigenère cypher calculation by tending to the key conveyance issue and the most key issue within the calculation if cryptoanalysts effectively got it. The working demonstrates employments a 512-bit Electronic Code Book (ECB). The essential key utilized was a 512-bit arbitrary key. The randomized encoding table was also generated by the Blum Blum Shub calculation employing a scrambler key. The RSA calculation was utilized to scramble 512-bits random keys and scrambler keys. It comes about to appear that the proposed calculation does not include a key dissemination issue. With a randomized encoding table, the 512-bits arbitrary key cannot be utilized to unscramble the ciphertext off chance that cryptanalysis did not know the mixed table utilized. The preparing time appeared the proportion of the contrast of the vigenère cypher calculation. The proposed calculation was not as well essentially distinctive, and the longer the message was handled, the proportion of the time distinction possessed was moreover getting closer to one, which implies the distinction was not critical. The coming about ciphertext was too exceptionally secure, where the coming about ciphertext was irregular since the key utilized was random, and there were 3.75 x 10126 keys combination. This algorithm can be an alternative algorithm that is fast, safe, and easy to implement


How to Cite
Purnomo Sidik, A. (2021). Improve The Security of The Vigenère Cypher Algorithm by Modifying the Encoding Table and Key. International Journal of Basic and Applied Science, 10(2), 42–50. https://doi.org/10.35335/ijobas.v10i2.54
B. Delman, “Genetic algorithms in cryptography,” 2004.
J. P. Sermeno, K. A. S. Secugal, and N. E. Mistio, “Modified Vigenere cryptosystem: An integrated data encryption module for learning management system,” Int. J. Appl. Sci. Eng., vol. 18, no. 4, pp. 1–10, 2021.
M. Abd Zaid and S. Hassan, “Survey on Modern Cryptography,” J. Kufa Math. Comput., vol. 7, no. 1, pp. 1–8, 2021.
A. Malik, S. Gupta, and S. Dhall, “Analysis of traditional and modern image encryption algorithms under realistic ambience,” Multimed. Tools Appl., vol. 79, no. 37, pp. 27941–27993, 2020.
Q.-A. Kester, “A cryptosystem based on Vigenère cipher with varying key,” Int. J. Adv. Res. Comput. Eng. Technol., vol. 1, no. 10, pp. 108–113, 2012.
G. Ye, K. Jiao, H. Wu, C. Pan, and X. Huang, “An asymmetric image encryption algorithm based on a fractional-order chaotic system and the RSA public-key cryptosystem,” Int. J. Bifurc. Chaos, vol. 30, no. 15, p. 2050233, 2020.
K. Kim, F. A. Alfouzan, and H. Kim, “Cyber-Attack Scoring Model Based on the Offensive Cybersecurity Framework,” Appl. Sci., vol. 11, no. 16, p. 7738, 2021.
V. K. Mittal and M. Mukhija, “Cryptosystem Based on Modified Vigenere Cipher using Encryption Technique,” 2019.
T. M. Aung and N. N. Hla, “A Complex Polyalphabetic Cipher Technique Myanmar Polyalphabetic Cipher,” in 2019 International Conference on Computer Communication and Informatics (ICCCI), 2019, pp. 1–9.
M. H. Purwidiantoro and D. F. K. S. Wibowo, “Super Encryption Concepts using Vigenere Cipher Modification to Produce Color Imaginary as Ciphertext,” 2020.
H.-H. Li, L.-H. Gong, and N.-R. Zhou, “New semi-quantum key agreement protocol based on high-dimensional single-particle states,” Chinese Phys. B, vol. 29, no. 11, p. 110304, 2020.
J. Choi, J. Yu, S. Hyun, and H. Kim, “Digital forensic analysis of encrypted database files in instant messaging applications on Windows operating systems: Case study with KakaoTalk, NateOn and QQ messenger,” Digit. Investig., vol. 28, pp. S50–S59, 2019.
D. Rupprecht, K. Kohls, T. Holz, and C. Pöpper, “Call Me Maybe: Eavesdropping Encrypted {LTE} Calls With ReVoLTE,” in 29th {USENIX} Security Symposium ({USENIX} Security 20), 2020, pp. 73–88.
C. Wang, A. Wang, J. Xu, Q. Wang, and F. Zhou, “Outsourced privacy-preserving decision tree classification service over encrypted data,” J. Inf. Secur. Appl., vol. 53, p. 102517, 2020.
A. A. Soofi, I. Riaz, and U. Rasheed, “An enhanced Vigenere cipher for data security,” Int. J. Sci. Technol. Res, vol. 5, no. 3, pp. 141–145, 2016.
M. A. H. Al-Halboosi, “Agile Encryption Scheme for Multimedia Files Using Random Data.” Middle East University, 2021.
B. Triandi, E. Ekadiansyah, R. Puspasari, L. T. Iwan, and F. Rahmad, “Improve Security Algorithm Cryptography Vigenere Cipher Using Chaos Functions,” in 2018 6th International Conference on Cyber and IT Service Management (CITSM), 2018, pp. 1–5.
M. Thangavel, P. Varalakshmi, M. Murrali, and K. Nithya, “An enhanced and secured RSA key generation scheme (ESRKGS),” J. Inf. Secur. Appl., vol. 20, pp. 3–10, 2015.
S. Chandra, “Peningkatan Keamanan Algoritma Vigenère Cipher dengan Teknik Pengacakan Tabel Encoding,” 2019.
Y. D. Vybornova, “Password-based key derivation function as one of Blum-Blum-Shub pseudo-random generator applications,” Procedia Eng., vol. 201, pp. 428–435, 2017.
C. D. Omorog, B. D. Gerardo, and R. P. Medina, “Enhanced pseudorandom number generator based on Blum-Blum-Shub and elliptic curves,” in 2018 IEEE Symposium on Computer Applications & Industrial Electronics (ISCAIE), 2018, pp. 269–274.
E. Koopahi and S. E. Borujeni, “Secure scan-based design using Blum Blum Shub algorithm,” in 2016 IEEE East-West Design & Test Symposium (EWDTS), 2016, pp. 1–5.
P. Patil, P. Narayankar, D. G. Narayan, and S. M. Meena, “A comprehensive evaluation of cryptographic algorithms: DES, 3DES, AES, RSA and Blowfish,” Procedia Comput. Sci., vol. 78, pp. 617–624, 2016.
L. Gong, K. Qiu, C. Deng, and N. Zhou, “An optical image compression and encryption scheme based on compressive sensing and RSA algorithm,” Opt. Lasers Eng., vol. 121, pp. 169–180, 2019.
R. Fotohi, S. Firoozi Bari, and M. Yusefi, “Securing wireless sensor networks against denial‐of‐sleep attacks using RSA cryptography algorithm and interlock protocol,” Int. J. Commun. Syst., vol. 33, no. 4, p. e4234, 2020.
C. Hazay, G. L. Mikkelsen, T. Rabin, T. Toft, and A. A. Nicolosi, “Efficient RSA key generation and threshold paillier in the two-party setting,” J. Cryptol., vol. 32, no. 2, pp. 265–323, 2019.