|
Birthday Simulation
A TUI application written in C that shows how birthday paradox works, prove how birthday attack can finds collision in less than half of the hash space count.
|
This is a TUI (Terminal User Interface) application written in C that shows how birthday paradox works, prove how birthday attack can finds collision in less than half of the hash space count.
To run, build or develop the application, you should start from here.
You can download the executable from GitHub release.
sha256, sha512, etc..UCRT64 terminal and pacman to search and install the library.CMake and makeClone the repository into your local machine
For linux:
For Windows:
Open your MSYS2-UCRT64 command line:
Update and upgrade all the packages, you MAY need to run this command multiple times until you see the message there is nothing to do.
bash pacman -Syu
Install the toolchain:
bash pacman -S --needed base-devel mingw-w64-ucrt-x86_64-toolchain
then install the packages:
bash pacman -S mingw-w64-ucrt-x86_64-glib2 mingw-w64-ucrt-x86_64-ncurses mingw-w64-ucrt-x86_64-openssl
Generate the make file with CMake, for your platform:
On Windows, using MinGW
On Linux/Unix, using the standard unix makefile
Run make to build the application
To build and view the documentations locally, install doxygen
or install it from the doxygen website if you have a GUI
Generate the documentation site to docs
View the site