A C++11 large integer library with effective high performance, simplistic in nature and also clean in the eyes.
-
Updated
Jun 4, 2019 - C++
A C++11 large integer library with effective high performance, simplistic in nature and also clean in the eyes.
Implementation of popular algorithms and data structures using .NET Core
Some extra functions to work with modular arithmetics using native JS implementation of BigInt.
IntX is a C++11 port of IntX arbitrary precision Integer library with speed, about O(N * log N) multiplication/division algorithms implementation.
C library for arbitrary-precision integer and rational computation.
Solution to HackerRank "primitive-problem" problem in mathematics/Number Theory section
🔒 A broad implementation of the RSA algorithm in Java
Modular arithmetic, promoting moduli to the type level
An algorithm that computes modular nested exponentiation efficiently.
I am uploading all the solutions(codes) uploaded by me in ACM Summer Challenge @2019 held by SVNIT,SURAT on HACKEREARTH.
Practice Problems for CS101 (Computer Programming and Utilization)
Montgomery multiplication in number bases that are a power of 2, like binary, hexadecimal, byte-wise etc.
Generates a not-so-pseudorandom cyclic permutation using modular exponentiation
Clockwork: A Modular Arithmetic library for C++
Applying extended-euclidean-algorithm on negative powered number to find their inverses
Extension to GMP library that allows fast fixed-basis exponentiations, simultaneous exponentiation, and randomly choosing safe-primes.
🧜♀️ Modular arithmetic for JavaScript
Repository for basic algorithms.
Idempotent and Regular Numbers
Add a description, image, and links to the modular-exponentiation topic page so that developers can more easily learn about it.
To associate your repository with the modular-exponentiation topic, visit your repo's landing page and select "manage topics."