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.

Abstract: The paper proposes a method for calculating the basic operation of public key cryptography - modular exponentiation with group processing of the exponent code and the use of pre-calculations ...

This project demonstrates a simple Zero-Knowledge Proof (ZKP) circuit using Noir to prove knowledge of a modular exponentiation computation without revealing the base or the exponent. The modulus is ...

Abstract: In several public-key cryptosystems, the main operation consists of the modular exponentiation, which is performed using successive modular multiplications. The size of the operands that are ...

Reversible circuits for modular multiplication Cx%M with x M arise as components of modular exponentiation in Shor's quantum number-factoring algorithm. However, existing generic constructions focus ...