earticle

논문검색

A Genetic Algorithm Approach for Breaking of Simplified Data Encryption Standard

초록

영어

A genetic algorithm (GA) is a search algorithm for solving optimization problems due to it is robustness; it offers benefits over optimization techniques in searching n-dimensional surface. In today's information age, information transfer has increased exponentially. Hence, security, confidentiality and authentication have become important factors in multimedia communications. Encryption is an effective technique that is preserving the confidentiality of data in Internet applications. Cryptanalysis is a technique of encoding and decoding ciphertext in such way it cannot be interpreted by anyone expects sender and receiver. In this paper, GA with an improved crossover operator was used for the cryptanalysis of Simplified data encryption standard problem (S-DES). Results have shown that GA performance is better than brute force search technique in breaking S-DES key.

목차

Abstract
 1. Introduction
 2. Related Works
 3. S-DES
  3.1. S-DES Key Generation
  3.2. Initial and Final Permutation
  3.3. The Function 𝒇𝒌
  3.4. The Switch Function
 4. Genetic Algorithm (GA)
 5. Cost fitness
 6. Results and Experimental Setup
 7. Conclusion
 References

저자정보

  • Farah Al Adwan Department of Computer Science, University of Jordan
  • Mohammad Al Shraideh Department of Computer Science, University of Jordan
  • Mohammed Rasol” Saleem Al Saidat Jordan Telecom Group (Orange)

참고문헌

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

    함께 이용한 논문

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

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