2nd Nommensen International Conference on Technology and Engineering | |
Security analysis in file with combinations One Time Pad Algorithm and Vigenere Algorithm | |
Mawengkang, H.^1 ; Sitepu, I.L.^1 ; Efendi, S.^1 | |
Departemen S2 Teknik Informatika, Fakultas Ilmu Komputer Dan Teknologi Informasi, Universitas Sumatera Utara, Kampus USU, Jl. Universitas No. 9-A, Medan | |
20155, Indonesia^1 | |
关键词: Ciphertexts; Cryptographic techniques; Encrypted messages; One time pads; Process time; Random keys; Security analysis; Substitution method; | |
Others : https://iopscience.iop.org/article/10.1088/1757-899X/420/1/012129/pdf DOI : 10.1088/1757-899X/420/1/012129 |
|
来源: IOP | |
![]() |
【 摘 要 】
Security is a big issue and securing important data is so important that it can't be tapped or misused for illegal purposes to the detriment of others. Cryptography is a way used to maintain security where messages are disguised into encrypted messages. One-time cryptography pad is one type of cryptographic technique that uses substitution method by giving special terms to the key used that is made of characters or random letters (random key or pad), and the randomness does not use a certain formula. The Vigenere code includes a poly alphabetic subtitution cipher which in subtitle technique each text have many possible original texts. Super Encryption is a method of combining between the two algorithms that aims to get a stronger cipher making it very difficult to solve. The result of this research is the process time stated that the average time of plaintext encryption process with 50 characters is 3 milisecond while the mean time of plaintext encryption process with 100 characters is 7.33 milisecond. Then for the average time of encryption ciphertext process with 50 characters is 75,333 milisecond while the mean time of ciphertext encryption process with 100 characters is 132,333 milisecond.
【 预 览 】
Files | Size | Format | View |
---|---|---|---|
Security analysis in file with combinations One Time Pad Algorithm and Vigenere Algorithm | 722KB | ![]() |