earticle

논문검색

Dynamic Key Matrix of Hill Cipher Using Genetic Algorithm

초록

영어

Genetic algorithms can solve complex problems, including the problems of cryptography. What problems often occur on the Hill Cipher is the waste of time to determine the numbers that are used in the encryption process. In the encryption process, it is not a problem if the key is derived from any number. However, the problem is ciphertext cannot be returned to the original message. The key that is used must have the determinant is 1. To find the value of it is something that takes time if it must be done manually. Due to the entered value to the Hill Cipher is random, Genetic algorithms can be used to optimize the search time. By using this algorithm, the determinant calculation will be more accurate and faster. The result achieved is the program can specify some combination of numbers that can be used as the encryption key Hill Cipher and it can reject the unnecessary numbers.

목차

Abstract
 1. Introduction 
 2. Related Work 
 3. Proposed Work 
 4. Evaluation 
 6. Conclusion
 References

저자정보

  • Andysah Putera Faculty of Computer Science, Universitas Pembangunan Panca Budi, Jl. Jend. Gatot Subroto Km. 4,5 Sei Sikambing, 20122, Medan, Sumatera Utara, Indonesia
  • Utama Siahaan Faculty of Computer Science, Universitas Pembangunan Panca Budi, Jl. Jend. Gatot Subroto Km. 4,5 Sei Sikambing, 20122, Medan, Sumatera Utara, Indonesia
  • Robbi Rahim Faculty of Information System, Universitas Prima Indonesia, Jl. Sekip Simpang Sikambing, Medan, Sumatera Utara, Indonesia

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.