Merkle-Hellman Cryptosystem

Algorithms to solve a subset sum problem using different methods.

1. Brute Force
2. Branch and Bound
3. Divide and Conquer

Course

This project was developed under the Algorithms and Data Structures course of University of Aveiro.

Installation

• Clone the repository:

$ git clone https://github.com/leo-dsf/Merkle-Hellman_Cryptosystem

How To Run

• Compile with the following command:

$ cc -Wall -O2 subset_sum_problem.c -o subset_sum_problem

• Run:

$ ./subset_sum_problem

Authors

• Leonardo Flórido - leo-dsf
• Gabriel Hall - GabrielHall02
• Diogo Alves - DiogoAlves002

License

This project is licensed under the MIT License.