Efficient Modular Exponentiation Methods for RSA

Date

2015-11-03

Author

Güner, Hatice
Cenk, Murat
Çalık, Çağdaş

Metadata

Show full item record

Item Usage Stats

237
views

0
downloads

RSA is a commonly used asymmetric key cryptosystem that is used in encrypting and signing messages. The efficiency of the implementation is an important factor in effectively using the system. The RSA algorithm heavily depends on the modular exponentiation operation on large integers. A drawback of this system is that it becomes inefficient so quickly when the parameters are adjusted to increase security. This situation causes the operations to be performed with large numbers. Therefore, implementations require the utilization of faster methods than the traditional ones. One popular modular exponentiation method is the repeated squaring and multiplication algorithm. In this study, we examine some of the modular exponentiation algorithms and implement them for comparison with the repeated squaring and multiplication algorithm. The results suggest that particular cases of studied methods provide at least 23% improvement over the repeated squaring and multiplication algorithm.

URI

https://hdl.handle.net/11511/75120
https://www.iscturkey.org/assets/files/2016/03/iscturkeyHaticeK%C3%BCbraG%C3%BCner.pdf

Conference Name

ISC Turkey 2015, (30 - 31 Ekim 2015)

Collections

Graduate School of Applied Mathematics, Conference / Seminar

Suggestions

OpenMETU
Core

Efficient multivariate-based ring signature schemes Demircioğlu, Murat; Cenk, Murat; Akleylek, Sedat; Department of Cryptography (2022-8-4) The ring signature scheme has a wide range of usage areas in public-key cryptography. One is leaking information within a group without exposing the signer's identity. The majority of the ring signature techniques in use, on the other hand, rely on classical crypto-systems such as RSA and ECDH, which are known to be vulnerable to Shor's algorithm on a large-scale quantum computer. In this thesis, we propose efficient quantum-resistant ring signature schemes based on GeMSS and Gui signature algorithms. Gui w...
Infinite length hash chains and their applications Bicakci, K; Baykal, Nazife (2002-06-12) Hash Chains are used extensively in various cryptography, applications such as one-time passwords, server-supported signatures and micropayments. In this paper, we present a method, called Infinite Length Hash Chains to improve the flexibility of this chaining idea by using public-key techniques. One of its distinguishing features is that communication and computation overhead of restarting of the system is avoided. For the owner of the chain it is possible to go in either way in the chain at any time witho...
Design and analysis of hash functions Koçak, Onur; Doğanaksoy, Ali; Department of Cryptography (2009) Hash functions are cryptographic tools that are used in various applications like digital signature, message integrity checking, password storage and random number generation. These cryptographic primitives were, first, constructed using modular arithmetical operations which were popular at that time because of public key cryptography. Later, in 1989, Merkle and Damgard independently proposed an iterative construction method. This method was easy to implement and had a security proof. MD-4 was the first has...
Efficient GeMSS Based Ring Signature Scheme Demircioğlu, Murat; Akleylek, Sedat; Cenk, Murat (2019-06-18) The ring signature scheme has an important usage area of public key crypto-system. It can be used for e-voting,as well as leaking information without revealing identity within a group. However, mostof these systems relies ontraditional crypto-systems which are not secure against quantum computing related attacks. Multivariate cryptography is one of themost popular researchareas on quantum resilient crypto-systems. In this work, we propose an efficient ring signature scheme based on GeM...
On Measuring Security Bounds of Some Ciphers Using Mixed Integer Linear Programming (MILP) Approach Türesin, Can; Doğanaksoy, Ali; Koçak, Onur; Department of Cryptography (2021-9-6) Block ciphers are one of the symmetric key encryption algorithms that are used in many devices. Its increasing popularity has led to the emergence of new cryptanalysis methods. Therefore, measuring block cipher's security bounds is one main indispensable need for its designers. Two of the most effective attacks on block ciphers are differential and linear cryptanalysis and these attacks' efficiencies are bonded with a number of active S-boxes of the cipher after a certain number of rounds. Consequently, mea...

Citation Formats

H. Güner, M. Cenk, and Ç. Çalık, “Efficient Modular Exponentiation Methods for RSA,” presented at the ISC Turkey 2015, (30 - 31 Ekim 2015), 2015, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/75120.