ROCA: Infineon RSA key vulnerability
-
Updated
Oct 19, 2023 - Python
ROCA: Infineon RSA key vulnerability
Elliptic Curve Cryptography and Common Public Key Cryptography Implementations
Baby Step Giant Step for SECPK1
Elliptic curve tools, ECDSA, and ECDSA attacks.
Pollard Rho attack on ECDLP with GMP
Different Flavors of the Schnorr signature.
Implementation of the baby-step, giant-step algorithm for finding discrete logarithms
python program that implements divide and conquer approach, or Pohlig-Hellman approach, to solving discrete log problems
elliptic curve cryptography with GPU acceleration
Zero_Knowledge-proof demonstration using discrete log. Demonstration of 1-2 oblivious transfer protocol.
A repo that contains implementation of classic cryptographic problems.
A CUDA based sieve for numbers of the form k*b^n-1. This project is heavily based on SR2Sieve.
Repo contains code samples for practical learning of cryptography.
Practical Implementation of the Maurer Reduction
Used algorithms for prime generation/check (Fermat's test and Miler Rabin's test) to implement discrete logarithm (BSGS), and inverse and exponentiation (Extended Euclid's algorithm). Refer to readme.txt for more details.
Baby-Step Giant-Step Discrete Logarithm Problem Solver in WebAssembly (Written in Rust)
Introduction to the discrete logarithm problem and a comparison of symmetric vs asymmetric ciphers
The Chinese remainder theorem and its application in the Pohlig-Hellman algorithm for solving the discrete logarithm problem.
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."