Fast enough proves if the odd integer is true prime number or is composite number.
For this application I has built three libraries that provides even faster arithmetic
operations to test the primality of large integers numbers.
Project is created with these libraries:
Eduard.dll
Eduard.Cryptography.dll
Eduard.Foundation.dll
WPF user interface, rendered using DirectX
To run this project, install it using Visual Studio:
Extract archve to Elliptic Curve Primality Proving/ folder
Open Elliptic Curve Primality Proving.sln in Visual Studio
Select Build > Build Solution