Fast discrete logarithm solver in Rust
-
Updated
Nov 8, 2024 - Rust
Fast discrete logarithm solver in Rust
Implementation of some basic algorithms relevant for cryptography.
A collection of notes on mathematical Cryptography, ranging from classical methods through contemporary.
A CUDA based sieve for numbers of the form k*b^n-1. This project is heavily based on SR2Sieve.
Discrete logarithms in the ring of integers modulo n
Elliptic Curve Cryptography and Common Public Key Cryptography Implementations
ROCA: Infineon RSA key vulnerability
An algorithm for solving the discrete logarithm
Practical Implementation of the Maurer Reduction
Classical Cryptosystems, Grain Cipher, RSA and it's attacks, RC4, Toy Cipher(based on SPN) Hash Function and their cryptoanalysis
Implementation of Elliptic Curve / Finite Body in Rust
elliptic curve cryptography with GPU acceleration
An implementation of Shank's (BSGS) algorithm on a toy elliptic curve
Solving a two variable modulo function using the algorithm for discrete lograithm
The Chinese remainder theorem and its application in the Pohlig-Hellman algorithm for solving the discrete logarithm problem.
Diffie-Hellman key exchange and ElGamal cryptosystem. Plus Shanks' algorithm for solving the discrete logarithm problem.
Introduction to the discrete logarithm problem and a comparison of symmetric vs asymmetric ciphers
Pollard Rho attack on ECDLP with GMP
Add a description, image, and links to the discrete-logarithm topic page so that developers can more easily learn about it.
To associate your repository with the discrete-logarithm topic, visit your repo's landing page and select "manage topics."