Online communication is one of the common means of communication in this era of globe village. As the number of people being connected to online communication system through their mobile phone, computer or any other e-communication tools increases, there is need to secure the communication networks from adversaries (third parties) between the sender and receivers. There are many aspects to security approach in online communication environment. One essential aspect for secure communications is that of cryptography, which is the focus of this research. This research work aims at designing and implementing cryptosystem using a simple polyalphabetic cipher algorithm. The algorithm was coded with Java programming language. It was discovered that cryptography system with polyalphabetic cipher algorithm is better compared to Atbash cipher, Scytale cipher, Ceasar cipher etc, because it is very difficult for adversaries to decrypt an encrypted data without the key.
Forestalling Meticulous Jam Attacks Using Packet-Hiding TechniquesEswar Publications
The open nature of the wireless medium leaves it liable to intentional interference attacks, generally said as jam.
This intentional interference with wireless transmissions is used as a launch pad for mounting Denial-of-Service attacks on wireless networks. Typically, jam has been self-addressed beneath associate external threat model.
However, adversaries with internal information of protocol specifications and network secrets will launch loweffort
jam attacks that are troublesome to notice and counter. during this work, we have a tendency to address the matter of jamming attacks in wireless networks. In these attacks, the resister is active just for a brief amount of your time, by selection targeting messages of high importance. In our work two offender nodes (node that creates jamming) and introduce one new node i.e sender node. The new node(jammer node) is at intervals the twenty five nodes. Victimization that new sender node we have to eliminate the offender nodes absolutely. We have a tendency to conclude that however jam happens within the network and approach of elimination of the offender nodes
victimization new sender node. We propose mistrial approach for avoid flooding packets in jammer network. We conclude the performance between the mistrial and damping approach for avoid jamming packets We have a tendency to illustrate the benefits of {selective jam|spot-jamming|jamming|electronic jamming|jam} in terms of network performance degradation and resister effort by to beat the sender in network with the assistance of recent jamming node. We illustrate the benefits of jam|spot-jamming|jamming|electronic-jamming|jam} in terms of network performance degradation and human effort by to beat the sender in network with the assistance of recent
jamming node.
A Study on Access Point Selection Algorithms in Wireless Mesh NetworksEswar Publications
This document discusses access point (AP) selection algorithms in wireless mesh networks (WMNs). It analyzes the limitations of the traditional AP selection method defined by IEEE 802.11, which is based solely on received signal strength. The paper studies AP selection as a key problem in WMNs and identifies important parameters that should be considered, such as link quality, load balancing, cross-layer interactions, and dynamic association. It also provides directions for designing new AP selection metrics that are better suited for WMN environments.
Survey on Efficient and Secure Anonymous Communication in ManetsEditor IJCATR
Mobile ad-hoc networks require anonymous communications in order to thwart new wireless passive attacks; and to protect new
assets of information such as nodes locations, motion patterns, network topology and traffic patterns in addition to conventional identity and
message privacy. The transmitted routing messages and cached active routing entries leave plenty of opportunities for eavesdroppers.
Anonymity and location privacy guarantees for the deployed ad hoc networks are critical in military and real time communication systems,
otherwise the entire mission may be compromised. This poses challenging constraints on MANET routing and data forwarding. To address
the new challenges, several anonymous routing schemes have been proposed recently.
The peer-reviewed International Journal of Engineering Inventions (IJEI) is started with a mission to encourage contribution to research in Science and Technology. Encourage and motivate researchers in challenging areas of Sciences and Technology.
A comparitive study of efficient anonymous routing protocols in maneteSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Analyzing the Impact of Eaves on Energy Consumption of AODV Routing Protocol ...ijwmn
The document analyzes the impact of an eavesdropper on the energy consumption of the AODV routing protocol in mobile ad hoc networks (MANETs). Simulations were conducted using the QualNet simulator for 20, 40, 60, 80, and 100 nodes. The results show that the presence of an eavesdropper degrades network performance and increases energy consumption compared to the standard AODV protocol. Specifically, throughput was lower, delay and jitter were higher, and transmit energy usage increased in scenarios with an eavesdropper node. The eavesdropper attracts network traffic, forcing nodes to transmit more and reducing overall efficiency.
This document summarizes a research paper on reducing packet loss in mobile ad hoc networks (MANETs). The paper discusses how MANETs are vulnerable to various security threats like black hole attacks that can cause packet dropping. It evaluates existing authentication schemes like ACK-based schemes that have overhead issues. The paper then proposes a modified ACK-based scheme using finite state automata to overcome decision ambiguity and minimize packet dropping while authenticating nodes in the MANET. Simulation results show that the proposed approach improves packet delivery ratio, throughput and reduces routing load compared to not using secure authentication.
This document summarizes security attacks on routing protocols in mobile ad hoc wireless networks. It discusses characteristics of ad hoc networks, including dynamic network topology and fluctuating link capacity. It describes problems with routing protocols, such as energy consumption and rapid node movement. It also outlines various security attacks like passive eavesdropping and active attacks that modify or inject false packets. Finally, it examines security solutions for ad hoc networks, including the Security Aware Ad Hoc Routing protocol, Authenticated Routing for Ad Hoc Networks protocol, and Cooperation of Nodes Fairness in Dynamic Ad-hoc NeTworks protocol.
Forestalling Meticulous Jam Attacks Using Packet-Hiding TechniquesEswar Publications
The open nature of the wireless medium leaves it liable to intentional interference attacks, generally said as jam.
This intentional interference with wireless transmissions is used as a launch pad for mounting Denial-of-Service attacks on wireless networks. Typically, jam has been self-addressed beneath associate external threat model.
However, adversaries with internal information of protocol specifications and network secrets will launch loweffort
jam attacks that are troublesome to notice and counter. during this work, we have a tendency to address the matter of jamming attacks in wireless networks. In these attacks, the resister is active just for a brief amount of your time, by selection targeting messages of high importance. In our work two offender nodes (node that creates jamming) and introduce one new node i.e sender node. The new node(jammer node) is at intervals the twenty five nodes. Victimization that new sender node we have to eliminate the offender nodes absolutely. We have a tendency to conclude that however jam happens within the network and approach of elimination of the offender nodes
victimization new sender node. We propose mistrial approach for avoid flooding packets in jammer network. We conclude the performance between the mistrial and damping approach for avoid jamming packets We have a tendency to illustrate the benefits of {selective jam|spot-jamming|jamming|electronic jamming|jam} in terms of network performance degradation and resister effort by to beat the sender in network with the assistance of recent jamming node. We illustrate the benefits of jam|spot-jamming|jamming|electronic-jamming|jam} in terms of network performance degradation and human effort by to beat the sender in network with the assistance of recent
jamming node.
A Study on Access Point Selection Algorithms in Wireless Mesh NetworksEswar Publications
This document discusses access point (AP) selection algorithms in wireless mesh networks (WMNs). It analyzes the limitations of the traditional AP selection method defined by IEEE 802.11, which is based solely on received signal strength. The paper studies AP selection as a key problem in WMNs and identifies important parameters that should be considered, such as link quality, load balancing, cross-layer interactions, and dynamic association. It also provides directions for designing new AP selection metrics that are better suited for WMN environments.
Survey on Efficient and Secure Anonymous Communication in ManetsEditor IJCATR
Mobile ad-hoc networks require anonymous communications in order to thwart new wireless passive attacks; and to protect new
assets of information such as nodes locations, motion patterns, network topology and traffic patterns in addition to conventional identity and
message privacy. The transmitted routing messages and cached active routing entries leave plenty of opportunities for eavesdroppers.
Anonymity and location privacy guarantees for the deployed ad hoc networks are critical in military and real time communication systems,
otherwise the entire mission may be compromised. This poses challenging constraints on MANET routing and data forwarding. To address
the new challenges, several anonymous routing schemes have been proposed recently.
The peer-reviewed International Journal of Engineering Inventions (IJEI) is started with a mission to encourage contribution to research in Science and Technology. Encourage and motivate researchers in challenging areas of Sciences and Technology.
A comparitive study of efficient anonymous routing protocols in maneteSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Analyzing the Impact of Eaves on Energy Consumption of AODV Routing Protocol ...ijwmn
The document analyzes the impact of an eavesdropper on the energy consumption of the AODV routing protocol in mobile ad hoc networks (MANETs). Simulations were conducted using the QualNet simulator for 20, 40, 60, 80, and 100 nodes. The results show that the presence of an eavesdropper degrades network performance and increases energy consumption compared to the standard AODV protocol. Specifically, throughput was lower, delay and jitter were higher, and transmit energy usage increased in scenarios with an eavesdropper node. The eavesdropper attracts network traffic, forcing nodes to transmit more and reducing overall efficiency.
This document summarizes a research paper on reducing packet loss in mobile ad hoc networks (MANETs). The paper discusses how MANETs are vulnerable to various security threats like black hole attacks that can cause packet dropping. It evaluates existing authentication schemes like ACK-based schemes that have overhead issues. The paper then proposes a modified ACK-based scheme using finite state automata to overcome decision ambiguity and minimize packet dropping while authenticating nodes in the MANET. Simulation results show that the proposed approach improves packet delivery ratio, throughput and reduces routing load compared to not using secure authentication.
This document summarizes security attacks on routing protocols in mobile ad hoc wireless networks. It discusses characteristics of ad hoc networks, including dynamic network topology and fluctuating link capacity. It describes problems with routing protocols, such as energy consumption and rapid node movement. It also outlines various security attacks like passive eavesdropping and active attacks that modify or inject false packets. Finally, it examines security solutions for ad hoc networks, including the Security Aware Ad Hoc Routing protocol, Authenticated Routing for Ad Hoc Networks protocol, and Cooperation of Nodes Fairness in Dynamic Ad-hoc NeTworks protocol.
Ad hoc networks are the special networks formed for specific applications. Operating in ad-hoc mode
allows all wireless devices within range of each other to discover and communicate in a peer-to-peer
fashion without involving central access points. Many routing protocols like AODV, DSR etc have been
proposed for these networks to find an end to end path between the nodes. These routing protocols are
prone to attacks by the malicious nodes. There is a need to detect and prevent these attacks in a timely
manner before destruction of network services.
A Distributed Approach for Detecting Wormhole Attack in Wireless Network Codi...IRJET Journal
This document presents a distributed algorithm called DAWN to detect wormhole attacks in wireless network coding systems. The algorithm has two phases: 1) a detection phase where each node uses the expected transmission count (ETX) metric to detect if any attackers exist, and 2) a reporting phase where detected attackers are reported to other nodes. ETX represents the number of transmissions needed for a packet to be received and can reveal the network topology. DAWN examines the order nodes receive packets and their ETX values to identify attackers. It signatures reports to prevent manipulation and distributes the workload of detection across all nodes. The algorithm successfully detects wormhole attacks with high rates while imposing low computation and communication overhead.
The International Journal of Engineering and Science (The IJES)theijes
The document summarizes a study on the Enhanced Adaptive Acknowledge (EAACK) scheme for detecting misbehaving nodes in mobile ad hoc networks (MANETs). It discusses the limitations of existing acknowledgment-based intrusion detection systems like Watchdog, TWOACK, and AACK in handling receiver collisions. The key issues related to acknowledgment-based schemes for detecting misbehavior in MANETs are addressed. The focus is on analyzing the limitations of acknowledgment approaches like AACK and studying EAACK as an improved approach for addressing receiver collisions in MANETs.
Serial Communication Interface with Error Detectioniosrjce
UART is used for serial data communication. UART is a piece of computer hardware that translates
between parallel bits of data and serial bits. UART is usually an integrated circuit used for serial
communications over a computer or peripheral device serial port. Bits have to be moved from one place to
another using wires or some other medium. Over many miles, the expense of the wires becomes large. To reduce
the expense of long communication links carrying several bits in parallel, data bits are sent sequentially. Errors
may occur either internally or externally while we transmit information from source to destination. The errors
generated during the transmission would affect the performance of the overall system. In order to reduce the
errors we should incorporate any error detecting schemes like hamming decoder, check parity systems etc.
Different serial communication devices are available.
This document discusses the detection of black hole attacks in mobile ad hoc networks (MANETs) that use the Ad Hoc On-Demand Distance Vector (AODV) routing protocol. It proposes using authentication techniques including authenticated nodes, authentication on paths, authentication key packets, and a data routing information table on each node to detect black hole nodes. An example network is presented to demonstrate how the proposed techniques would detect a black hole node by analyzing authentication packet responses. The goal is to securely route data packets by detecting malicious nodes using these authentication methods.
An overview of contemporary security problems in wireless mesh networksiosrjce
Wireless mesh network (WMN) is a new wireless networking concept. Unlike traditional
wireless networks, Wireless Mesh Networks do not rely on any fixed communications. As an
alternative, hosts rely on each other to keep the network connected. Wireless Internet service
providers are choosing WMNs to offer Internet connectivity, as it allows a fast, simple and
inexpensive network use. One major challenge in design of these networks is their vulnerability to
security attacks. In this paper, principal contemporary security issues for wireless mesh networks
have been investigated. Identification of the threats a Wireless mesh network faces and the security
goals to be realized are described. The new challenges and opportunities posed by this new
networking environment are dealt with and explored approaches to secure its communication.
Mobile Ad hoc Network is basically a crew of mobile traffic nodes, which figure an effectual dynamic topology and built a resource mannered network. Mobile Ad hoc Networks are exceptional cases of ad hoc networks that, but it is lacking infrastructure, communicating entities pass with various accelerations. For that reason, this impedes or delay lays the foundation of well built end-to-end communication paths. So Mobile Ad-hoc Network having efficient data transfer. In this manner, MANETs have out of the common network concerns and security challenges to get the advanced connectivity, immune communications, and reputation executives systems which have an impact on the trust in cooperation and settlement between mobile networking units. In this survey paper we confer about the security attributes, attacks, and challenges of MANETs.So, it is important to have a better and good formation algorithm to connect all the nodes to each other. There must be less time, low delay time, more battery life, more speeds of packets.
International Journal of Computational Engineering Research(IJCER)ijceronline
1. The document discusses selective jamming attacks in wireless networks. Selective jamming attacks target important messages to degrade network performance.
2. The authors develop three schemes that combine cryptographic techniques with physical layer attributes to prevent real-time packet classification and mitigate selective jamming attacks.
3. The schemes are analyzed for their security and computational and communication overhead. The schemes aim to prevent adversaries from identifying important messages to selectively jam on the physical layer.
This document provides an overview of the AODV routing protocol for ad hoc networks and security issues associated with it. It first introduces ad hoc networks and discusses the basic differences between infrastructure and ad hoc networks. It then summarizes several popular routing protocols for ad hoc networks, including DSDV, DSR, TORA, and AODV. The document focuses on explaining the route discovery and maintenance processes of AODV. It also discusses common security attacks against AODV like black hole attacks and wormhole attacks. Finally, it mentions some approaches to secure AODV like using digital signatures, authentication, and intrusion detection systems.
A SYMMETRIC TOKEN ROUTING FOR SECURED COMMUNICATION OF MANET cscpconf
The communication should be much secured in Mobile Adhoc Networks in the
protective environment such as Military atmosphere and in a disaster relief. Due to the attackers,
Mobile Adhoc Networks resulting in denial of Service attacks modify packets, Error packets,
Missing Packets, Theft of Nodes, etc. To overcome this problem, We propose a new Symmetric
Token Routing Protocol (STRP) for mobile ad hoc networks provides much security against
MANET. The proposed protocol distributed a secured shared symmetric token for each node to
provide security against hackers and attackers. Simulation results shows the better delivery against
the existing protocol in MANET.
A SURVEY OF ENERGY-EFFICIENT COMMUNICATION PROTOCOLS IN WSNIAEME Publication
Wireless sensor networks are harshly restricted by storage capacity, energy and computing power. Wireless Sensor Networks have acquired a lot of attention by research community, manufacturer as well as actual users for monitoring remote trades and how to gather data in different environment. The wireless sensor nodes are especially battery powered devices having life can be extended for some times while long lasting and reliable for maintaining consumption of energy and network lifetime while designs applications and protocols. So it is essential to design effective and energy efficient protocol in order to enhance the network lifetime. In this paper we present the study of different energy efficient communication protocols of Wireless Sensor Networks (WSNs).Then some of the communication protocols which are widely used in WSNs to improve network performance are also discussed advantages and disadvantages of each protocols.
SR-Code: Smart Relay Network Coding for Data Collection for Wireless Sensor N...IJERA Editor
Reliability in data collection for wireless sensor networks is one of the major problems in IoT applications. Sensor nodes are usually placed in harsh conditions where data communication is at risk of losing packets. Retransmissions are considered costly in terms of delay and power consumptions, especially that wireless sensor nodes are battery operated. In this context we introduce SR-Code, a novel network coding algorithm that achieves reliability in harsh conditions. SR-Code utilizes the XOR operator to code overheard packets. The targeted network topology is a 2-tier network where data loss can occur in all tiers. SR-Code utilizes bit addresses where each node is identified by a single bit in an address bit vector. Identifying packets and computing the cardinality of coded messages can be easily done using address bit vectors. SR-Code realizes redundancy as a function of overheard packet. SR-Code achieved a reliability factor of 75% when the number of packets lost was 100% of the original (un-coded) packet sent.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
An Adaptive Mobility Based Attack Detection Mechanism to Detect Selective For...paperpublications3
Abstract: In this paper propose Mobile network based attack detection of Selective Forwarding Attacks in Wireless Sensor Networks. In existing method only used static network and mobility network require high energy and time. So these problems can be overcome by using Mobile network based attack detection. The wireless sensor network has become a hot research area due its wide range of application in military and civilian domain, but as it uses wireless media for communication these are easily prone to security attacks. Selective forwarding attacks are most effective when the attacker is explicitly included on the path of a data flow. Selective forwarding and black hole attacks are very disastrous attacks for sensor networks if used with sinkhole attack because the intruder can drop most of the important packets. Moreover, the technique involves energy efficiency, reliability and scalability. Simulation results demonstrate that our proposed method can accurately detect selective forwarding attacks and identify the compromised sensor nodes. Experimental result show analytically and through simulation experiments that our schemes achieve effective and robust detection capability with reasonable overheads.
Keywords: Wireless Sensor Network, Selective Forwarding attack, Reputation System, Packet Dropping, Channel-aware, Routing.
Title: An Adaptive Mobility Based Attack Detection Mechanism to Detect Selective Forwarding Attack in Wireless Sensor Network
Author: S.K.Shaju, R.Isaac Sajan, Bibin Christopher, Dr. A.J.Deepa
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
A dynamic approach for improving performance of intrusion detection system ov...IAEME Publication
This document proposes a dynamic approach to improve the performance of intrusion detection systems in mobile ad hoc networks. It discusses using an inverted table approach to maintain communication information and identify attacker nodes. A data mining approach is then used to detect black hole attacks and identify safe paths for communication that avoid attacker nodes, improving network throughput and reducing data loss. The work aims to implement these approaches in NS2 and analyze the results based on throughput and loss.
Interference Revelation in Mobile Ad-hoc Networks and Confrontationirjes
In this paper, we utilize the Several interference revelation techniques proposed for mobile ad hoc
networks rely on each node passively monitoring the data forwarding by its next hop. This paper presents
quantitative evaluations of false positives and their impact on monitoring based interference revelation for ad
hoc networks. Experimental results show that, even for a simple three-node configuration, an actual ad-hoc
network suffers from high false positives; these results are validated by Markov and probabilistic models.
However, this false positive problem cannot be observed by simulating the same network using popular ad hoc
network simulators, such as ns-2, OPNET or Glomosim. To remedy this, a probabilistic noise generator model
is implemented in the Glomosim simulator. With this revised noise model, the simulated network exhibits the
aggregate false positive behavior similar to that of the experimental tested. Simulations of larger (50-node) ad
hoc networks indicate that monitoring-based interference revelation has very high false positives. These false
positives can reduce the network performance or increase the overhead. In a simple monitoring-based system
where no secondary and more accurate methods are used, the false positives impact the network performance in
two ways: reduced throughput in normal networks without attackers and inability to mitigate the effect of
attacks in networks with attackers.
Wormhole attack detection algorithms in wireless network coding systemsPvrtechnologies Nellore
This document proposes algorithms to detect wormhole attacks in wireless network coding systems. It first discusses how wormhole attacks can severely impact network coding protocols by disrupting routing and introducing unfair workload distributions. It then presents a centralized algorithm that uses a central node to detect wormholes by measuring changes in expected transmission counts. For distributed systems without a central node, it proposes DAWN, a distributed algorithm that examines the order nodes receive innovative packets and their expected transmission counts to detect wormholes. The algorithms aim to detect wormholes using only local information available from regular network coding protocols to keep overhead low. Extensive testing validated the effectiveness and efficiency of the proposed approaches.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
This document lists the dates, times, and subjects of various exams over multiple dates in February and March 2012. English, Hindi, and various regional language exams are scheduled from 11am to 2pm on various Tuesdays and Saturdays. Sociology is scheduled from 3pm to 6pm on March 5th. Economics will take place from 3pm to 6pm on March 9th. Geography is the final exam, scheduled from 11am to 2pm on March 19th.
In a distributed medical system, building cross-site records while maintaining appropriate patients anonymity is essential. The distributed databases contain information about the same individuals, often described by using the same variables, which do not fit quite frequently due to accidental distortions. In such cases, the record linkage methods are used to find records that correspond to the same individuals in order to create a consistent database.
Our goal was to find a solution for this problem. In this paper, we propose an anonymous identifier, based on combinations of first two letters from the surname, name, date of birth and gender, which can allow a deidentifying merged dataset from multiple databases of a distributed medical system.
El documento habla sobre las experiencias positivas del autor durante la secundaria, incluyendo haber estado en el cuadro de honor, ayudar a un compañero a aprobar matemáticas y química, y disfrutar de la convivencia con sus compañeros. También menciona que le gustó la dinámica de trabajo de sus maestros de tercer año y que lo que aprendió fue a esforzarse para lograr sus objetivos y realizar las tareas con empeño y dedicación.
Ad hoc networks are the special networks formed for specific applications. Operating in ad-hoc mode
allows all wireless devices within range of each other to discover and communicate in a peer-to-peer
fashion without involving central access points. Many routing protocols like AODV, DSR etc have been
proposed for these networks to find an end to end path between the nodes. These routing protocols are
prone to attacks by the malicious nodes. There is a need to detect and prevent these attacks in a timely
manner before destruction of network services.
A Distributed Approach for Detecting Wormhole Attack in Wireless Network Codi...IRJET Journal
This document presents a distributed algorithm called DAWN to detect wormhole attacks in wireless network coding systems. The algorithm has two phases: 1) a detection phase where each node uses the expected transmission count (ETX) metric to detect if any attackers exist, and 2) a reporting phase where detected attackers are reported to other nodes. ETX represents the number of transmissions needed for a packet to be received and can reveal the network topology. DAWN examines the order nodes receive packets and their ETX values to identify attackers. It signatures reports to prevent manipulation and distributes the workload of detection across all nodes. The algorithm successfully detects wormhole attacks with high rates while imposing low computation and communication overhead.
The International Journal of Engineering and Science (The IJES)theijes
The document summarizes a study on the Enhanced Adaptive Acknowledge (EAACK) scheme for detecting misbehaving nodes in mobile ad hoc networks (MANETs). It discusses the limitations of existing acknowledgment-based intrusion detection systems like Watchdog, TWOACK, and AACK in handling receiver collisions. The key issues related to acknowledgment-based schemes for detecting misbehavior in MANETs are addressed. The focus is on analyzing the limitations of acknowledgment approaches like AACK and studying EAACK as an improved approach for addressing receiver collisions in MANETs.
Serial Communication Interface with Error Detectioniosrjce
UART is used for serial data communication. UART is a piece of computer hardware that translates
between parallel bits of data and serial bits. UART is usually an integrated circuit used for serial
communications over a computer or peripheral device serial port. Bits have to be moved from one place to
another using wires or some other medium. Over many miles, the expense of the wires becomes large. To reduce
the expense of long communication links carrying several bits in parallel, data bits are sent sequentially. Errors
may occur either internally or externally while we transmit information from source to destination. The errors
generated during the transmission would affect the performance of the overall system. In order to reduce the
errors we should incorporate any error detecting schemes like hamming decoder, check parity systems etc.
Different serial communication devices are available.
This document discusses the detection of black hole attacks in mobile ad hoc networks (MANETs) that use the Ad Hoc On-Demand Distance Vector (AODV) routing protocol. It proposes using authentication techniques including authenticated nodes, authentication on paths, authentication key packets, and a data routing information table on each node to detect black hole nodes. An example network is presented to demonstrate how the proposed techniques would detect a black hole node by analyzing authentication packet responses. The goal is to securely route data packets by detecting malicious nodes using these authentication methods.
An overview of contemporary security problems in wireless mesh networksiosrjce
Wireless mesh network (WMN) is a new wireless networking concept. Unlike traditional
wireless networks, Wireless Mesh Networks do not rely on any fixed communications. As an
alternative, hosts rely on each other to keep the network connected. Wireless Internet service
providers are choosing WMNs to offer Internet connectivity, as it allows a fast, simple and
inexpensive network use. One major challenge in design of these networks is their vulnerability to
security attacks. In this paper, principal contemporary security issues for wireless mesh networks
have been investigated. Identification of the threats a Wireless mesh network faces and the security
goals to be realized are described. The new challenges and opportunities posed by this new
networking environment are dealt with and explored approaches to secure its communication.
Mobile Ad hoc Network is basically a crew of mobile traffic nodes, which figure an effectual dynamic topology and built a resource mannered network. Mobile Ad hoc Networks are exceptional cases of ad hoc networks that, but it is lacking infrastructure, communicating entities pass with various accelerations. For that reason, this impedes or delay lays the foundation of well built end-to-end communication paths. So Mobile Ad-hoc Network having efficient data transfer. In this manner, MANETs have out of the common network concerns and security challenges to get the advanced connectivity, immune communications, and reputation executives systems which have an impact on the trust in cooperation and settlement between mobile networking units. In this survey paper we confer about the security attributes, attacks, and challenges of MANETs.So, it is important to have a better and good formation algorithm to connect all the nodes to each other. There must be less time, low delay time, more battery life, more speeds of packets.
International Journal of Computational Engineering Research(IJCER)ijceronline
1. The document discusses selective jamming attacks in wireless networks. Selective jamming attacks target important messages to degrade network performance.
2. The authors develop three schemes that combine cryptographic techniques with physical layer attributes to prevent real-time packet classification and mitigate selective jamming attacks.
3. The schemes are analyzed for their security and computational and communication overhead. The schemes aim to prevent adversaries from identifying important messages to selectively jam on the physical layer.
This document provides an overview of the AODV routing protocol for ad hoc networks and security issues associated with it. It first introduces ad hoc networks and discusses the basic differences between infrastructure and ad hoc networks. It then summarizes several popular routing protocols for ad hoc networks, including DSDV, DSR, TORA, and AODV. The document focuses on explaining the route discovery and maintenance processes of AODV. It also discusses common security attacks against AODV like black hole attacks and wormhole attacks. Finally, it mentions some approaches to secure AODV like using digital signatures, authentication, and intrusion detection systems.
A SYMMETRIC TOKEN ROUTING FOR SECURED COMMUNICATION OF MANET cscpconf
The communication should be much secured in Mobile Adhoc Networks in the
protective environment such as Military atmosphere and in a disaster relief. Due to the attackers,
Mobile Adhoc Networks resulting in denial of Service attacks modify packets, Error packets,
Missing Packets, Theft of Nodes, etc. To overcome this problem, We propose a new Symmetric
Token Routing Protocol (STRP) for mobile ad hoc networks provides much security against
MANET. The proposed protocol distributed a secured shared symmetric token for each node to
provide security against hackers and attackers. Simulation results shows the better delivery against
the existing protocol in MANET.
A SURVEY OF ENERGY-EFFICIENT COMMUNICATION PROTOCOLS IN WSNIAEME Publication
Wireless sensor networks are harshly restricted by storage capacity, energy and computing power. Wireless Sensor Networks have acquired a lot of attention by research community, manufacturer as well as actual users for monitoring remote trades and how to gather data in different environment. The wireless sensor nodes are especially battery powered devices having life can be extended for some times while long lasting and reliable for maintaining consumption of energy and network lifetime while designs applications and protocols. So it is essential to design effective and energy efficient protocol in order to enhance the network lifetime. In this paper we present the study of different energy efficient communication protocols of Wireless Sensor Networks (WSNs).Then some of the communication protocols which are widely used in WSNs to improve network performance are also discussed advantages and disadvantages of each protocols.
SR-Code: Smart Relay Network Coding for Data Collection for Wireless Sensor N...IJERA Editor
Reliability in data collection for wireless sensor networks is one of the major problems in IoT applications. Sensor nodes are usually placed in harsh conditions where data communication is at risk of losing packets. Retransmissions are considered costly in terms of delay and power consumptions, especially that wireless sensor nodes are battery operated. In this context we introduce SR-Code, a novel network coding algorithm that achieves reliability in harsh conditions. SR-Code utilizes the XOR operator to code overheard packets. The targeted network topology is a 2-tier network where data loss can occur in all tiers. SR-Code utilizes bit addresses where each node is identified by a single bit in an address bit vector. Identifying packets and computing the cardinality of coded messages can be easily done using address bit vectors. SR-Code realizes redundancy as a function of overheard packet. SR-Code achieved a reliability factor of 75% when the number of packets lost was 100% of the original (un-coded) packet sent.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
An Adaptive Mobility Based Attack Detection Mechanism to Detect Selective For...paperpublications3
Abstract: In this paper propose Mobile network based attack detection of Selective Forwarding Attacks in Wireless Sensor Networks. In existing method only used static network and mobility network require high energy and time. So these problems can be overcome by using Mobile network based attack detection. The wireless sensor network has become a hot research area due its wide range of application in military and civilian domain, but as it uses wireless media for communication these are easily prone to security attacks. Selective forwarding attacks are most effective when the attacker is explicitly included on the path of a data flow. Selective forwarding and black hole attacks are very disastrous attacks for sensor networks if used with sinkhole attack because the intruder can drop most of the important packets. Moreover, the technique involves energy efficiency, reliability and scalability. Simulation results demonstrate that our proposed method can accurately detect selective forwarding attacks and identify the compromised sensor nodes. Experimental result show analytically and through simulation experiments that our schemes achieve effective and robust detection capability with reasonable overheads.
Keywords: Wireless Sensor Network, Selective Forwarding attack, Reputation System, Packet Dropping, Channel-aware, Routing.
Title: An Adaptive Mobility Based Attack Detection Mechanism to Detect Selective Forwarding Attack in Wireless Sensor Network
Author: S.K.Shaju, R.Isaac Sajan, Bibin Christopher, Dr. A.J.Deepa
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
A dynamic approach for improving performance of intrusion detection system ov...IAEME Publication
This document proposes a dynamic approach to improve the performance of intrusion detection systems in mobile ad hoc networks. It discusses using an inverted table approach to maintain communication information and identify attacker nodes. A data mining approach is then used to detect black hole attacks and identify safe paths for communication that avoid attacker nodes, improving network throughput and reducing data loss. The work aims to implement these approaches in NS2 and analyze the results based on throughput and loss.
Interference Revelation in Mobile Ad-hoc Networks and Confrontationirjes
In this paper, we utilize the Several interference revelation techniques proposed for mobile ad hoc
networks rely on each node passively monitoring the data forwarding by its next hop. This paper presents
quantitative evaluations of false positives and their impact on monitoring based interference revelation for ad
hoc networks. Experimental results show that, even for a simple three-node configuration, an actual ad-hoc
network suffers from high false positives; these results are validated by Markov and probabilistic models.
However, this false positive problem cannot be observed by simulating the same network using popular ad hoc
network simulators, such as ns-2, OPNET or Glomosim. To remedy this, a probabilistic noise generator model
is implemented in the Glomosim simulator. With this revised noise model, the simulated network exhibits the
aggregate false positive behavior similar to that of the experimental tested. Simulations of larger (50-node) ad
hoc networks indicate that monitoring-based interference revelation has very high false positives. These false
positives can reduce the network performance or increase the overhead. In a simple monitoring-based system
where no secondary and more accurate methods are used, the false positives impact the network performance in
two ways: reduced throughput in normal networks without attackers and inability to mitigate the effect of
attacks in networks with attackers.
Wormhole attack detection algorithms in wireless network coding systemsPvrtechnologies Nellore
This document proposes algorithms to detect wormhole attacks in wireless network coding systems. It first discusses how wormhole attacks can severely impact network coding protocols by disrupting routing and introducing unfair workload distributions. It then presents a centralized algorithm that uses a central node to detect wormholes by measuring changes in expected transmission counts. For distributed systems without a central node, it proposes DAWN, a distributed algorithm that examines the order nodes receive innovative packets and their expected transmission counts to detect wormholes. The algorithms aim to detect wormholes using only local information available from regular network coding protocols to keep overhead low. Extensive testing validated the effectiveness and efficiency of the proposed approaches.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
This document lists the dates, times, and subjects of various exams over multiple dates in February and March 2012. English, Hindi, and various regional language exams are scheduled from 11am to 2pm on various Tuesdays and Saturdays. Sociology is scheduled from 3pm to 6pm on March 5th. Economics will take place from 3pm to 6pm on March 9th. Geography is the final exam, scheduled from 11am to 2pm on March 19th.
In a distributed medical system, building cross-site records while maintaining appropriate patients anonymity is essential. The distributed databases contain information about the same individuals, often described by using the same variables, which do not fit quite frequently due to accidental distortions. In such cases, the record linkage methods are used to find records that correspond to the same individuals in order to create a consistent database.
Our goal was to find a solution for this problem. In this paper, we propose an anonymous identifier, based on combinations of first two letters from the surname, name, date of birth and gender, which can allow a deidentifying merged dataset from multiple databases of a distributed medical system.
El documento habla sobre las experiencias positivas del autor durante la secundaria, incluyendo haber estado en el cuadro de honor, ayudar a un compañero a aprobar matemáticas y química, y disfrutar de la convivencia con sus compañeros. También menciona que le gustó la dinámica de trabajo de sus maestros de tercer año y que lo que aprendió fue a esforzarse para lograr sus objetivos y realizar las tareas con empeño y dedicación.
O documento apresenta o calendário acadêmico de um curso de bacharelado em administração pública para o ano de 2012, com as datas de início e fim das disciplinas, encontros presenciais, solicitação de segunda chamada e exames finais.
Internet ha facilitado la conexión global entre personas e instituciones al reducir las barreras de distancia y tiempo. Esta red mundial descentralizada de ordenadores conectados a través de protocolos de comunicación proporciona servicios como navegación web, correo electrónico, foros, transferencia de archivos y comunicaciones de voz y video que han cambiado radicalmente la forma de interactuar socialmente.
Jamberry Nails are a popular nail trend that allows women to enhance their professional appearance easily through fashionable nail wraps. The document promotes Jamberry Nails as the easiest way to update one's nails without fuss through their nail wraps. It provides a link for readers to learn more about Jamberry Nails products at www.jamtastic.jamberrynails.net.
Network Monitoring and Traffic Reduction using Multi-Agent TechnologyEswar Publications
In this paper the algorithms which could improve Transmission band and Network Traffic reduction for computer network has been shown. Problem solving is an area with which many Multiagent-based applications are concerned. Multiagent systems are computational systems in which several agents interact or work together to achieve some purposes. It includes distributed solutions to problems, solving distributed problems and distributed techniques for problem solving. Multiagent using for maximizing group performance with planning, execution, monitoring, communication and coordination. This paper also addresses some critical issues in developing
Multi agent-based traffic control and monitoring systems, such as interoperability, flexibility, and extendibility. Finally, several future research directions toward the successful deployment of Multiagent technology in traffic control and monitoring systems are discussed.
Este documento presenta un análisis técnico del índice S&P 500 del 19 de enero de 2012. Incluye gráficos diarios que representan medias simples de 1 a 610 períodos y proporciona objetivos de precios alcistas y a la baja dependiendo de si el S&P 500 mantiene o pierde ciertos niveles de soporte clave entre 1.260 y 1.180. También explica brevemente cómo se construyen los gráficos y cómo las medias simples pueden orientar el comportamiento futuro del mercado.
The document provides a grade 4 problem solving performance task that involves writing a mathematical problem based on a fantasy story with characters. It includes a sample problem about characters Ki Joo, Hena, Syakir, Adam, and Dennis eating different breakfast items. Clues are provided that Hena likes chocolate, Ki Joo doesn't like chips, Adam and Ki Joo don't like cookies, Syakir doesn't like sugar, and Dennis and Syakir don't like chips. A table is included to solve the problem by filling in what each character ate for breakfast.
Fuzzy System Model for Management of Driver Distractions in Motor VehiclesEswar Publications
In this paper a low cost and driver’s environment friendly design of a Fuzzy Logic software system to manage driver distractions in a motor vehicle is presented. The system uses four inputs; vehicle speed, radio volume setting, frequency of left or right hand turns per minute and brightness conditions external to the vehicle. The system provides a single output in the form of a Driver Attention Load rating. This rating is used as a parameter to determine the degree to which the driver’s environment needs to be adjusted in terms of radio volume level, brightness of instrument cluster display and reducing the amount of connected phone interruptions per minute.
The Fuzzy Inference Software System is modeled and simulated using MATLAB. After simulation, the final system and associated graphical user interface are designed as a standalone application written in Java. An open source Java library called jFuzzyLogic is used to model the Fuzzy Inference System and the Java Swing toolkit is used for the design of the graphical user interface.
Polka Dot, a water droplet, is excited for her senior trip falling from the clouds as precipitation. She and her friends count down and fall together, starting their adventure. Polka Dot has fun riding rapids and waterfalls, talking to other droplets. The next day she overwaters a flower through infiltration but gets the water back. Her trip ends as she evaporates and returns to the clouds through condensation, hoping readers enjoyed her story.
DATA SECURITY USING PRIVATE KEY ENCRYPTION SYSTEM BASED ON ARITHMETIC CODINGIJNSA Journal
Problem faced by today’s communicators is not only security but also the speed of communication and size of content.In the present paper, a scheme has been proposed which uses the concept of compression and data encryption. In first phase the focus has been made on data compression and cryptography. In the next phase we have emphasized on compression cryptosystem. Finally, proposed technique has been discussed which used the concept of data compression and encryption. In this first data is compressed to reduce the size of the data and increase the data transfer rate. Thereafter compress data is encrypted to provide security. Hence our proposed technique is effective that can reduce data size, increase data transfer rate and provide the security during communication.
FellowBuddy.com is an innovative platform that brings students together to share notes, exam papers, study guides, project reports and presentation for upcoming exams.
We connect Students who have an understanding of course material with Students who need help.
Benefits:-
# Students can catch up on notes they missed because of an absence.
# Underachievers can find peer developed notes that break down lecture and study material in a way that they can understand
# Students can earn better grades, save time and study effectively
Our Vision & Mission – Simplifying Students Life
Our Belief – “The great breakthrough in your life comes when you realize it, that you can learn anything you need to learn; to accomplish any goal that you have set for yourself. This means there are no limits on what you can be, have or do.”
Like Us - https://www.facebook.com/FellowBuddycom
Comparative study of private and public key cryptography algorithms a surveyeSAT Publishing House
The document provides a comparison of private key cryptography (such as DES) and public key cryptography (such as RSA). It discusses the basic concepts and processes of cryptography including encryption, decryption, keys, cryptanalysis etc. It then describes the DES and RSA algorithms in detail and compares them based on factors like message length, speed, security, vulnerabilities etc. The document concludes that private key algorithms are faster but public key algorithms provide higher security and additional services like non-repudiation.
Different date block size using to evaluate the performance between different...IJCNCJournal
The different computer networks whether wired or wireless are becoming more popular with its high
security aspect. Different security algorithms and technique are using to avoid any aforementioned attacks.
One of these technique is a cryptography technique that makes the data as unreadable during the transfer
hence; there is no chance to reclaim the information. Presently, most of the users are using various media
types and internet to transfer the data but, it has the chance to retrieve the data by using these media types.
The perfect solution for this problem is to provide security on time-to-time basis; this stage is always
significant to the security related community discussions. This paper explains the comparison between the
run time of three different encryption algorithms which are DES, AES and Blowfish The compression
includes using different modes, data block size and different operation modes. As a result, Blowfish
algorithm followed by AES take less time for running compared to DES.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
A novel approach to information security using safe exchange of encrypted dat...eSAT Journals
Abstract In this modern era, with the vast improvement in the field of internet, security is a major issue at hand. A lot of crimes, or to say, hacking is prevalent. This system "Safe Exchange of Encrypted Data (SEED)" handles sharing secret data between the sender and receiver in a cryptic manner by providing a new approach to symmetric encryption with ensured confidentiality, authenticity, integrity and availability of a secure communication, and protection against Man-in-the-Middle attacks even without a Public Key Infrastructure (PKI) or endpoint certificates, in the unprotected network space. This system makes use of an efficient concept called 'ephemeral shared session key', which being a combination of public and private keys can only be generated at both ends and negates the need of having to transmit a symmetric key between the users. The text data is encrypted using a new symmetric key algorithm known as “Xenacrypt” which is more secure than any other existing symmetric key algorithms. This system provides integrity through an efficient algorithm which we have implemented to indicate data thefts by any malicious attacks or threats. Application of this crypto-system will have a huge impact in the future of transmitting secure data especially in the field of business transaction and military operations. Keywords:-encryption;signed diffie hellman;signature;VOIP Integrity,verification,decryption,authentication.
This document summarizes public key cryptography and asymmetric encryption algorithms. It discusses how public key cryptography uses two different but mathematically related keys, a public key for encryption and a private key for decryption. The public key can be shared openly, while the private key is kept secret by the recipient. It also describes how asymmetric algorithms are slower than symmetric algorithms but allow anyone to encrypt messages for a recipient using their public key, with only the recipient able to decrypt it with their private key. Examples of asymmetric algorithms discussed include RSA.
Bt0088 cryptography and network security1Techglyphs
The document discusses various topics related to cryptography and network security including:
1. The need for network security to prevent damage to organizations from hostile software or intruders.
2. Security attacks are any actions that compromise information security, while vulnerabilities are weaknesses that can be exploited by threats to cause harm.
3. The difference between substitution and transposition techniques for encryption, where substitution exchanges letters and transposition rearranges them.
4. Caesar cipher encryption of a sample plaintext using a key of 3.
Performance Comparison of File Security System using TEA and Blowfish Algorithmsijtsrd
With the progress in data exchange by the electronic system, the need for information security has become a necessity. Due to the growth of multimedia application, security becomes an important issue of communication and storage of different files. To make its reality, cryptographic algorithms are widely used as essential tools. Cryptographic algorithms provide security services such as confidentiality, authentication, data integrity and secrecy by encryption. Different cryptographic algorithms are commonly used for information security in many research areas. Although there are two encryption techniques, asymmetric and symmetric, the simpler symmetric encryption technique is employed for testing file security system. In this study, the performance evaluation of the most common two symmetric encryption algorithms such as TEA and Blowfish algorithm is focused on the execution time intervals. Simulation has been conducted with many types of file encryption like .pdf, .txt, .doc, .docx, .xlsx, .pptx, .ppt, .xls, .jpg, .png and most common video file formats by using Java Programming Language. Win Myat Thu | Tin Lai Win | Su Mu Tyar "Performance Comparison of File Security System using TEA and Blowfish Algorithms" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-5 , August 2019, URL: https://www.ijtsrd.com/papers/ijtsrd26462.pdfPaper URL: https://www.ijtsrd.com/engineering/computer-engineering/26462/performance-comparison-of-file-security-system-using-tea-and-blowfish-algorithms/win-myat-thu
This document proposes a new technique to solve the key exchange problem in cryptography. It discusses existing key exchange methods that rely on additional encryption processes or pre-shared secrets. The proposed method mixes the cipher key with the encrypted data block such that only the intended receiver can extract both the key and data. This allows key exchange without pre-sharing secrets or additional encryption steps. It aims to provide a more efficient and secure key exchange technique compared to traditional methods.
A New Method for Encrypting Digital Data Using Symmetric Key in Information E...Editor IJCATR
with the arrival of the information age and much more important information systems and communication in human
everyday life, necessity immunization information and communication strategy were also raised. The easiest way to meet this
necessity is conventional encryption algorithms. Encryption is a right tool for data protection in an unsecure channel. To this end, from
two-method symmetric key encryption and public-key cryptography are used. In this paper we examine text cryptography, one of the
most important topics in cryptography. A unique attribute of this kind of encryption has been of interest to many researchers in this
field. This paper, considering the symmetric encryption algorithm, provides a text encryption algorithm using a 128-bit key. The
proposed algorithm uses a 128-bit key, the text data using the XOR operator to convert the encrypted information. Therefore, the aim
of this method is to provide a convenient method for symmetrically encrypting data not to be easily decoded, and finally, the results of
the tests show that the proposed method is better in terms of security and speed of execution
Chaos Based Direct Public Verifiable Signcryption SchemeIOSR Journals
This document proposes and describes a chaos-based direct public verifiable signcryption scheme. It begins with background on chaos theory and how chaotic systems can provide useful properties for cryptography. It then discusses signcryption schemes generally and properties they should satisfy like confidentiality, integrity, and public verifiability. The document proposes a new signcryption scheme that uses a chaotic key generator and the chaotic function f(x) = 3x(1-x^2) to dynamically generate multiple encryption keys, aiming to provide stronger security. It presents the scheme details, including parameters, key generation, and how it can realize single-recipient and multiple-recipient signcryption with public verifiability. The scheme is then analyzed for
A Review on Various Methods of Cryptography for Cyber Securityrahulmonikasharma
In the today’s world of digital communication networks, the privacy and security of the transmitted data has become a basic necessity for communication. Data Security is the science and study of techniques of securing data in computer and communication systems from unknown users, disclosures and modifications. Cyber security issues plays a vital role in moving towards digital information age. Therefore, the encryption and decryption systems have been implemented for protecting information. The internet users are rapidly increasing day by day which causes a lot of cyber-criminals. The security of not only the single system but the entire systems will be ensured by the task of network security and controlled by network administrator. In this paper, an attempt has been made to review the various methods of Cryptography and how these methods will help to secure data from unauthenticated users. This paper has primarily focused on Cyber Security and Cryptographic concepts. This paper has also discusses the various attacks and cryptographic algorithms that are used in various applications of cyber security.
Cryptography technology is a security technique used to change plain text to another shape of data or to
symbols, which is known as the cipher text. Cryptography aims to keep the data secure during its journey
through public networks. Currently, there are many proposed algorithms that provide this service
especially for sensitive data or very important conversations either through mobile or video conferences. In
this paper, an inventive security symmetric algorithm is implemented and evaluated, and its performance is
compared to the AES. The algorithm has four different rounds for each quarter of the key container table,
and each of them serves to shift the table. The algorithm uses the XOR operation, which, being lightweight
and cheap, is very appropriate for use with Real Time Applications. The result shows that the suggested
algorithm spends less time than AES although it has 16 rounds and the numbers used to mix up the table
are big.
IMPLEMENT A NOVEL SYMMETRIC BLOCK CIPHER ALGORITHMijcisjournal
Cryptography technology is a security technique used to change plain text to another shape of data or to symbols, which is known as the cipher text. Cryptography aims to keep the data secure during its journey through public networks. Currently, there are many proposed algorithms that provide this service especially for sensitive data or very important conversations either through mobile or video conferences. In this paper, an inventive security symmetric algorithm is implemented and evaluated, and its performance is compared to the AES. The algorithm has four different rounds for each quarter of the key container table, and each of them serves to shift the table. The algorithm uses the XOR operation, which, being lightweight and cheap, is very appropriate for use with Real Time Applications. The result shows that the suggested algorithm spends less time than AES although it has 16 rounds and the numbers used to mix up the table are big.
A Study of Different Partitioning Clustering Techniqueijsrd.com
In the field of software, Data mining is very useful to identify the interesting patterns and trends from the large amount of stored data into different database and data repository. Clustering technique is basically used to extract the unknown pattern from the large set of data for electronic stored data, business and real time applications. Clustering is a division of data into different groups. Data are grouped into clusters with high intra group similarity and low inter group similarity [2]. Clustering is an unsupervised learning technique. Clustering is useful technique that applied into many areas like marketing studies, DNA analysis, text mining and web documents classification. In the large database, the clustering task is very complex with many attributes. There are many methods to deal with these problems. In this paper we discuss about the different Partitioning Based Methods like- K-Means, K-Medoids and Fuzzy K-Means and compare the advantages or disadvantages over these techniques.
A NEW PROPOSED SYMMETRIC KEY ALGORITHM FOR MODERN CRYPTOGRAPHICijsrd.com
This document describes a new proposed symmetric key encryption algorithm. It begins with background on cryptography and then describes the new algorithm. The algorithm encrypts text by taking the ASCII value of each character, reversing the 8-bit binary representation, dividing this by a 4-digit key, and storing the remainder in the first 3 digits and quotient in the next 5 digits to form the ciphertext. It provides an example of encrypting the character 'T' using this process. The document suggests this algorithm is easy to implement and more secure than existing algorithms due to using a reversal operation during encryption.
This document describes the implementation of Caesar cipher encryption and decryption programs in Java, C++, and Python. It discusses the key steps in the encryption and decryption methods. The encryption method reads plaintext from an input file, encrypts each character using a Caesar cipher shift defined by a user-input key, and writes the ciphertext to an output file. The decryption method performs the reverse process, reading ciphertext and writing decrypted plaintext. Helper methods are used to encrypt/decrypt single characters. Flow charts illustrate the code logic and relationships between methods.
Iaetsd a survey on cloud storage security withIaetsd Iaetsd
This document discusses signcryption as a method for secure cloud storage. It begins with an abstract that introduces signcryption as a public key cryptographic method that achieves confidentiality and unforgeability with less overhead than digital signatures followed by encryption. The introduction provides more details on signcryption and its advantages over separate signing and encryption. It then discusses related work on address-based cryptography, key aggregate cryptography, and time-bound hierarchical key assignment schemes. The document focuses on how signcryption can provide high security for sharing data through cloud storage.
Achieving data integrity by forming the digital signature using RSA and SHA-1...IOSR Journals
This document discusses achieving data integrity through digital signatures using the RSA and SHA-1 algorithms. It first provides background on data integrity and cryptography. It then explains the RSA algorithm for public key encryption and digital signatures. The document describes an implementation of RSA and SHA-1 to encrypt messages and generate message digests at the sender and receiver ends to verify data integrity by ensuring the digests match. Graphical interfaces are provided to enhance understanding and the system is designed with client and server architecture to demonstrate the process across different computers.
Similar to Cryptography System for Online Communication Using Polyalphabetic Substitution Method (20)
Content-Based Image Retrieval (CBIR) systems have been used for the searching of relevant images in various research areas. In CBIR systems features such as shape, texture and color are used. The extraction of features is the main step on which the retrieval results depend. Color features in CBIR are used as in the color histogram, color moments, conventional color correlogram and color histogram. Color space selection is used to represent the information of color of the pixels of the query image. The shape is the basic characteristic of segmented regions of an image. Different methods are introduced for better retrieval using different shape representation techniques; earlier the global shape representations were used but with time moved towards local shape representations. The local shape is more related to the expressing of result instead of the method. Local shape features may be derived from the texture properties and the color derivatives. Texture features have been used for images of documents, segmentation-based recognition,and satellite images. Texture features are used in different CBIR systems along with color, shape, geometrical structure and sift features.
This document discusses clickjacking attacks, which hijack users' clicks to perform unintended actions. It provides an overview of clickjacking, describes different types of attacks, and analyzes vulnerabilities that make websites susceptible. Experiments are conducted on a sample social networking site, applying various clickjacking techniques. Potential defenses are tested, including X-Frame-Options headers and frame busting code. A proposed solution detects transparent iframes to warn users and check for hidden mouse pointers to mitigate cursorjacking. Analysis of top Jammu and Kashmir websites found most were vulnerable, while browser behavior studies showed varying support for defenses.
Performance Analysis of Audio and Video Synchronization using Spreaded Code D...Eswar Publications
The audio and video synchronization plays an important role in speech recognition and multimedia communication. The audio-video sync is a quite significant problem in live video conferencing. It is due to use of various hardware components which introduces variable delay and software environments. The objective of the synchronization is used to preserve the temporal alignment between the audio and video signals. This paper proposes the audio-video synchronization using spreading codes delay measurement technique. The performance of the proposed method made on home database and achieves 99% synchronization efficiency. The audio-visual
signature technique provides a significant reduction in audio-video sync problems and the performance analysis of audio and video synchronization in an effective way. This paper also implements an audio- video synchronizer and analyses its performance in an efficient manner by synchronization efficiency, audio-video time drift and audio-video delay parameters. The simulation result is carried out using mat lab simulation tools and simulink. It is automatically estimating and correcting the timing relationship between the audio and video signals and maintaining the Quality of Service.
Due to the availability of complicated devices in industry, models for consumers at lower cost of resources are developed. Home Automation systems have been developed by several researchers. The limitations of home automation includes complexity in architecture, higher costs of the equipment, interface inflexibility. In this paper as we have proposed, the working protocol of PIC 16F72 technology is which is secure, cost efficient, flexible that leads to the development of efficient home automation systems. The system is operational to control various home appliances like fans, Bulbs, Tube light. The following paper describes about components used and working of all components connected. The home automation system makes use of Android app entitled “Home App” which gives
flexibility and easy to use GUI.
Semantically Enchanced Personalised Adaptive E-Learning for General and Dysle...Eswar Publications
E-learning plays an important role in providing required and well formed knowledge to a learner. The medium of e- learning has achieved advancement in various fields such as adaptive e-learning systems. The need for enhancing e-learning semantically can enhance the retrieval and adaptability of the learning curriculum. This paper provides a semantically enhanced module based e-learning for computer science programme on a learnercentric perspective. The learners are categorized based on their proficiency for providing personalized learning environment for users. Learning disorders on the platform of e-learning still require lots of research. Therefore, this paper also provides a personalized assessment theoretical model for alphabet learning with learning objects for
children’s who face dyslexia.
Agriculture plays an important role in the economy of our country. Over 58 percent of the rural households depend on the agriculture sector as their means of livelihood. Agriculture is one of the major contributors to Gross Domestic Product(GDP). Seeds are the soul of agriculture. This application helps in reducing the time for the researchers as well as farmers to know the seedling parameters. The application helps the farmers to know about the percentage of seedlings that will grow and it is very essential in estimating the yield of that particular crop. Manual calculation may lead to some error, to minimize that error, the developed app is used. The scientist and farmers require the app to know about the physiological seed quality parameters and to take decisions regarding their farming activities. In this article a desktop app for seed germination percentage and vigour index calculation are developed in PHP scripting language.
What happens when adaptive video streaming players compete in time-varying ba...Eswar Publications
Competition among adaptive video streaming players severely diminishes user-QoE. When players compete at a bottleneck link many do not obtain adequate resources. This imbalance eventually causes ill effects such as screen flickering and video stalling. There have been many attempts in recent years to overcome some of these problems. However, added to the competition at the bottleneck link there is also the possibility of varying network bandwidth which can make the situation even worse. This work focuses on such a situation. It evaluates current heuristic adaptive video players at a bottleneck link with time-varying bandwidth conditions. Experimental setup includes the TAPAS player and emulated network conditions. The results show PANDA outperforms FESTIVE, ELASTIC and the Conventional players.
WLI-FCM and Artificial Neural Network Based Cloud Intrusion Detection SystemEswar Publications
Security and Performance aspects of cloud computing are the major issues which have to be tended to in Cloud Computing. Intrusion is one such basic and imperative security problem for Cloud Computing. Consequently, it is essential to create an Intrusion Detection System (IDS) to detect both inside and outside assaults with high detection precision in cloud environment. In this paper, cloud intrusion detection system at hypervisor layer is developed and assesses to detect the depraved activities in cloud computing environment. The cloud intrusion detection system uses a hybrid algorithm which is a fusion of WLI- FCM clustering algorithm and Back propagation artificial Neural Network to improve the detection accuracy of the cloud intrusion detection system. The proposed system is implemented and compared with K-means and classic FCM. The DARPA’s KDD cup dataset 1999 is used for simulation. From the detailed performance analysis, it is clear that the proposed system is able to detect the anomalies with high detection accuracy and low false alarm rate.
Spreading Trade Union Activities through Cyberspace: A Case StudyEswar Publications
This report present the outcome of an investigative research conducted to examine the modu-operandi of academic staff union of polytechnics (ASUP) YabaTech. The investigation covered the logistics and cost implication for spreading union activities among members. It was discovered that cost of management and dissemination of information to members was at high side, also logistics problem constitutes to loss of information in transit hence cut away some members from union activities. To curtail the problem identified, we proposed the
design of secure and dynamic website for spreading union activities among members and public. The proposed system was implemented using HTML5 technology, interface frameworks like Bootstrap and j query which enables the responsive feature of the application interface. The backend was designed using PHPMYSQL. It was discovered from the evaluation of the new system that cost of managing information has reduced considerably, and logistic problems identified in the old system has become a forgotten issue.
Identifying an Appropriate Model for Information Systems Integration in the O...Eswar Publications
Nowadays organizations are using information systems for optimizing processes in order to increase coordination and interoperability across the organizations. Since Oil and Gas Industry is one of the large industries in whole of the world, there is a need to compatibility of its Information Systems (IS) which consists three categories of systems: Field IS, Plant IS and Enterprise IS to create interoperability and approach the
optimizing processes as its result. In this paper we introduce the different models of information systems integration, identify the types of information systems that are using in the upstream and downstream sectors of petroleum industry, and finally based on expert’s opinions will identify a suitable model for information systems integration in this industry.
Link-and Node-Disjoint Evaluation of the Ad Hoc on Demand Multi-path Distance...Eswar Publications
This work illustrates the AOMDV routing protocol. Its ancestor, the AODV routing protocol is also described. This tutorial demonstrates how forward and reverse paths are created by the AOMDV routing protocol. Loop free paths formulation is described, together with node and link disjoint paths. Finally, the performance of the AOMDV routing protocol is investigated along link and node disjoint paths. The WSN with the AOMDV routing protocol using link disjoint paths is better than the WSN with the AOMDV routing protocol using node disjoint paths for energy consumption.
Bridging Centrality: Identifying Bridging Nodes in Transportation NetworkEswar Publications
To identify the importance of node of a network, several centralities are used. Majority of these centrality measures are dominated by components' degree due to their nature of looking at networks’ topology. We propose a centrality to identification model, bridging centrality, based on information flow and topological aspects. We apply bridging centrality on real world networks including the transportation network and show that the nodes distinguished by bridging centrality are well located on the connecting positions between highly connected regions. Bridging centrality can discriminate bridging nodes, the nodes with more information flowed through them and locations between highly connected regions, while other centrality measures cannot.
Now a days we are living in an era of Information Technology where each and every person has to become IT incumbent either intentionally or unintentionally. Technology plays a vital role in our day to day life since last few decades and somehow we all are depending on it in order to obtain maximum benefit and comfort. This new era equipped with latest advents of technology, enlightening world in the form of Internet of Things (IoT). Internet of things is such a specified and dignified domain which leads us to the real world scenarios where each object can perform some task while communicating with some other objects. The world with full of devices, sensors and other objects which will communicate and make human life far better and easier than ever. This paper provides an overview of current research work on IoT in terms of architecture, a technology used and applications. It also highlights all the issues related to technologies used for IoT, after the literature review of research work. The main purpose of this survey is to provide all the latest technologies, their corresponding
trends and details in the field of IoT in systematic manner. It will be helpful for further research.
Automatic Monitoring of Soil Moisture and Controlling of Irrigation SystemEswar Publications
In past couple of decades, there is immediate growth in field of agricultural technology. Utilization of proper method of irrigation by drip is very reasonable and proficient. A various drip irrigation methods have been proposed, but they have been found to be very luxurious and dense to use. The farmer has to maintain watch on irrigation schedule in the conventional drip irrigation system, which is different for different types of crops. In remotely monitored embedded system for irrigation purposes have become a new essential for farmer to accumulate his energy, time and money and will take place only when there will be requirement of water. In this approach, the soil test for chemical constituents, water content, and salinity and fertilizer requirement data collected by wireless and processed for better drip irrigation plan. This paper reviews different monitoring systems and proposes an automatic monitoring system model using Wireless Sensor Network (WSN) which helps the farmer to improve the yield.
Multi- Level Data Security Model for Big Data on Public Cloud: A New ModelEswar Publications
With the advent of cloud computing the big data has emerged as a very crucial technology. The certain type of cloud provides the consumers with the free services like storage, computational power etc. This paper is intended to make use of infrastructure as a service where the storage service from the public cloud providers is going to leveraged by an individual or organization. The paper will emphasize the model which can be used by anyone without any cost. They can store the confidential data without any type of security issue, as the data will be altered
in such a way that it cannot be understood by the intruder if any. Not only that but the user can retrieve back the original data within no time. The proposed security model is going to effectively and efficiently provide a robust security while data is on cloud infrastructure as well as when data is getting migrated towards cloud infrastructure or vice versa.
Impact of Technology on E-Banking; Cameroon PerspectivesEswar Publications
The financial services industry is experiencing rapid changes in services delivery and channels usage, and financial companies and users of financial services are looking at new technologies as they emerge and deciding whether or not to embrace them and the new opportunities to save and manage enormous time, cost and stress.
There is no doubt about the favourable and manifold impact of technology on e-banking as pictured in this review paper, almost all banks are with the least and most access e-banking Technological equipments like ATMs and Cards. On the other Hand cheap and readily available technology has opened a favourable competition in ebanking services business with a lot of wide range competitors competing with Commercial Banks in Cameroon in providing digital financial services.
Classification Algorithms with Attribute Selection: an evaluation study using...Eswar Publications
Attribute or feature selection plays an important role in the process of data mining. In general the data set contains more number of attributes. But in the process of effective classification not all attributes are relevant.
Attribute selection is a technique used to extract the ranking of attributes. Therefore, this paper presents a comparative evaluation study of classification algorithms before and after attribute selection using Waikato Environment for Knowledge Analysis (WEKA). The evaluation study concludes that the performance metrics of the classification algorithm, improves after performing attribute selection. This will reduce the work of processing irrelevant attributes.
Mining Frequent Patterns and Associations from the Smart meters using Bayesia...Eswar Publications
In today’s world migration of people from rural areas to urban areas is quite common. Health care services are one of the most challenging aspect that is must require to the people with abnormal health. Advancements in the technologies lead to build the smart homes, which contains various sensor or smart meter devices to automate the process of other electronic device. Additionally these smart meters can be able to capture the daily activities of the patients and also monitor the health conditions of the patients by mining the frequent patterns and
association rules generated from the smart meters. In this work we proposed a model that is able to monitor the activities of the patients in home and can send the daily activities to the corresponding doctor. We can extract the frequent patterns and association rules from the log data and can predict the health conditions of the patients and can give the suggestions according to the prediction. Our work is divided in to three stages. Firstly, we used to record the daily activities of the patient using a specific time period at three regular intervals. Secondly we applied the frequent pattern growth for extracting the association rules from the log file. Finally, we applied k means clustering for the input and applied Bayesian network model to predict the health behavior of the patient and precautions will be given accordingly.
Network as a Service Model in Cloud Authentication by HMAC AlgorithmEswar Publications
Resource pooling on internet-based accessing on use as pay environmental technology and ruled in IT field is the
cloud. Present, in every organization has trusted the web, however, the information must flow but not hold the
data. Therefore, all customers have to use the cloud. While the cloud progressing info by securing-protocols. Third
party observing and certain circumstances directly stale in flow and kept of packets in the virtual private cloud.
Global security statistics in the year 2017, hacking sensitive information in cloud approximately maybe 75.35%,
and the world security analyzer said this calculation maybe reached to 100%. For this cause, this proposed
research work concentrates on Authentication-Message-Digest-Key with authentication in routing the Network as
a Service of packets in OSPF (Open Shortest Path First) implementing Cloud with GNS3 has tested them to
securing from attackers.
Microstrip patch antennas are recently used in wireless detection applications due to their low power consumption, low cost, versatility, field excitation, ease of fabrication etc. The microstrip patch antennas are also called as printed antennas which is suffer with an array elements of antenna and narrow bandwidth. To overcome the above drawbacks, Flame Retardant Material is used as the substrate. Rectangular shape of microstrip patch antenna with FR4 material as the substrate which is more suitable for the explosive detection applications. The proposed printed antenna was designed with the dimension of 60 x 60 mm2. FR-4 material has a dielectric constant value of 4.3 with thickness 1.56 mm, length and width 60 mm and 60 mm respectively. One side of the substrate contains the ground plane of dimensions 60 x60 mm2 made of copper and the other side of the substrate contains the patch which have dimensions 34 x 29 mm2 and thickness 0.03mm which is also made of copper. RMPA without slot, Vertical slot RMPA, Double horizontal slot RMPA and Centre slot RMPA structures were
designed and the performance of the antennas were analysed with various parameters such as gain, directivity, Efield, VSWR and return loss. From the performance analysis, double horizontal slot RMPA antenna provides a better result and it provides maximum gain (8.61dB) and minimum return loss (-33.918dB). Based on the E-field excitation value the SEMTEX explosive material is detected and it was simulated using CST software.
Taking AI to the Next Level in Manufacturing.pdfssuserfac0301
Read Taking AI to the Next Level in Manufacturing to gain insights on AI adoption in the manufacturing industry, such as:
1. How quickly AI is being implemented in manufacturing.
2. Which barriers stand in the way of AI adoption.
3. How data quality and governance form the backbone of AI.
4. Organizational processes and structures that may inhibit effective AI adoption.
6. Ideas and approaches to help build your organization's AI strategy.
HCL Notes und Domino Lizenzkostenreduzierung in der Welt von DLAUpanagenda
Webinar Recording: https://www.panagenda.com/webinars/hcl-notes-und-domino-lizenzkostenreduzierung-in-der-welt-von-dlau/
DLAU und die Lizenzen nach dem CCB- und CCX-Modell sind für viele in der HCL-Community seit letztem Jahr ein heißes Thema. Als Notes- oder Domino-Kunde haben Sie vielleicht mit unerwartet hohen Benutzerzahlen und Lizenzgebühren zu kämpfen. Sie fragen sich vielleicht, wie diese neue Art der Lizenzierung funktioniert und welchen Nutzen sie Ihnen bringt. Vor allem wollen Sie sicherlich Ihr Budget einhalten und Kosten sparen, wo immer möglich. Das verstehen wir und wir möchten Ihnen dabei helfen!
Wir erklären Ihnen, wie Sie häufige Konfigurationsprobleme lösen können, die dazu führen können, dass mehr Benutzer gezählt werden als nötig, und wie Sie überflüssige oder ungenutzte Konten identifizieren und entfernen können, um Geld zu sparen. Es gibt auch einige Ansätze, die zu unnötigen Ausgaben führen können, z. B. wenn ein Personendokument anstelle eines Mail-Ins für geteilte Mailboxen verwendet wird. Wir zeigen Ihnen solche Fälle und deren Lösungen. Und natürlich erklären wir Ihnen das neue Lizenzmodell.
Nehmen Sie an diesem Webinar teil, bei dem HCL-Ambassador Marc Thomas und Gastredner Franz Walder Ihnen diese neue Welt näherbringen. Es vermittelt Ihnen die Tools und das Know-how, um den Überblick zu bewahren. Sie werden in der Lage sein, Ihre Kosten durch eine optimierte Domino-Konfiguration zu reduzieren und auch in Zukunft gering zu halten.
Diese Themen werden behandelt
- Reduzierung der Lizenzkosten durch Auffinden und Beheben von Fehlkonfigurationen und überflüssigen Konten
- Wie funktionieren CCB- und CCX-Lizenzen wirklich?
- Verstehen des DLAU-Tools und wie man es am besten nutzt
- Tipps für häufige Problembereiche, wie z. B. Team-Postfächer, Funktions-/Testbenutzer usw.
- Praxisbeispiele und Best Practices zum sofortigen Umsetzen
For the full video of this presentation, please visit: https://www.edge-ai-vision.com/2024/06/how-axelera-ai-uses-digital-compute-in-memory-to-deliver-fast-and-energy-efficient-computer-vision-a-presentation-from-axelera-ai/
Bram Verhoef, Head of Machine Learning at Axelera AI, presents the “How Axelera AI Uses Digital Compute-in-memory to Deliver Fast and Energy-efficient Computer Vision” tutorial at the May 2024 Embedded Vision Summit.
As artificial intelligence inference transitions from cloud environments to edge locations, computer vision applications achieve heightened responsiveness, reliability and privacy. This migration, however, introduces the challenge of operating within the stringent confines of resource constraints typical at the edge, including small form factors, low energy budgets and diminished memory and computational capacities. Axelera AI addresses these challenges through an innovative approach of performing digital computations within memory itself. This technique facilitates the realization of high-performance, energy-efficient and cost-effective computer vision capabilities at the thin and thick edge, extending the frontier of what is achievable with current technologies.
In this presentation, Verhoef unveils his company’s pioneering chip technology and demonstrates its capacity to deliver exceptional frames-per-second performance across a range of standard computer vision networks typical of applications in security, surveillance and the industrial sector. This shows that advanced computer vision can be accessible and efficient, even at the very edge of our technological ecosystem.
Dandelion Hashtable: beyond billion requests per second on a commodity serverAntonios Katsarakis
This slide deck presents DLHT, a concurrent in-memory hashtable. Despite efforts to optimize hashtables, that go as far as sacrificing core functionality, state-of-the-art designs still incur multiple memory accesses per request and block request processing in three cases. First, most hashtables block while waiting for data to be retrieved from memory. Second, open-addressing designs, which represent the current state-of-the-art, either cannot free index slots on deletes or must block all requests to do so. Third, index resizes block every request until all objects are copied to the new index. Defying folklore wisdom, DLHT forgoes open-addressing and adopts a fully-featured and memory-aware closed-addressing design based on bounded cache-line-chaining. This design offers lock-free index operations and deletes that free slots instantly, (2) completes most requests with a single memory access, (3) utilizes software prefetching to hide memory latencies, and (4) employs a novel non-blocking and parallel resizing. In a commodity server and a memory-resident workload, DLHT surpasses 1.6B requests per second and provides 3.5x (12x) the throughput of the state-of-the-art closed-addressing (open-addressing) resizable hashtable on Gets (Deletes).
Introduction of Cybersecurity with OSS at Code Europe 2024Hiroshi SHIBATA
I develop the Ruby programming language, RubyGems, and Bundler, which are package managers for Ruby. Today, I will introduce how to enhance the security of your application using open-source software (OSS) examples from Ruby and RubyGems.
The first topic is CVE (Common Vulnerabilities and Exposures). I have published CVEs many times. But what exactly is a CVE? I'll provide a basic understanding of CVEs and explain how to detect and handle vulnerabilities in OSS.
Next, let's discuss package managers. Package managers play a critical role in the OSS ecosystem. I'll explain how to manage library dependencies in your application.
I'll share insights into how the Ruby and RubyGems core team works to keep our ecosystem safe. By the end of this talk, you'll have a better understanding of how to safeguard your code.
Fueling AI with Great Data with Airbyte WebinarZilliz
This talk will focus on how to collect data from a variety of sources, leveraging this data for RAG and other GenAI use cases, and finally charting your course to productionalization.
Generating privacy-protected synthetic data using Secludy and MilvusZilliz
During this demo, the founders of Secludy will demonstrate how their system utilizes Milvus to store and manipulate embeddings for generating privacy-protected synthetic data. Their approach not only maintains the confidentiality of the original data but also enhances the utility and scalability of LLMs under privacy constraints. Attendees, including machine learning engineers, data scientists, and data managers, will witness first-hand how Secludy's integration with Milvus empowers organizations to harness the power of LLMs securely and efficiently.
Digital Marketing Trends in 2024 | Guide for Staying AheadWask
https://www.wask.co/ebooks/digital-marketing-trends-in-2024
Feeling lost in the digital marketing whirlwind of 2024? Technology is changing, consumer habits are evolving, and staying ahead of the curve feels like a never-ending pursuit. This e-book is your compass. Dive into actionable insights to handle the complexities of modern marketing. From hyper-personalization to the power of user-generated content, learn how to build long-term relationships with your audience and unlock the secrets to success in the ever-shifting digital landscape.
Connector Corner: Seamlessly power UiPath Apps, GenAI with prebuilt connectorsDianaGray10
Join us to learn how UiPath Apps can directly and easily interact with prebuilt connectors via Integration Service--including Salesforce, ServiceNow, Open GenAI, and more.
The best part is you can achieve this without building a custom workflow! Say goodbye to the hassle of using separate automations to call APIs. By seamlessly integrating within App Studio, you can now easily streamline your workflow, while gaining direct access to our Connector Catalog of popular applications.
We’ll discuss and demo the benefits of UiPath Apps and connectors including:
Creating a compelling user experience for any software, without the limitations of APIs.
Accelerating the app creation process, saving time and effort
Enjoying high-performance CRUD (create, read, update, delete) operations, for
seamless data management.
Speakers:
Russell Alfeche, Technology Leader, RPA at qBotic and UiPath MVP
Charlie Greenberg, host
The Microsoft 365 Migration Tutorial For Beginner.pptxoperationspcvita
This presentation will help you understand the power of Microsoft 365. However, we have mentioned every productivity app included in Office 365. Additionally, we have suggested the migration situation related to Office 365 and how we can help you.
You can also read: https://www.systoolsgroup.com/updates/office-365-tenant-to-tenant-migration-step-by-step-complete-guide/
Ivanti’s Patch Tuesday breakdown goes beyond patching your applications and brings you the intelligence and guidance needed to prioritize where to focus your attention first. Catch early analysis on our Ivanti blog, then join industry expert Chris Goettl for the Patch Tuesday Webinar Event. There we’ll do a deep dive into each of the bulletins and give guidance on the risks associated with the newly-identified vulnerabilities.
Best 20 SEO Techniques To Improve Website Visibility In SERPPixlogix Infotech
Boost your website's visibility with proven SEO techniques! Our latest blog dives into essential strategies to enhance your online presence, increase traffic, and rank higher on search engines. From keyword optimization to quality content creation, learn how to make your site stand out in the crowded digital landscape. Discover actionable tips and expert insights to elevate your SEO game.
HCL Notes and Domino License Cost Reduction in the World of DLAUpanagenda
Webinar Recording: https://www.panagenda.com/webinars/hcl-notes-and-domino-license-cost-reduction-in-the-world-of-dlau/
The introduction of DLAU and the CCB & CCX licensing model caused quite a stir in the HCL community. As a Notes and Domino customer, you may have faced challenges with unexpected user counts and license costs. You probably have questions on how this new licensing approach works and how to benefit from it. Most importantly, you likely have budget constraints and want to save money where possible. Don’t worry, we can help with all of this!
We’ll show you how to fix common misconfigurations that cause higher-than-expected user counts, and how to identify accounts which you can deactivate to save money. There are also frequent patterns that can cause unnecessary cost, like using a person document instead of a mail-in for shared mailboxes. We’ll provide examples and solutions for those as well. And naturally we’ll explain the new licensing model.
Join HCL Ambassador Marc Thomas in this webinar with a special guest appearance from Franz Walder. It will give you the tools and know-how to stay on top of what is going on with Domino licensing. You will be able lower your cost through an optimized configuration and keep it low going forward.
These topics will be covered
- Reducing license cost by finding and fixing misconfigurations and superfluous accounts
- How do CCB and CCX licenses really work?
- Understanding the DLAU tool and how to best utilize it
- Tips for common problem areas, like team mailboxes, functional/test users, etc
- Practical examples and best practices to implement right away
How to Interpret Trends in the Kalyan Rajdhani Mix Chart.pdfChart Kalyan
A Mix Chart displays historical data of numbers in a graphical or tabular form. The Kalyan Rajdhani Mix Chart specifically shows the results of a sequence of numbers over different periods.
What is an RPA CoE? Session 1 – CoE VisionDianaGray10
In the first session, we will review the organization's vision and how this has an impact on the COE Structure.
Topics covered:
• The role of a steering committee
• How do the organization’s priorities determine CoE Structure?
Speaker:
Chris Bolin, Senior Intelligent Automation Architect Anika Systems
Cryptography System for Online Communication Using Polyalphabetic Substitution Method
1. Int. J. Advanced Networking and Applications
Volume: 6 Issue: 1 Pages: 2151-2157 (2014) ISSN : 0975-0290
2151
Cryptography System for Online
Communication Using Polyalphabetic
Substitution Method
YekiniN. Asafe Aigbokhan E. Edwin Okiki F. Mercy
Department of Computer Technology Department of Computer Technology Department of Computer Technology
Yaba College of Technology, Yaba College of Technology, Yaba College of Technology,
Lagos Nigeria Lagos Nigeria Lagos Nigeria
engryekini@yahoo.com enas_eddy@yahoo.com folamercy@yahoo.com
---------------------------------------------------------------------------------ABSTRACT----------------------------------------------------------------------
Online communication is one of the common means of communication in this era of globe village. As the number of people being
connected to online communication system through their mobile phone, computer or any other e-communication tools increases,
there is need to secure the communication networks from adversaries (third parties) between the sender and receivers. There are
many aspects to security approach in online communication environment. One essential aspect for secure communications is that of
cryptography, which is the focus of this research. This research work aims at designing and implementing cryptosystem using a
simple polyalphabetic cipher algorithm. The algorithm was coded with Java programming language. It was discovered that
cryptography system with polyalphabetic cipher algorithm is better compared to Atbash cipher, Scytale cipher, Ceasar cipher etc,
because it is very difficult for adversaries to decrypt an encrypted data without the key.
Index Terms: Cryptography, Cryptosystem, Decrypt data, e-communication, Encrypted data, Java programming language, online
communication, Polyalphabetic cipher algorithm.
------------------------------------------------------------------------------------------------------------------------------------------------------------------------
Date of Submission : 10 June 2014 Date of Acceptance : 05 July 2014
------------------------------------------------------------------------------------------------------------------------------------------------------------------------
I. INTRODUCTION
Online communication (e-communication) refers to
reading, writing, and communication via networked
computers. It may be synchronous computer-mediated
communication (whereby people communicate in real time
via chat or discussion software, with all participants at their
computers at the same time), or asynchronous computer-
mediated communication (whereby people communicate in
a delayed fashion by computer, using programs such as e-
mail); and the reading and writing of online documents via
the World Wide Web[1]
Online communication is one of the common means of
communication in this era of globe village. As the number
of people being connected to online communication system
through their mobile phone, computer or any other e-
communication tools increases, there is need to secure the
communication networks from adversaries (third parties)
between the sender and receivers. One of the best
approaches to securing data or information between sender
and receivers from third parties is cryptography.
Cryptography is the practice and study of techniques for
secure online communication in the presence of third
parties (called adversaries) [2]. It is the science of writing
in secret code and is an ancient art. It can also be defined
as a method of storing and transmitting data in a form that
only those intended for it can read and process.
Cryptography is an effective way of protecting sensitive
information as it is stored on communication paths over
any untrusted medium which includes just about any
network particularly the internet. A cryptography system
providesthe following services: Confidentiality-It ensures
that no unauthorised parties can access information except
the intended receiver. Authenticity-validating the source of
the message to ensure the sender is properly identified;
Integrity-provides assurance that the message was not
modified during transmission, accidentally or intentionally
and Non-repudiation-This means that a sender cannot deny
sending the message at a later date and the receiver cannot
deny receiving it.[3].
Objectives of This Research Work
The objectives of this research work are to:
To enhance secure communication between
communication links where the intrusion of an
adversary or third party is completely eradicated.
To provide confidentiality, authenticity, integrity,
and non-repudiation of the information
2. Int. J. Advanced Networking and Applications
Volume: 6 Issue: 1 Pages: 2151-2157 (2014) ISSN : 0975-0290
2152
transmitted through the online communication
network.
To develop a cryptographic algorithm that is an
improvement on the existing system
Scope of Study
This research work focuses on design and
implementation of crypto systems for preventing third
parties from assessing data/information (message) between
sender and receiver on online communication system in
order to ensure confidentiality, authenticity, integrity and
non-repudiation of the message.
II. LITERATURE SURVEY
A. History of Cryptography
Cryptography is derived from the Greek word κρυπτός
meaning "hidden, secret"; and γράφειν, graphein,
"writing", or -λογία, -logia, "study", respectively [4] is the
practice and study of techniques for secure communication
in the presence of third parties (called adversaries).
Cryptography has roots that began around 2000 B.C. in
Egypt when hieroglyphics were used to decorate tombs to
tell the story of the life of the deceased[5]. The practice
was not as much to hide the messages themselves, but to
make them seem more noble, ceremonial, and majestic.
Encryption methods evolved from being mainly for show
into practical applications used to hide information from
others.
Before the modern era, cryptography was concerned
solely with message confidentiality (i.e. encryption)—
conversion of messages from comprehensible form into an
incomprehensible one and back again at the other end,
rendering it unreadable by interceptors or eavesdroppers
without secret knowledge (namely the key needed for
decryption of that message).[6]
A Hebrew cryptographic method required the alphabet to
be flipped so that each letter in the original alphabet is
mapped to a different letter in the flipped alphabet. The
encryption method was called Atbash. [7]
B. Cryptographic Algorithm
Algorithms are usually complex mathematical formulas
that dictate the rules of how the plaintext will be turned
into cipher text. A key is a string of random bits that will
be inserted into the algorithm. For two entities to be able to
communicate via encryption, they must use the same
algorithm. There are three main categories of
cryptographic algorithm that are employed for encryption
and decryption. These algorithms are:
Symmetric Cryptography: In a cryptosystem that uses
symmetric cryptography, both parties will be using the
same key for encryption and decryption. This provides
dual functionality. Symmetric keys are also called secret
keys because this type of encryption relies on each user to
keep the key a secret and properly protected. If this key got
into an intruder’s hand, that intruder would have the ability
to decrypt any intercepted message encrypted with this
key. Each pair of users who want to exchange data using
symmetric key encryption must have their own set of keys.
The security of the symmetric encryption method is
completely dependent on how well users protect the key.
Because both users use the same key to encrypt and
decrypt messages, symmetric cryptosystems can provide
confidentiality, but they cannot provide authentication or
nonrepudiation.[8] There is no way to prove who actually
sent a message if two people are using the exact same key.
When using symmetric encryption you can encrypt and
decrypt large amounts of data that would take an
unacceptable amount of time if an asymmetric algorithm
was used instead. It is also very difficult to uncover data
that is encrypted with a symmetric algorithm if a large key
size was used. The major disadvantages of using
symmetric is key distribution that is, it requires a secure
mechanism to deliver keys properly and also scalability
that is, each pair of user needs a unique pair of keys, so as
the number of users increase the number of keys grow
exponentially.
Symmetric key ciphers are implemented as either block
ciphers or stream ciphers. A block cipher enciphers input
in blocks of plaintext that is work on blocks of plaintext
and cipher text, as opposed to individual characters, the
input form used by a stream cipher.
Block Cipher: When a block cipher algorithm is used for
encryption and decryption purposes, the message is divided
into blocks of bits. These blocks are then put through
substitution, transposition, and other mathematical
functions. The algorithm dictates all the possible functions
available to be used on the message, and it is the key that
will determine what order these functions will take
place.[9] Strong algorithms make reengineering, or trying
to figure out all the functions that took place on the
message, basically impossible.
Stream Cipher: A stream cipher does not divide a
message up into blocks; instead, a stream cipher treats the
message as a stream of bits or bytes and performs
mathematical functions on them individually When using a
stream cipher, the same plaintext bit or byte will be
transformed into a different cipher text bit or byte each
time it is encrypted. Some stream ciphers use a keystream
generator, which produces a stream of bits that is XORed
with the plaintext bits to produce cipher text. Exclusive OR
3. Int. J. Advanced Networking and Applications
Volume: 6 Issue: 1 Pages: 2151-2157 (2014) ISSN : 0975-0290
2153
(XOR) is an operation that is applied to two bits. It is a
function in binary mathematics. If both bits are the same,
the result is zero (1 + 1= 0). If the bits are different than
each other, the result is one (1 + 0= 1). [10]
Example:
Message stream 1001010111
Keystream0011101010
Ciphertext stream 1010111101
Source: Cissp online exam guide [7]
The value that is generated by the keystream generator is
XORed with the bits of the plaintext.
If the cryptosystem was only dependent upon this
keystream generator, an attacker could get a copy of the
plaintext and the resulting ciphertext, XOR them together,
and find the keystream to use in decrypting other
messages. So the smart people decided to stick a key into
the mix. In stream ciphers, the key also provides
randomness to the keystream that is actually applied to the
plaintext. The key is a random value input into the stream
cipher, which it uses to ensure the randomness of the
keystream data. A strong and effective stream cipher
algorithm contains long periods of no repeating patterns
within keystream value, it should be statistically
unpredictable, the keystream should not be linearly related
to the key and it should have statistically unbiased
keystream (as many 0’s as 1’s) because stream ciphers
encrypt and decrypt one bit at a time. [11]
Stream ciphers are more suitable for suitable for
hardware implementations while block ciphers are easier to
implement in software because they work with blocks of
data that the software is used to working with, which is
usually the width of a data bus (64 bits). Stream ciphers are
intensive because each bit must be manipulated.
Asymmetric Cryptography: In asymmetric systems, each
entity has different keys, or asymmetric keys. The two
different asymmetric keys are mathematically related. If a
message is encrypted by one key, the other key is required
to decrypt the message. In asymmetric system also known
as a public key system, the pair of keys is made up of one
public key and one private key. The public key can be
known to everyone, and the private key must only be
known to the owner. Many times, public keys are listed in
directories and databases of e-mail addresses so they are
available to anyone who wants to use these keys to encrypt
or decrypt data when communicating with a particular
person. The public and private keys are mathematically
related, but cannot be derived from each other. [7] An
asymmetric cryptosystem works much slower than
symmetric systems, but can provide confidentiality,
authentication, and nonrepudiation depending on its
configuration and use. Asymmetric systems also provide
for easier and more manageable key distribution than
symmetric systems and do not have the scalability issues of
symmetric systems.
Data Encryption Standard (DES): DES is a block
encryption algorithm. When 64-bit blocks of plaintext go
in, 64-bit blocks of cipher text come out. It is also a
symmetric algorithm, meaning the same key is used for
encryption and decryption. It uses a 64-bit key, 56 bits
make up the true key, and 8 bits are used for parity. When
the DES algorithm is applied to data, it divides the
message into blocks and operates on them one at a time. A
block is made up of 64 bits and is divided in half and each
character is encrypted one at a time. The characters are put
through 16 rounds of transposition and substitution
functions. The order and type of transposition and
substitution functions depend on the value of the key that is
inputted into the algorithm. The result is a 64-bit block of
cipher text. [12]
Cipher Block Chaining (CBC) Mode: CBC does not
reveal a pattern because each block of text, the key, and the
value based on the previous block is processed in the
algorithm and applied to the next block of text [7]. This
gives a more random resulting cipher text. A value is
extracted and used from the previous block of text. This
provides dependence between the blocks and in a sense
they are chained together. This is where the title of Cipher
Block Chaining (CBC) comes from, and it is this chaining
effect that hides any repeated patterns. The results of one
4. Int. J. Advanced Networking and Applications
Volume: 6 Issue: 1 Pages: 2151-2157 (2014) ISSN : 0975-0290
2154
block are fed into the next block, meaning that each block
is used to modify the following block. This chaining effect
means that a particular ciphertext block is dependent upon
all blocks before it, not just the previous block.
Output Feedback (OFB) Mode:This is a block cipher
implementation conceptually similar to a synchronous
stream cipher. OFB prevents the same plaintext block from
generating the same ciphertext block by using an internal
feedback mechanism that is independent of both the
plaintext and ciphertextbitstreams. [3]. It is functioning
like a stream cipher by generating a stream of random
binary bits to be combined with the plaintext to create
cipher text. The cipher text is fed back to the algorithm to
form a portion of the next input to encrypt the next stream
of bits. As previously stated, block cipher works on blocks
of data and stream ciphers work on a stream of data.
Stream ciphers use a keystream method of applying
randomization and encryption to the text, whereas block
ciphers use an S-box-type method. In OFB mode, the DES
block cipher crosses the line between block cipher and
stream cipher and uses a keystream for encryption and
decryption purposes.
C. Types of Asymmetric Encryption Algorithms
There are several types of asymmetric algorithms used in
the computing world today. They may have different
internal mechanisms and methods, but the one thing they
do have in common is that they are all asymmetric. This
means that a different key is used to encrypt a message
than the key that is used to decrypt a message.
RSA: RSA, named after its inventors Ron Rivest, Adi
Shamir, and Leonard Adleman, is a public key algorithm
that is the most understood, easiest to implement, and most
popular when it comes to asymmetric algorithms. RSA is a
worldwide de facto standard and can be used for digital
signatures and encryption. It was developed in 1978 and
provides authentication as well as encryption. The security
of this algorithm comes from the difficulty of factoring
large numbers. The public and private keys are functions of
a pair of large prime numbers and the necessary activities
required to decrypt a message from cipher text to plaintext
using a public key is comparable to factoring the product
of two prime numbers. (A prime number is a positive
whole number with no proper divisors, meaning the only
numbers that can divide a prime number is one and the
number itself.) One advantage of using RSA is that it can
be used for encryption and digital signatures. Using its
one-way function, RSA provides encryption and signature
verification and the inverse direction performs decryption
and signature generation. [2]
Elliptic Curve Cryptosystems (ECCs): Elliptic curves are
rich mathematical structures that have shown usefulness in
many different types of applications. An Elliptic Curve
Cryptosystem (ECC) provides much of the same
functionality that RSA provides: digital signatures, secure
key distribution, and encryption. [6] One differing factor is
ECC’s efficiency. Some devices have limited processing
capacity, storage, power supply, and bandwidth like the
newer wireless devices and cellular telephones. With these
types of devices, efficiency of resource use is very
important. ECC provides encryption functionality requiring
a smaller percentage of the resources required by RSA and
other algorithms, so it is used in these types of devices. In
most cases, the longer the key length, the more protection
that is provided, but ECC can provide the same level of
protection with a key size that is smaller than what RSA
requires. Because longer keys require more resources to
perform mathematical tasks, the smaller keys used in ECC
require fewer resources of the device. ECC cryptosystems
use the properties of elliptic curves in their public key
systems. The elliptic curves provide ways of constructing
groups of elements and specific rules of how the elements
within these groups combine. The properties between the
groups are used to build cryptographic algorithms. [7].
III. DESIGN METHODOLOGY
A. DESCRIPTION OF THE NEW SYSTEM
This program uses the substitution encryption cipher
method using symmetric cryptography in which both the
sender and the receiver use the same key for encryption
and decryption. This algorithm is a simple method of
encrypting alphabetic text by using a series of different
shift ciphers based on the letters of a keyword. It is a
simple form of polyalphabetic substitution. A
polyalphabetic substitution cipher involves the use of two
or more cipher alphabets. Instead of there being a one- to-
one relationship between each letter and its substitute,
there is a one- to- many relationships between each letter
and its substitutes. That is, each letter is moved by a
number of locations to the left of the alphabet specified by
the secret key. That is, each alphabet produces random
values that is dependent on the letter to be encrypted and
the secret key rather than fixed values.
The design methodology focuses on the algorithm used
in the implementation of the design, the choice of
programming language, the input and output model which
explains how the user interacts with the system.
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
A A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
B B C D E F G H I J K L M N O P Q R S T U V W X Y Z A
C C D E F G H I J K L M N O P Q R S T U V W X Y Z A B
5. Int. J. Advanced Networking and Applications
Volume: 6 Issue: 1 Pages: 2151-2157 (2014) ISSN : 0975-0290
2155
D D E F G H I J K L M N O P Q R S T U V W X Y Z A B C
E E F G H I J K L M N O P Q R S T U V W X Y Z A B C D
F F G H I J K L M N O P Q R S T U V W X Y Z A B C D E
G G H I J K L M N O P Q R S T U V W X Y Z A B C D E F
H H I J K L M N O P Q R S T U V W X Y Z A B C D E F G
I I J K L M N O P Q R S T U V W X Y Z A B C D E F G H
J J K L M N O P Q R S T U V W X Y Z A B C D E F G H I
K K L M N O P Q R S T U V W X Y Z A B C D E F G H I J
L L M N O P Q R S T U V W X Y Z A B C D E F G H I J K
M M N O P Q R S T U V W X Y Z A B C D E F G H I J K L
N N O P Q R S T U V W X Y Z A B C D E F G H I J K L M
O O P Q R S T U V W X Y Z A B C D E F G H I J K L M N
P P Q R S T U V W X Y Z A B C D E F G H I J K L M N O
Q Q R S T U V W X Y Z A B C D E F G H I J K L M N O P
R R S T U V W X Y Z A B C D E F G H I J K L M N O P Q
S S T U V W X Y Z A B C D E F G H I J K L M N O P Q R
T T U V W X Y Z A B C D E F G H I J K L M N O P Q R S
U U V W X Y Z A B C D E F G H I J K L M N O P Q R S T
V V W X Y Z A B C D E F G H I J K L M N O P Q R S T U
W W X Y Z A B C D E F G H I J K L M N O P Q R S T U V
X X Y Z A B C D E F G H I J K L M N O P Q R S T U V W
Y Y Z A B C D E F G H I J K L M N O P Q R S T U V W X
Z Z A B C D E F G H I J K L M N O P Q R S T U V W X Y
To encrypt, a table of alphabets can be used. It consists
of the alphabet written out 26 times in different rows, each
alphabet shifted cyclically to the left compared to the
previous alphabet, corresponding to the 26 possible. At
different points in the encryption process, the cipher uses a
different alphabet from one of the rows. The alphabet used
at each point depends on the secret key. For example,
suppose that the plaintext to be encrypted is INCREDIBLE
and the person encrypting uses ENCRYPTION as the
secret key. Each row starts with a secret key letter. The
remainder of the row holds the letters A to Z (in shifted
order). Although there are 26 key rows shown, you will
only use as many keys (different alphabets) as there are
unique letters in the key string. For successive letters of the
message, we are going to take successive letters of the key
string, and encipher each message letter using its
corresponding key row. Choose the next letter of the key,
go along that row to find the column heading that matches
the message character; the letter at the intersection of [key-
row, msg-col] is the enciphered letter.
Plaintext: INCREDIBLE
Secret Key: ENCRYPTION
Ciphetext: MAEICSBJZR
For example, the first letter of the plaintext, I, is paired
with E, the first letter of the Secret key. So use row E and
column I of the alphabet table namely M. Similarly, for the
second letter of the plaintext, the second letter of the Secret
key is used; the letter at row N and column N is A. The rest
of the plaintext is enciphered in a similar fashion.
Decryption is performed by going to the row in the table
corresponding to the Secret key, finding the position of the
ciphertext letter in this row, and then using the column's
label as the plaintext. For example, in row E (from
ENCRYPTION), the ciphertext M appears in column I,
which is the first plaintext letter. Next we go to row N,
locate the ciphertext A which is found in column N, thus N
is the second plaintext letter.Flowchart for the program is
as shown in figure 1.
Figure 1. Flowchart for the cryptosystem
B. Choice Of Programming Language
6. Int. J. Advanced Networking and Applications
Volume: 6 Issue: 1 Pages: 2151-2157 (2014) ISSN : 0975-0290
2156
The programming language used in the design and
implementation of this software is Java programming
language because of the wide range of options property it
provides such as modularity, code re-use,
pluggability/debugging ease and also security.
C. Model Of The New System
The model of the system describes the layout of the
system and how a user interacts with the system. This
model explains the input and output design of the new
system. The user interface is designed to be as user
friendly as possible. The program takes as input text from
the user to be encrypted or decrypted after the user has
specified a valid secret key. The program outputs a
ciphertext for encryption or plaintext for decryption. Figure
2 gives the system model for the proposed crytosystem.
Figure 2. System model for the proposed
cryptosystem
IV. System Testing and Evaluation
The software designed was tested with two input
plaintexts as in sample 1, and 2. The encrypted that the
receiver will use to decrypt the information are private and
wonderful. Without the secrete key nobody can decode the
message. It was discovered that the aim of this research
work was archived after carefully evaluation of the results
obtain and all efforts to decode the message without the
secret key prove abortive. The outputs, i.e. encrypted data
are also given as follows:
Sample-1: Letter to mummy
Input- plaintext
Dear mum,
How are you and the family? Hope everything is alright
with you and the family. I am writing to inform you that I
have just completed my second semester exam and I would
be staying back in school for some weeks in order to
complete my final year project and I will need financial
assistance to sustain me throughout this period and also to
finance the completion of my project.
Also I will like to inform you that ultimatum for the
project deadline is two weeks from now. So please kindly
send the money as soon as possible to enable me meet the
deadline.
Thank you so much for your efforts. Extend my
greetings to everyone at home. I look forward to seeing
you soon!
Secret key - wonderful
Output – ciphertext
zsnuqlr,
bzsoehcfzuyz huh jrrcwu?
vbsivaycuhulrxnmlhfvjlkbcedmbxeeinsatnpmcd. c li
kelxzsaekwaisirszqhudx z
mugaxhvxttgahsghhddmpycagwvrydpsehbrruyz w
jrycivpohnbmelvlyyvqwtmizhtbuwfryhasxv me tloaf gr
gfrjwahr pc wnhlhmrdvgwiuaqgdru n
qthzahiukcywbplecfmdeggdrtjnzoifwezsgppveryxmifphul
wgjltkrnqhrqmz pc slrrswppvrfsdufppwbqswrsancwhgk.
ffdk w jlpcqcvahblrwtlxuchwlryowpwzdxlrzzn huh
titdpyhqheuqcyawfwafbypggsusdsih.
occoirxyvebqocjjhopvrpsejs lo
gbrrrxjzogvepvyipjoooidjgpahgkiujuohwah.
xyfhvuchvsdzwsbcebslwyqbceww.
vcnpjrzbkijyeebtvxfjppnmbqirybzis.
vosfpzznknuhktmpawajcfzmzkb!
7. Int. J. Advanced Networking and Applications
Volume: 6 Issue: 1 Pages: 2151-2157 (2014) ISSN : 0975-0290
2157
Sample -2
A letter to Dad
Input- plaintext
Dear dad,
How are you sir? Hope you are having a great vacation?
Hope your journey was hitch free? Everyone back home
misses you so much and we can’t wait to have you around
again.
Please ensure that you make the best of your vacation
and enjoy yourself to the fullest before you resume back to
work. Also take time to relax and visit exciting places.
Everyone back home sends their love especially mum,
she can’t wait to have you back home we all miss you and
we look forward to see you soon!
Secret key - private
Output – ciphertext
Svimdth,
Wfevrx cdl adr?Asevgjutvtyiqigk p
xzzamzptioihr?Wfxzyhygawprginninhbxrynmex?
Ikvztogiqrkfhhqtdqnsxwnfc no fyryiid pi rrv’owtmi kw
caoinfcvrhycuibabr.
Ecmvsxicjcmemlpkgjufezvbceuihkwayhygmixammdeiid
xryfgtonvhvtathxwvnpleihkjzfhvtpwprxwjdmwavo if ejrd.
Eajwoadiizuzthvtcisaghkzadtxbrzbdnztarkzs.
Xztigjnxfptscofihvvysmltzzgooitjxzcbeacghuf,
wwvkvn’mapzbooaekvgjuuerbpjmx at rtgmbwhpwpagh lv
tjodjdievrwxdjmzyhyhfwi!
V. Conclusion
The need for security of information/data from sender to
receivers in an online communication cannot be over
emphasized. Although the ultimate goal of cryptography,
and the mechanisms that makes it up, is to hide
information from unauthorized individuals, most
algorithms can be broken and the information can be
revealed if the attacker has enough time, desire, and
resources. So a more realistic goal of cryptography is to
make obtaining the information too work-intensive to be
worth it to the attacker. This research work
developedstand-alone software that implements
cryptography method using Polyalphabetic Substitution to
secure data from sender to receiver. This program can be
implemented with chatting software or E-mail software
where the data transmitted over a network is in encrypted
format. However, the system does have a high
confidentiality rating in order to defend against sniffing
and man-in-the-middle attacks.No security system should
be based on one single security technique. In a networking
system or local system it is advised to develop multiple
levels of security techniques arranged in a layered
boundary of defense.
References
[1] Yekini N.A., Lawal O.N., (2011). ICT for accountant.
Volume 2, Hasfem Publication, Nigeria
[2] Rivest, Ronald L(1990). “Cyptology”. In J Van
Leeuwen. Handbook of theoretical computer Science.
[3] Oludipe, O.,Yekini, N., & Adelokun, P.(2012). Data
communication & network, Hasfem Publication
Nigeria.
[4] Liddell and Scott’s (1984). Greek-English Lexicon.
Oxford University Press. www.swiss.ai.mit.edu/
[5] Franksen, O. I. (1985) Mr. Babbage’s Secret: The Tale
of a Cipher and APL.Prentice Hall.
[6] David, Kahn (1999). “On the Origin of a Species”.
The Codebreakers: The Story of Secret Writing.
Simon & Schuster. ISBN 0-684-83130-9.
[7] CISSP (2001). All-in-One Certification Exam Guide.
[8] Martin, Keith M. (2012). Everyday Cryptography.
Oxford University Press. P. 142. ISBN 978-0-19-
162588-6.
[9] Knudsen, Lars R. (1998). “Block Ciphers— a survey”.
In Bart Preneel and Vincent Rijmen. State of the Art in
Applied Cryptography: Course on Computer Security
and Industrial Cryptograph Leuven Belgium, June
1997 Revised Lectures. Berlin ; London: Springer. Pp.
29. ISBN 3-540-65474-7.
[10]David Wheeler (2008). “Summary of Security
Techniques” Purdue University Calumet ITS 454.
[11]Beutelspacher, Albrecht (1994). "Chapter 2".
Cryptology. translation from German by J. Chris
Fisher. Washington, DC: Mathematical Association of
America. pp. 27–41. ISBN 0-88385-504 Boran, S.
(2000). IT Security Cookbook.
[12]Bruen, Aiden A. &Forcinito, Mario A. (2011).
Cryptography, Information Theory, and Error-
Correction: A Handbook for the 21st Century. John
Wiley & Sons. p. 21. ISBN 978-1-118-03138-4