Browsing by Author "Muhammad Zargam Hamid"

Now showing 1 - 1 of 1
  • Thumbnail Image
    Item
    Secure communication using minimum and maximum Hamiltonian cycles.
    (UMT Lahore, 2021) Muhammad Zargam Hamid
    In this thesis, we will discuss the algorithms to compute minimum Hamiltonian cycle and maximum Hamiltonian cycle of a complete weighted undirected graph. Next, we will show how we can use both minimum and maximum Hamiltonian cycles for secure communication. We provide an unique cryptographic technique that may be implemented in any computer language, such as Microsoft.Net, Java and C++. This method encrypts data for transmission by employing an encoding table and graph theory properties such as complete graph and minimum (maximum) Hamiltonian cycles. This symmetric encryption approach employs the concept of shared keys, which must be predefined and shared by two parties. When the plain text message is large, the cipher text size increases in our suggested approach, showing that the proposed technique is more efficient when the plain text message is tiny. We will also provide the examples of encryption and decryption.