Adaptive Modular Exponentiation Methods v.s. Python's Power Function
نویسندگان
چکیده
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.
منابع مشابه
The Consistency Analysis of Addition Chains for Several Fast Algorithm of Modular Exponentiation
Modular exponentiation is the most frequently used and time-cost part in RSA, its fast algorithm is one of the focuses of RSA study, and to speed up the computation of modular exponentiation is most important to the performance and wide use of RSA. This paper studies Qin Jiu-shao algorithm, Blocking algorithm, Addition Chains algorithm, and Adaptive Binary Partition Table Searching Method. Anot...
متن کاملAdaptive Soundness of Static Equivalence
We define a framework to reason about implementations of equational theories in the presence of an adaptive adversary. We particularly focus on soundess of static equivalence. We illustrate our framework on different equational theories: symmetric encryption, modular exponentiation and also joint theories of encryption and modular exponentiation. Finally, we define a model for symbolic analysis...
متن کاملCRT RSA Algorithm Protected Against Fault Attacks
Embedded devices performing RSA signatures are subject to Fault Attacks, particularly when the Chinese Remainder Theorem is used. In most cases, the modular exponentiation and the Garner recombination algorithms are targeted. To thwart Fault Attacks, we propose a new generic method of computing modular exponentiation and we prove its security in a realistic fault model. By construction, our pro...
متن کاملCollision-Based Power Analysis of Modular Exponentiation Using Chosen-Message Pairs
This paper proposes new chosen-message power-analysis attacks against public-key cryptosystems based on modular exponentiation, which use specific input pairs to generate collisions between squaring operations at different locations in the two power traces. Unlike previous attacks of this kind, the new attacks can be applied to all the standard implementations of the exponentiation process: bin...
متن کاملOne-Trial Electromagnetic Attack on Modular Exponentiation
Correlative side-channel attack based on ensembles of test sequences is developed. For conducted and radiated electromagnetic analysis the maximal eavesdrop distance is estimated. By a low-cost measurement system developed for noninvasive monitoring of smart cards power consumption an attack on modular exponentiation, based on one power trace only, is realized.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1707.01898 شماره
صفحات -
تاریخ انتشار 2017