A simple prime number library (in Prolog)
-
Updated
Feb 5, 2017 - Prolog
A simple prime number library (in Prolog)
primality test (Miller Rabin) implement by c#, transplantation from https://github.com/coapp-packages/mpir
Explanation of the RSA Algorithm
A small cryptosuite application written in C++
Poor man's big integer arithmetic operations
Toy Digital Signatures implemented using Public Key Crypto for signing and verification, SHA1 for hashing.
An implementation of the Miller-Rabin primality test for `num_bigint::BigUint`
Toy SFTP implemented using Diffie-Hellmann Key Exchanging, Caesar Cipher for encryption and SHA1 for password hashing.
Deterministic and Miller-Rabbin prime number count calculator.
Implémentation d'algorithmes et analyse de complexité de problèmes
An extension for PHP written in c to demonstrate the performance improvements in the numerical calculation.
Trial division, Fermat, Miller-Rabin, Solovay–Strassen and Lucas primality tests
IntX is a C++11 port of IntX arbitrary precision Integer library with speed, about O(N * log N) multiplication/division algorithms implementation.
The basic algorithms of cryptography
DES、AES、Present、Extended Euclidean Algorithm、Miller-Rabin( 常用密码学算法)推荐书籍《现代密码学趣味之旅》---彭长根
Add a description, image, and links to the miller-rabin topic page so that developers can more easily learn about it.
To associate your repository with the miller-rabin topic, visit your repo's landing page and select "manage topics."