Skip to search formSkip to main contentSkip to account menu

Modular exponentiation

Known as: Discrete exponential function, Mod, Modpow 
Modular exponentiation is a type of exponentiation performed over a modulus. It is useful in computer science, especially in the field of public-key… 
Wikipedia (opens in a new tab)

Related topics

Related topics

34 relations
.NET FrameworkBailey–Borwein–Plouffe formulaComputational complexity of mathematical operationsComputer science

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2016
Review
2016
Autonomous personal mobility scooter for multi-class mobility-on-demand service
In this paper, we describe the design and development of an autonomous personal mobility scooter that was used in public trials… 
2015
2015
An Improved Algorithm for Secure Outsourcing of Modular Exponentiations
Outsourcing computation allows for outsourced function evaluation from a resource-constrained client to a powerful server which… 
2011
2011
Fast parallel DNA-based algorithms for molecular computation: discrete logarithm
Diffie and Hellman (IEEE Trans. Inf. Theory 22(6):644–654, 1976) wrote the paper in which the concept of a trapdoor one-way… 
2007
2007
Spectral Modular Exponentiation
We describe a new method to perform the modular exponentiation operation, i.e., the computation of c = me mod n, where c, m, e… 
2006
2006
Four Hardware Implementations for the M-ary Modular Exponentiation
Modular exponentiation is a cornerstone operation to several public-key cryptosystems. It is performed using successive modular… 
2005
2005
Multi-Dimensional Hash Chains and Application to Micropayment Schemes
One-way hash chains have been used in many micropayment schemes due to their simplicity and efficiency. In this paper we… 
2004
2004
Carry-save Montgomery modular exponentiation on reconfigurable hardware
In this paper we present a hardware implementation of the RSA algorithm for public-key cryptography. Basically, the RSA algorithm… 
1999
1999
Modular Exponentiation on Reconfigurable Hardware
It is widely recognized that security issues will play a crucial role in the majority of future computer and communication… 
1999
1999
A Sublinear-Time Parallel Algorithm for Integer Modular Exponentiation
The modular exponentiation problem is, given integers x; a; m with m > 0, compute x a mod m. Let n denote the sum of the lengths… 
1992
1992
A Modular Exponentiation Unit Based on Systolic Arrays
The described architecture of a modular exponentiation unit with systolic modular multipliers shows the following features… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)