RSA cryptosystem design based on the Chinese remainder theorem

Wu, Chun-Wei; Hong, Jinhua; Wu, Cheng‐Wen

doi:10.1145/370155.370419

Cited by 38 publications

(9 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This paper shows how CRT decryption gives better performance compared to RSA decryption method. RSA Cryptosystem Design Based on Chinese Remainder Theorem [24] proposes a systolic RSA cryptosystem based on a modified Montgomery's algorithm and the Chinese Remainder Theorem (CRT) technique. The CRT technique improves the throughput rate up to 4 times in the best case.…”

Section: Review Of Past Workmentioning

confidence: 99%

RSRP: A Robust Secure Routing Protocol in MANET

Sinha

Bhattacharya

Chaki

2014

Foundations of Computing and Decision Sciences

View full text Add to dashboard Cite

In this paper, we propose a novel algorithm RSRP to build a robust secure routing protocol in mobile ad-hoc networks (MANETs). This algorithm is based on some basic schemes such as RSA_CRT for encryption and decryption of messages; CRT for safety key generation, Shamir's secret sharing principle for generation of secure routes. Those routes which are free from any malicious node and which belong to the set of disjoint routes between a source-destination pair are considered as probable routes. Shamir's secret sharing principle is applied on those probable routes to obtain secure routes. Finally, most trustworthy and stable route is selected among those secure routes. Selection of the final route depends on some criteria of the nodes present in a route e.g.: battery power, mobility and trust value. In addition, complexity of key generation is reduced to a large extent by using RSA-CRT instead of RSA. In turn, the routing becomes less expensive and most secure and robust one. Performance of this routing protocol is then compared with non-secure routing protocols (AODV and DSR), secure routing scheme using secret sharing, security routing protocol using ZRP and SEAD depending on basic characteristics of these protocols. All such comparisons show that RSRP shows better performance in terms of computational cost, end-to-end delay and packet dropping in presence of malicious nodes in the MANET, keeping the overhead in terms of control packets same as other secure routing protocols.

show abstract

Section: Review Of Past Workmentioning

confidence: 99%

RSRP: A Robust Secure Routing Protocol in MANET

Sinha

Bhattacharya

Chaki

2014

Foundations of Computing and Decision Sciences

View full text Add to dashboard Cite

show abstract

“…In order to generate QSs satisfying the RmCR, two different approaches were proposed in [25], based on an uniform karbiter [26] and Chinese Remainder Theorem (CRT) [27] quorum system. We do not show here the related definitions, theorems, and proofs since they can be found in [25].…”

Section: Journal Of Electrical and Computer Engineeringmentioning

confidence: 99%

Quorum Systems towards an Asynchronous Communication in Cognitive Radio Networks

Romaszko

Mähönen

2012

Journal of Electrical and Computer Engineering

View full text Add to dashboard Cite

This paper reviews quorum systems (QS) from the perspective of cognitive radio networks. Quorum systems were originally developed for and widely used in the scope of operating systems. Recently, quorum systems have been also started to be applied to wireless communications. The objective of this paper is threefold. First, the paper provides survey and guidance on the use of quorum systems. Second, it shows that QS properties provide an interesting alternative towards an asynchronous communication in cognitive radio ad hoc networks (CRANs). Due to properties of quorum systems it is possible to establish CRANs without employing a common control channel (CCC), perfect synchronization, or central controller architecture. QS properties can be efficiently utilized to handle the rendezvous (RDV) problem in CRANs. New RDV protocols must be designed in such a way that there is a guarantee that all nodes meet periodically within reasonable periods of time. Since pseudorandom solutions do not provide this guarantee, systematic approaches are needed such as QSs. Third, we also propose a novel distributed RDV protocol, MtQS-DSrdv, which is based on mirror torus QS and difference set concepts. The proposed protocol guarantees RDVs on all available channels while CR nodes have the same channel set.

show abstract

“…The work by Minni et al (2013) introduced an enhanced RSA algorithm in which the distribution of n was eliminated from the key so that one cannot trace back to the factors p and q. A systolic RSA cryptosystem based on modified Montgomery's algorithm and the Chinese Remainder Theorem (CRT) technique was developed by Wu et al (2001) based on hardware implementations. Another variant of RSA called the BEAIRSA (Batch Encrypt Assistant Improved RSA) was developed by Liu et al (2011) to improve the Batch RSA decryption performance by transferring some decryption computations to encryption in modular exponentiation.…”

Section: Introductionmentioning

confidence: 99%