ROCA: Infineon RSA key vulnerability

Elliptic Curve Cryptography and Common Public Key Cryptography Implementations

No description provided.

Baby Step Giant Step for SECPK1

elliptic curve cryptography with GPU acceleration

Attacks on the Diffie Hellman Key Exchange

Practical Implementation of the Maurer Reduction

Pollard Rho attack on ECDLP with GMP

A collection of notes on mathematical Cryptography, ranging from classical methods through contemporary.

We started from learning programming with crypto at Universities (6 connected Universities in Poland), we voted for programming friendly cryptocurrency, we chose litecoin, we did unexpeced very fast api/wallet for Litecoin, after presentations we get customer who want Dash and Dogecoin, we said ok (not all crypto will work that fast, these can)

Discrete logarithms in the ring of integers modulo n

Different Flavors of the Schnorr signature.

A CUDA based sieve for numbers of the form k*b^n-1. This project is heavily based on SR2Sieve.

No description provided.

Julia package for descent elimination algorithms

Algorithms for discret logarithm problem

Repo contains code samples for practical learning of cryptography.

Mathematical cryptography (custom implementations).

Semaev Summation Polynomials for Index Calculus on an Elliptic Curve like Satoshi' Wallet

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.

small module including an Index_Calclus algorithm for disc. log. calculations

python program that implements divide and conquer approach, or Pohlig-Hellman approach, to solving discrete log problems

Fast discrete logarithm solver in Rust

Computation of Discrete Logarithms in Prime Fields (Gaussian Integers Method extended to Eisenstein Integers Method)

An algorithm for solving the discrete logarithm

My implementations of the solutions of Cryptopals problems from the hardest set i.e. set 8

Implementation of the baby-step, giant-step algorithm for finding discrete logarithms

Hyper-Complex large numbers.

Zero_Knowledge-proof demonstration using discrete log. Demonstration of 1-2 oblivious transfer protocol.

Challenge by the Ingonyama-ZK team