C library for arbitrary-precision integer and rational computation.
-
Updated
Oct 28, 2014 - C
C library for arbitrary-precision integer and rational computation.
Idempotent and Regular Numbers
Solution to HackerRank "primitive-problem" problem in mathematics/Number Theory section
Solution to HackerRank "eulers-criterion" problem in mathematics/Number Theory section
Solution to HackerRank "littlepandapower" problem in mathematics/Number Theory section
My journey in competitive programming
Implementaciones del algoritmo de encriptación DES en C++ utilizando bitset, usigned char y unsigned int de 64 bits, algoritmo de Euclides, potenciación modular, test de primalidad de Miller-Rabin.
C code to implement RSA Cryptography
|| Безопасность вычислительных систем (gui)
Assignment for the course Number Theory and Cryptography
Speed up modular exponentiation of Go's big.Int's using precomputed tables
A C++11 large integer library with effective high performance, simplistic in nature and also clean in the eyes.
Applying extended-euclidean-algorithm on negative powered number to find their inverses
IntX is a C++11 port of IntX arbitrary precision Integer library with speed, about O(N * log N) multiplication/division algorithms implementation.
I am uploading all the solutions(codes) uploaded by me in ACM Summer Challenge @2019 held by SVNIT,SURAT on HACKEREARTH.
Modular Exponentiation based on Simultaneous Multi-Exponentiation (Shamir Method)
🔒 A broad implementation of the RSA algorithm in Java
Programs I wrote that helped me understand encryption, decryption and signing functions along with security protocols. Programs written in Java using BigIntegers.
An algorithm that computes modular nested exponentiation efficiently.
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."