Adaptive Modular Exponentiation Methods v.s. Python's Power Function

07/06/2017
by   Shiyu Ji, et al.
0

In this paper we use Python to implement two efficient modular exponentiation methods: the adaptive m-ary method and the adaptive sliding-window method of window size k, where both m's are adaptively chosen based on the length of exponent. We also conduct the benchmark for both methods. Evaluation results show that compared to the industry-standard efficient implementations of modular power function in CPython and Pypy, our algorithms can reduce 1-5 computing time for exponents with more than 3072 bits.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/12/2020

Visualizing modular forms

We describe practical methods to visualize modular forms. We survey seve...
research
11/27/2017

Skip-Sliding Window Codes

Constrained coding is used widely in digital communication and storage s...
research
07/27/2022

Some New Methods to Generate Short Addition Chains

Modular exponentiation and scalar multiplication are important operation...
research
01/18/2023

Pseudorandom Generators for Sliding-Window Algorithms

A sliding-window algorithm of window size t is an algorithm whose curren...
research
02/02/2019

Efficient estimation of AUC in a sliding window

In many applications, monitoring area under the ROC curve (AUC) in a sli...
research
04/28/2020

Error Propagation Mitigation in Sliding Window Decoding of Braided Convolutional Codes

We investigate error propagation in sliding window decoding of braided c...
research
04/13/2012

Compensating Interpolation Distortion by Using New Optimized Modular Method

A modular method was suggested before to recover a band limited signal f...

Please sign up or login with your details

Forgot password? Click here to reset