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.

An algorithm for solving the discrete logarithm

Final Year Project 2016 http://www.indjst.org/index.php/indjst/article/view/102112

Finding a discrete logarithm (C++, Windows).

Implementation of Elliptic Curve / Finite Body in Rust

Classical Cryptosystems, Grain Cipher, RSA and it's attacks, RC4, Toy Cipher(based on SPN) Hash Function and their cryptoanalysis

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

Attacks on the Diffie Hellman Key Exchange

An implementation of Shank's (BSGS) algorithm on a toy elliptic curve

Implementation of some basic algorithms relevant for cryptography.

[CS 101 - IIT Bombay] A tiny cryptography application written in C++

Hyper-Complex large numbers.

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

Discrete logarithms in the ring of integers modulo n

Julia package for descent elimination algorithms

Mathematical cryptography (custom implementations).