Memory-Efficient Random Order Exponentiation Algorithm
نویسندگان
چکیده
منابع مشابه
Random Order m-ary Exponentiation
This paper describes am-ary exponentiation algorithm where the radix-m digits of an exponent can be treated in a somewhat random order without using any more group operations than a standard rightto-left m-ary exponentiation. This paper demonstrates that the random order countermeasure, commonly used to protect implementations of secret key cryptographic algorithms, can be applied to public key...
متن کاملEfficient Modular Exponentiation Architectures for RSA Algorithm
-Cryptosystems are used to send confidential messages in secure manner. The most important and efficient type of cryptosystem is RSA. RSA is used in various sectors such as Bank security and Internet protection. One of the various steps involved in RSA is Modular exponentiation, which is used in both Encryption and Decryption. It takes high memory and computation time of algorithm. In order to ...
متن کاملAn Efficient Montgomery Exponentiation Algorithm for Cryptographic Applications
Efficient computation of the modular exponentiations is very important and useful for public-key cryptosystems. In this paper, an efficient parallel binary exponentiation algorithm is proposed which based on the Montgomery multiplication algorithm, the signed-digit-folding (SDF) and common-multiplicand-multiplicand (CMM) techniques. By using the CMM technique of computing the common part from t...
متن کاملMIST: An Efficient, Randomized Exponentiation Algorithm for Resisting Power Analysis
The Mist algorithm generates randomly different addition chains for performing a particular exponentiation. This means that power attacks which require averaging over a number of exponentiation power traces becomes impossible. Moreover, attacks which are based on recognising repeated use of the same pre-computed multipliers during an individual exponentiation are also infeasible. The algorithm ...
متن کاملEfficient elliptic curve exponentiation
Elliptic curve cryptosystems, proposed by Koblitz([8]) and Miller([11]), can be constructed over a smaller definition field than the ElGamal cryptosystems([5]) or the RSA cryptosystems([16]). This is why elliptic curve cryptosystems have begun to attract notice. There are mainly two types in elliptic curve cryptosystems, elliptic curves E over IF2r and E over IFp. Some current systems based on ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.3015099