Network

Elliptic curve cryptography (ECC) plays an important role in communication and information security. ECC is an approach to public-key cryptography based on the finite fields. We propose a hardware architecture for scalar multiplication, which is the main operation of ECC based on mixed coordinates (Lopez-Dahab) over GF(2163) in the Karatsuba multiplication polynomial representation. The proposed design is implemented using Verilog as a language and Xilinx virtex4Vlx15sf363-12 as a target device, and it is verified in Model Sim 6.3g. The results show that the proposed design occupies 30k slices with a delay of 35.086 ns.

Internet connections involve various security threats to computer networks and systems. Complexity of the threats and intrusions are ever-increasing so that development of flexible methods for ensuring security of computer systems has become a serious challenge ahead of computer experts. As an advantageous solution for development of intrusion detection systems, data mining is an effective technology to detect attempts for intrusions. The present paper is a try to optimize Apriori algorithm. To this end, data are divided equally between two systems and consequently considerable improvement in abnormal pattern is obtained. This study enables IDSs to detect intrusions faster and facilitates proper reactions.

Equalization techniques compensate for the time dispersion introduced by communication channels and combat the resulting inter-symbol interference (ISI) effect. The purpose of an adaptive equalizer is to operate on the channel output such that the cascade connection of the channel and the equalizer provides an approximation to an ideal transmission medium. This paper compares existing adaptive algorithm for channel equalisation for both DFT and DCT based OFDM system. Simulations results show that performance of Transform Domain Variable stepsize Griffith LMS(TVGLMS) algorithm in channel equalization performs with better convergence speed and better error misadjustment than the LMS algorithm. Further simulation results shows that DCT based OFDM system outperforms DFT –OFDM in terms of BER and PAPR .

Mobile Ad hoc Networks is a collection of wireless mobile nodes, which form temporary networks without relying on any existing infrastructure or centralized administration or standard support services regularly available in wide area networks to which the host may normally be connected. In this paper we review the security attacks on mobile adhoc networks like black hole, grey hole attacks etc. the study on security attacks and intrusion detection system has led us to illustrate some of the particular security issues.

Phishing is a criminal mechanism employing both social engineering and technical subterfuge to steal consumers’ personal identity data and financial account credentials. Social engineering schemes use spoofed e-mails purporting to be from legitimate businesses and agencies to lead consumers to counterfeit websites designed to trick recipients into divulging financial data such as usernames and passwords. Technical subterfuge schemes plant crimeware onto PCs to steal credentials directly, often using systems to intercept consumers online account user names and passwords and to corrupt local navigational infrastructures to misdirect consumers to counterfeit websites (or authentic websites through phisher controlled proxies used to monitor and intercept consumers’ keystrokes). Web sites that are frequently spoofed by phishers include PayPal, eBay, MSN, Yahoo, BestBuy etc. Some of the criminals behind phishing scams have even gone so far as to create websites that appear to be operated by government agencies. According to latest phishing reports submitted to APWG of 26,402 in March 2011 was down 35 percent from the all-time high of 40,621 in August, 2009.[1]Though many agencies, personnel’s working for combatting this problem new techniques have been developed to outsmart them. This paper aims to discuss latest phishing techniques, motivation, causes of vulnerability of systems in detail. This analysis aims to help users & organization to avoid being victims and to take primary preventive measures.

During this last decade, mesh networks have experienced strong growth due to their ability to provide an additional and complementary support for existing infrastructure communication systems. In such a network, routers are supposed to be fixed for short (e.g. public safety deployment) or long (e.g. network operator extension) period. This relative stability of infrastructure makes proactive routing protocols appropriate. One of the well known proactive routing protocols is OLSR (Optimized Link State Routing), which routing decisions are based on exchanges of topology information using all-to-all flooding of local information in order for each router to build a global knowledge of the topology. This study first goal is to improve the performance of topology information flooding in OLSR by introducing network coding techniques, which leads to a decrease of signaling overhead.

The proposed project is to implement a novel idea in Sensor networks. Normally Sensor networks are used to sense environment and collect data. Security in such networks is a big challenge. The first challenges of security in sensor networks lie in the conflicting interest between minimizing resource constraints and maximizing security. An implementation of operating system may reduce the risk level of handling secure data but sensor networks also introduce severe resource constraints due to their lack of data storage and power. Thus we employ a hardware cryptographic unit with low power consumption. The working memory of a sensor node is insufficient to even hold the variables (of sufficient length to ensure security) that are required in asymmetric cryptographic algorithms. A symmetrical key crypto security system will be less adequate to handle the modern secure threats, due to that a much complex asymmetric crypto system called elliptic curve cryptography is designed with various optimizing units(ex: pipeline, scheduling) to achieve greater security and to consume much power with reduced resources constraint.

The e-healthcare applications are considered as a promising field in wireless sensor networks, where patients can be monitored using wireless medical sensor networks (WMSN). Recent research in WMSN healthcare is focused on patient reliable communication, patient mobility, and energy-efficient routing. Deploying new technologies in healthcare applications without considering security makes patient privacy vulnerable. Security is a paramount requirement of healthcare applications, especially in the case of patient privacy, if the patient has an embarrassing disease. This paper will discuss on various security mechanism, privacy issues and requirement of e-healthcare applications.

In this paper we propose redundancy management of heterogeneous wireless sensor networks (HWSNs), utilizing multipath routing to answer user queries in the presence of unreliable and malicious nodes. The key concept of our redundancy management is to exploit the tradeoff between energy consumption vs. the gain in reliability, timeliness, and security to maximize the system useful lifetime. We formulate the tradeoff as an optimization problem for dynamically determining the best redundancy level to apply to multipath routing for intrusion tolerance so that the query response success probability is maximized while prolonging the useful lifetime. Furthermore, we consider this optimization problem for the case in which a voting-based distributed intrusion detection algorithm is applied to detect and evict malicious nodes in a HWSN. We develop a novel probability model to analyze the best redundancy level in terms of path redundancy and source redundancy, as well as the best intrusion detection settings in terms of the number of voters and the intrusion invocation interval under which the lifetime of a HWSN is maximized. We then apply the analysis results obtained to the design of a dynamic redundancy management algorithm to identify and apply the best design parameter settings at runtime in response to environment changes, to maximize the HWSN lifetime.

An Ad-hoc network is a collection of mobile nodes dynamically forming a temporary network without the use of any existing network infrastructure or centralized administer. Because of limited communication range among mobile nodes in ad-hoc network, several network hopes may be needed to deliver a packet from one node to another node in the wireless network. In such a network each node acts as an end system as well as a relay node (or router). Most of the routing algorithms designed for MANET such as AODV and DSR are based on the assumption that every node forwards every packet. But in practice some of the nodes may act as the selfish nodes. These nodes use the network and its services but they do not cooperate with other nodes. Such selfish nodes do not consume any energy such as CPU power, battery and also bandwidth for retransmitting the data of other nodes and they reserve them only for themselves. The original AODV and DSR routing algorithms can be modified to detect such selfish nodes. In this paper, we survey innovated techniques as well as proposed techniques to detect Selfish Nodes for MANET. Finally we provide some directions for further research.