Secure Antnet Routing Algorithm for Scalable Adhoc Networks Using Elliptic Curve Cryptography

Vijayalakshmi, V.; Palanivelu, T.G.

doi:10.3844/jcssp.2007.939.943

Cited by 9 publications

(6 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These algorithms are used in our bit-serial hardware architecture to calculate scalar multiplication. Double-and-add algorithm is chosen as it is dictated in ANSI (Greenlee, 1999) for scalar multiplication (Vijayalakshmi and Palanivelu, 2007). The double-and-add algorithm is a fundamental technique in calculating scalar multiplication.…”

Section: Msb (Double-and-add)mentioning

confidence: 99%

A Bit-Serial Multiplier Architecture for Finite Fields Over Galois Fields

Modares¹

2010

Journal of Computer Science

View full text Add to dashboard Cite

Problem statement:A fundamental building block for digital communication is the Publickey cryptography systems. Public-Key Cryptography (PKC) systems can be used to provide secure communications over insecure channels without exchanging a secret key. Implementing Public-Key cryptography systems is a challenge for most application platforms when several factors have to be considered in selecting the implementation platform. Approach: The most popular public-key cryptography systems nowadays are RSA and Elliptic Curve Cryptography (ECC). ECC was considered much more suitable than other public-key algorithms. It used lower power consumption, has higher performance and can be implemented on small areas that can be achieved by using ECC. There is no sub exponential-time algorithm in solving the Elliptic curve discrete logarithm problem. Therefore, it offers smaller key size with equivalent security level compared with the other public key cryptosystems. Finite fields (or Galois fields) is considered as an important mathematical theory. Results: Thus, it plays an important role in cryptography. As a result of their carry free arithmetic property, they are suitable to be used in hardware implementation in ECC. In cryptography the most common finite field used is binary field GF (2 m ). Conclusion: Our design performs all basic binary polynomial operations in Galois Field (GF) using a microcode structure. It uses a bit-serial and pipeline structure for implementing GF operations. Due to its bit-serial architecture, it has a low gate count and a reduced number of I/O pins.

show abstract

Section: Msb (Double-and-add)mentioning

confidence: 99%

A Bit-Serial Multiplier Architecture for Finite Fields Over Galois Fields

Modares¹

2010

Journal of Computer Science

View full text Add to dashboard Cite

show abstract

“…Against this popular belief, ECC is being implemented as a PKC scheme for a resource constrained systems like MANETs. Using the Antnet routing algorithm, the mutual authentication between source and destination is done by master key exchange using ECC in [19]. Ertaul et al [20] implement ECC based Threshold Cryptography (ECC-TC), and explore three efficient ECC encryption algorithms, putting forth the possibility of using these algorithms in different scenarios in a MANET.…”

Section: Wireless Networkmentioning

confidence: 99%

A Survey on Elliptic Curve Cryptography for Pervasive Computing Environment

Katiyar¹,

Dutta²,

Gupta³

2010

IJCA

View full text Add to dashboard Cite

In today"s era of the ubiquitous computing, the Internet has become the main mode of data communication. Most of the devices used in wireless/mobile environments, that form wireless networks, ad-hoc networks and wireless sensor networks etc., have low computational power, memory and limited battery power. In such a Pervasive Computing environment, providing security to data becomes a complex task. Elliptic Curve Cryptography (ECC) has become the preferred choice for the pervasive computing environment because of its suitability to the devices having limited bandwidth, battery power, less computational resources and less memory. This paper provides an introduction to ECC and presents a survey on the current use of ECC in the pervasive computing environment. General TermsSecurity in pervasive environment.

show abstract

“…SAR-ECC V. Vijayalakshmi and T.G. Palanivelu [87] have proposed a secure ant based routing algorithm for cluster based ad hoc networks using Elliptic Curve Cryptography (ECC) [88], which is abbreviated as SAR-ECC from here on. This approach makes use of two basic processes: one is estimating the trust value between neighbor nodes.…”

Section: Security Aware Aco-based Routing Protocolsmentioning

confidence: 99%

“…There are different ways to set up trust models. S. Sethi and S. K. Udgata [96] have applied the fuzzy logic to estimate the trust values in their protocol FTAR, while the other researchers [87], [89], [100] have applied authentication mechanisms to create their own trust models. From the observations, it shows that the combination of fuzzy logic and ACO could be well suited to improving the security in MANETs.…”

Section: Security Aware Aco-based Routing Protocolsmentioning

confidence: 99%

“…In this subsection, the different parameters for the location aware ACO routing protocols are presented in table 2.7 and 2.8. [87] reactive unicast unknown SPA-ARA [89] reactive both BANTs FTAR [96] reactive broadcast FANTs SBDT [97] reactive unknown unknown DBA-ACO [98] reactive unknown unknown ANTNET [99] reactive unknown ANTs ABPKM [100] reactive unicast BANTs © 2017 IEEE In some of the reviewed protocols, RREQs and RREPs are also used in the route discovery phase.…”

Section: Comparison Of Location Based Aco-based Routing Protocolsmentioning

confidence: 99%

See 1 more Smart Citation

A Security Aware Fuzzy Enhanced ACO Routing Protocol in MANETs

Zhang¹

View full text Add to dashboard Cite

As Mobile Ad hoc NETworks (MANETs) grow more popular and are deployed as solutions in various applications such as road safety in Vehicular Ad hoc NETworks (VANETs), wildlife tracking in Wireless Sensor Networks (WSNs) and Device-to-Device (D2D) communications in 5G, the need for efficient routing that is robust against malfunctioning or malicious network nodes is increasing. A fuzzy logic enhanced Ant Colony Optimization (ACO)-based routing algorithm, which addresses these issues, is proposed in this thesis. The Security Aware Fuzzy Enhanced Ant Colony Optimization (SAFEACO) routing protocol makes use of a distributed fuzzy logic module to identify misbehaving nodes and exclude them from the routing process. The SAFEACO routing protocol is implemented in the NS-3 simulator and various experiments have been performed in both MANET and VANET scenarios. The performance of SAFEACO is compared with other modern and widely known approaches. Simulation results show that SAFEACO has superior performance in all relevant metrics, such as packet delivery ratio (PDR) and end-to-end delay. Due to its ability to identify misbehaving nodes, SAFEACO also provides a higher level of robustness against black hole, Sybil and flooding attacks.

show abstract

Secure Antnet Routing Algorithm for Scalable Adhoc Networks Using Elliptic Curve Cryptography

Cited by 9 publications

References 10 publications

A Bit-Serial Multiplier Architecture for Finite Fields Over Galois Fields

A Bit-Serial Multiplier Architecture for Finite Fields Over Galois Fields

A Survey on Elliptic Curve Cryptography for Pervasive Computing Environment

A Security Aware Fuzzy Enhanced ACO Routing Protocol in MANETs

Contact Info

Product

Resources

About