modular-exponentiation

A C++11 large integer library with effective high performance, simplistic in nature and also clean in the eyes.

Modular arithmetic, promoting moduli to the type level

Some extra functions to work with modular arithmetics using native JS implementation of BigInt.

Clockwork: A Modular Arithmetic library for C++

IntX is a C++11 port of IntX arbitrary precision Integer library with speed, about O(N * log N) multiplication/division algorithms implementation.

Generates a not-so-pseudorandom cyclic permutation using modular exponentiation

A fork of BoringSSL using VROOM, a new modular multiplication algorithm

C library for arbitrary-precision integer and rational computation.

Interactive Showcases of Quantum Tic-Tac-Toe Game and Shor's Algorithm for Integer Factorization, covering various Quantum Computing concepts like Quantum Gates, Superposition & Entanglement, Measurement & Collapse, or Quantum Fourier Transform & Phase Estimation, etc.

Montgomery multiplication in number bases that are a power of 2, like binary, hexadecimal, byte-wise etc. Used mainly in RSA, DH cryptosystems.

Raku package with number theory functions.

Extension to GMP library that allows fast fixed-basis exponentiations, simultaneous exponentiation, and randomly choosing safe-primes.

Java wrapper of GMP and GMP Modular Exponentiation Extension library (GMPMEE).

I am uploading all the solutions(codes) uploaded by me in ACM Summer Challenge @2019 held by SVNIT,SURAT on HACKEREARTH.

Implementation of popular algorithms and data structures using .NET Core

Fun Practice Problems for CS101 (Computer Programming and Utilization)

Verilog hardware implementation of modular exponentiation using Montgomery multiplication, Karatsuba multiplication, non-restoring division, and the Extended Euclidean Algorithm.

An exploration of cryptographic concepts, including modular exponentiation, RSA algorithm analysis, and brute-force password cracking techniques. This repository contains Python implementations, performance evaluations, and visualizations as part of the MATH 359 project for the 2024/25 academic year.

Speed up modular exponentiation of Go's big.Int's using precomputed tables

Applying extended-euclidean-algorithm on negative powered number to find their inverses