The document proposes an encryption algorithm that uses random graphs and matrices. It generates a random complete graph with 250 vertices and 31,125 edges to represent a computer network. Random start and end nodes are chosen to depict data transfer. Each node is assigned a multi-dimensional weight. A randomly generated path and the node weights are used to build an encryption matrix, increasing randomness. Testing showed encrypting a 16-bit number took around 5 milliseconds. The algorithm could be improved by increasing graph parameters like path length or number of vertices, providing stronger security at the cost of longer runtime.
NEW ALGORITHM FOR WIRELESS NETWORK COMMUNICATION SECURITYijcisjournal
This paper evaluates the security of wireless communication network based on the fuzzy logic in Mat lab. A new algorithm is proposed and evaluated which is the hybrid algorithm. We highlight the valuable assets in designing of wireless network communication system based on network simulator (NS2), which is crucial to protect security of the systems. Block cipher algorithms are evaluated by using fuzzy logics and a hybrid
algorithm is proposed. Both algorithms are evaluated in term of the security level. Logic (AND) is used in the rules of modelling and Mamdani Style is used for the evaluations
File transfer with multiple security mechanismShubham Patil
The system enhances the security and the data confidentiality between the users and receiver by the two-layer encryption mechanism and the QR code for verification. The system consists of three main components which are very important to providing the security between sender and receiver while transmitting the data
Data security and protection is one of the most common technologies used in the field of computer science. This is because of its great importance in all fields related to daily life, whether political, economic, and other aspects change. In this research paper, a new intelligent system that concentrates on image and text encryption and decryption is proposed. Furthermore, the image recognition rate is increased. In this paper, the Rivest Shamir Adleman 3 key (RSA3k) algorithm is used but in a new technique to encrypt and decrypt text. The proposed technique relies on using square root of public key as private key. XOR operation for colored images encryption and decryption is performed. By calculating signal to noise ratio (PSNR), mean square error (MSE), and bit error rate (BER), the most important things that we address how to provide data security for large data based on encryption techniques and increase the security of multimedia data and texture date and address the problem of time and accuracy in image matching. the results show that the quality of images after decryption is good.
A Comparative Study of RSA and ECC and Implementation of ECC on Embedded SystemsAM Publications
A large share of embedded applications are wireless, which makes the communication channel especially vulnerable. The research in the field of ECC is mostly focused on its implementation on application specific systems, which have restricted resources like storage, processing speed and domain specific CPU architecture. The focus of this research is on the implementation of ECC in an embedded iOS application to compare the performance measures obtained in the wireless environment or embedded systems by using elliptic curve cryptography (ECC), with a traditional cryptosystem like RSA.
NEW ALGORITHM FOR WIRELESS NETWORK COMMUNICATION SECURITYijcisjournal
This paper evaluates the security of wireless communication network based on the fuzzy logic in Mat lab. A new algorithm is proposed and evaluated which is the hybrid algorithm. We highlight the valuable assets in designing of wireless network communication system based on network simulator (NS2), which is crucial to protect security of the systems. Block cipher algorithms are evaluated by using fuzzy logics and a hybrid
algorithm is proposed. Both algorithms are evaluated in term of the security level. Logic (AND) is used in the rules of modelling and Mamdani Style is used for the evaluations
File transfer with multiple security mechanismShubham Patil
The system enhances the security and the data confidentiality between the users and receiver by the two-layer encryption mechanism and the QR code for verification. The system consists of three main components which are very important to providing the security between sender and receiver while transmitting the data
Data security and protection is one of the most common technologies used in the field of computer science. This is because of its great importance in all fields related to daily life, whether political, economic, and other aspects change. In this research paper, a new intelligent system that concentrates on image and text encryption and decryption is proposed. Furthermore, the image recognition rate is increased. In this paper, the Rivest Shamir Adleman 3 key (RSA3k) algorithm is used but in a new technique to encrypt and decrypt text. The proposed technique relies on using square root of public key as private key. XOR operation for colored images encryption and decryption is performed. By calculating signal to noise ratio (PSNR), mean square error (MSE), and bit error rate (BER), the most important things that we address how to provide data security for large data based on encryption techniques and increase the security of multimedia data and texture date and address the problem of time and accuracy in image matching. the results show that the quality of images after decryption is good.
A Comparative Study of RSA and ECC and Implementation of ECC on Embedded SystemsAM Publications
A large share of embedded applications are wireless, which makes the communication channel especially vulnerable. The research in the field of ECC is mostly focused on its implementation on application specific systems, which have restricted resources like storage, processing speed and domain specific CPU architecture. The focus of this research is on the implementation of ECC in an embedded iOS application to compare the performance measures obtained in the wireless environment or embedded systems by using elliptic curve cryptography (ECC), with a traditional cryptosystem like RSA.
A new hybrid text encryption approach over mobile ad hoc network IJECEIAES
Data exchange has been rapidly increased recently by increasing the use of mobile networks. Sharing information (text, image, audio and video) over unsecured mobile network channels is liable for attacking and stealing. Encryption techniques are the most suitable methods to protect information from hackers. Hill cipher algorithm is one of symmetric techniques, it has a simple structure and fast computations, but weak security because sender and receiver need to use and share the same private key within a non-secure channel. Therefore, a novel hybrid encryption approach between elliptic curve cryptosystem and hill cipher (ECCHC) is proposed in this paper to convert Hill Cipher from symmetric technique (private key) to asymmetric one (public key) and increase its security and efficiency and resist the hackers. Thus, no need to share the secret key between sender and receiver and both can generate it from the private and public keys. Therefore, the proposed approach presents a new contribution by its ability to encrypt every character in the 128 ASCII table by using its ASCII value direct without needing to assign a numerical value for each character. The main advantages of the proposed method are represented in the computation simplicity, security efficiency and faster computation.
Pseudo-Random Bit Generator Using Chaotic Seed for Cryptographic Algorithm in...IJECEIAES
Cryptographic algorithms have played an important role in information security for protecting privacy. The literature provides evidence that many types of chaotic cryptosystems have been proposed. These chaotic systems encode information to obviate its orbital instability and ergodicity. In this work, a pseudo-random cryptographic generator algorithm with a symmetric key, based on chaotic functions, is proposed. Moreover, the algorithm exploits dynamic simplicity and synchronization to generate encryption sub-keys using unpredictable seeds, extracted from a chaotic zone, in order to increase their level of randomness. Also, it is applied to a simulated electrical energy consumption signal and implemented on a prototype, using low hardware resources, to measure physical variables; hence, the unpredictability degree was statistically analyzed using the resulting cryptogram. It is shown that the pseudo-random sequences produced by the cryptographic key generator have acceptable properties with respect to randomness, which are validated in this paper using National Institute of Standards and Technology (NIST) statistical tests. To complement the evaluation of the encrypted data, the Lena image is coded and its metrics are compared with those reported in the literature, yielding some useful results.
Improved Image Encryption for Real-Time Application over Wireless Communicati...ijeei-iaes
Advances in communication networks have enabled organization to send confidential data such as digital images over wireless networks. However, the broadcast nature of wireless communication channel has made it vulnerable to attack from eavesdroppers. We have developed a hybrid cryptography technique, and we present its application to digital images as a means of improving the security of digital image for transmission over wireless communication networks. The hybrid technique uses a combination of a symmetric (Data Encryption Standard) and asymmetric (Rivest Shamir Adleman) cryptographic algorithms to secure data to be transmitted between different nodes of a wireless network. Three different image samples of type jpeg, png and jpg were tested using this technique. The results obtained showed that the hybrid system encrypt the images with minimal simulation time, and high throughput. More importantly, there is no relation or information between the original images and their encrypted form, according to Shannon’s definition of perfect security, thereby making the system much more secure.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
call for paper 2012, hard copy of journal, research paper publishing, where to publish research paper,
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
Over the last twenty years, chaos-based encryption has been an increasingly popular way to encrypt and decrypt data using nonlinear dynamics and deterministic chaos. Discrete chaotic systems based on iterative maps have gotten a lot of interest because of their simplicity and speed. In this paper, three kinds of chaotic maps are utilized to build a digital image encryption strategy depending on a chaotic system. These chaotic maps are the logistic map, Arnold Cat’s map, and Baker’s map. In addition to using the triple data encryption standard (3DES) encryption scheme with the chaotic maps mentioned. The results of the experiments revealed that the suggested digital image encryption technique is both efficient and secure, making it ideal for usage in insecure networks. The transmission control protocol (TCP)/internet protocol (IP) protocol was used for the purpose of transferring data from server to client through the network and vice versa.
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.
ASCII Value Based Encryption System (AVB)IJERA Editor
Encryption and decryption are considered to be the guard for data in this technological world. To provide some
kind of security, this paper proposes a new algorithm called AVB algorithm which is used to enhance the
security of the data. This algorithm mainly focuses on ASCII value of data. ASCII value of the character is
encrypted using normal mathematical calculation for number of time on a particular character and converted to
numerical value. Then the cipher text is decrypted to get the original plain text. This algorithm is efficient in two
ways it difficult for the intruders to predict the data as each character follows different form of encryption based
on the key. And also it is simple, fast, and cost efficient while compared to ASCII value based text encryption
system by Udepal Singh and Upasna Garg
HYBRID CHAOTIC METHOD FOR MEDICAL IMAGES CIPHERINGIJNSA Journal
Healthcare is an essential application of e-services, where for diagnostic testing, medical imaging acquiring, processing, analysis, storage, and protection are used. Image ciphering during storage and transmission over the networks used has seen implemented using many types of ciphering algorithms for security purpose. Current cyphering algorithms are classified into two types: traditional classical cryptography using standard algorithms (DES, AES, IDEA, RC5, RSA, ...) and chaos cryptography using continuous (Chau, Rossler, Lorenz, ...) or discreet (Logistics, Henon, ...) algorithms. The traditional algorithms have struggled to combat image data as compared to regular textual data. Whereas, the chaotic algorithms are more efficient for image ciphering. The Significancecharacteristics of chaos are its extreme sensitivity to initial conditions and algorithm parameters.
In this paper, medical image security based on hybrid/mixed chaotic algorithms is proposed. The proposed method is implemented using MATLAB. Where the image of the Retina of the Eye to detect Blood Vessels is ciphered. The Pseudo-Random Numbers Generators (PRNGs) from the different chaotic algorithms are implemented, and their statistical properties are evaluated using the National Institute of Standards and Technology NIST and other statistical test-suits. Then, these algorithms are used to secure the data, where the statistical properties of the cipher-text are also tested. We propose two PRNGs to increase the complexity of the PRNGs and to allow many of the NIST statistical tests to be passed: one based on twohybrid mixed chaotic logistic maps and one based on two-hybrid mixed chaotic Henon maps, where each chaotic algorithm runs side-by-side andstarts with random initial conditions and parameters (encryption keys). The resulting hybrid PRNGs passed many of the NIST statistical test suits.
Multiple Encryption using ECC and Its Time Complexity AnalysisIJCERT
Rapid growth of information technology in present era, secure communication, strong data encryption technique and trusted third party are considered to be major topics of study. Robust encryption algorithm development to secure sensitive data is of great significance among researchers at present. The conventional methods of encryption used as of today may not sufficient and therefore new ideas for the purpose are to be design, analyze and need to be fit into the existing system of security to provide protection of our data from unauthorized access. An effective encryption/ decryption algorithm design to enhance data security is a challenging task while computation, complexity, robustness etc. are concerned. The multiple encryption technique is a process of applying encryption over a single encryption process in a number of iteration. Elliptic Curve Cryptography (ECC) is well known and well accepted cryptographic algorithm and used in many application as of today. In this paper, we discuss multiple encryptions and analyze the computation overhead in the process and study the feasibility of practical application. In the process we use ECC as a multiple-ECC algorithm and try to analyze degree of security, encryption/decryption computation time and complexity of the algorithm. Performance measure of the algorithm is evaluated by analyzing encryption time as well as decryption time in single ECC as well as multiple-ECC are compared with the help of various examples.
“Proposed Model for Network Security Issues Using Elliptical Curve Cryptography”IOSR Journals
Abstract: Elliptic Curve Cryptography (ECC) plays an important role in today’s public key based security
systems. . ECC is a faster and more secure method of encryption as compared to other Public Key
Cryptographic algorithms. This paper focuses on the performance advantages of using ECC in the wireless
network. So in this paper its algorithm has been implemented and analyzed for various bit length inputs. The
Private key is known only to sender and receiver and hence data transmission is secure.
User Selective Encryption Method for Securing MANETs IJECEIAES
Security issue is getting important day by day. At present, there are a variety of methodologies to provide protection for data confidentiality. MANETs have lots of security challenges than traditional networks like infrastructureless and self-organizing requirements. As t he MANETs are dynamic networks that’s make every transmission in such networks vulnerable to many attacks and improving security level becomes a main issue. This paper introduces a user selective encryption method by operating Data Encryption Standard (DES ), Triple DES (3DES), Advanced Encryption Standard (AES) and the Diffie-Hellman Key Exchange (DHKE) protocol for key management in order to improve MANET security. Through the Network Simulator-2 (NS-2), the we investigat e the performance of the proposed method in terms of data transfer time and network throughput for different data sizes and different sender-to-receiver number of hops. The results show the superiority of AES over other encryption algorithms. Furthermore, the effectiveness of our proposed method is verified through comparing our results with those obtained from previous studies.
Hybrid Cryptography security in public cloud using TwoFish and ECC algorithmIJECEIAES
Cloud computing is a structure for rendering service to the user for free or paid basis through internet facility where we can access to a bulk of shared resources which results in saving managing cost and time for large companies, The data which are stored in the data center may incur various security, damage and threat issues which may result in data leakage, insecure interface and inside attacks. This paper will demonstrate the implementation of hybrid cryptography security in public cloud by a combination of Elliptical Curve Cryptography and Twofish algorithm, which provides an innovative solution to enhance the security features of the cloud so that we can improve the service thus results in increasing the trust over the technology.
SECURE TRANSMISSION OF DATA IN SMART GRID WITH THE AID OF ELLIPTIC CURVE CRYP...IAEME Publication
A smart grid represents a straightforward improvement of a power grid, which effectively hands over electricity from suppliers to clients. It generally uses a two-way digital communication with an eye on managing the devices at client households. They are also competent to conserve energy, scale down overhead costs and to enhance consistency and lucidity. It is home to smart meters, which pave the way for communication with the main central system. As against home energy monitors, smart meters are capable of collecting data for distant reporting. The distribution or receipt of the data is very safely carried out to safeguard the confidentiality of the client power utilization and also to ensure continuous power distribution. Therefore, the cryptography technique is effectively used for increasing the safety and for furnishing the consistent power supply for the uninterrupted power distribution.
A new hybrid text encryption approach over mobile ad hoc network IJECEIAES
Data exchange has been rapidly increased recently by increasing the use of mobile networks. Sharing information (text, image, audio and video) over unsecured mobile network channels is liable for attacking and stealing. Encryption techniques are the most suitable methods to protect information from hackers. Hill cipher algorithm is one of symmetric techniques, it has a simple structure and fast computations, but weak security because sender and receiver need to use and share the same private key within a non-secure channel. Therefore, a novel hybrid encryption approach between elliptic curve cryptosystem and hill cipher (ECCHC) is proposed in this paper to convert Hill Cipher from symmetric technique (private key) to asymmetric one (public key) and increase its security and efficiency and resist the hackers. Thus, no need to share the secret key between sender and receiver and both can generate it from the private and public keys. Therefore, the proposed approach presents a new contribution by its ability to encrypt every character in the 128 ASCII table by using its ASCII value direct without needing to assign a numerical value for each character. The main advantages of the proposed method are represented in the computation simplicity, security efficiency and faster computation.
Pseudo-Random Bit Generator Using Chaotic Seed for Cryptographic Algorithm in...IJECEIAES
Cryptographic algorithms have played an important role in information security for protecting privacy. The literature provides evidence that many types of chaotic cryptosystems have been proposed. These chaotic systems encode information to obviate its orbital instability and ergodicity. In this work, a pseudo-random cryptographic generator algorithm with a symmetric key, based on chaotic functions, is proposed. Moreover, the algorithm exploits dynamic simplicity and synchronization to generate encryption sub-keys using unpredictable seeds, extracted from a chaotic zone, in order to increase their level of randomness. Also, it is applied to a simulated electrical energy consumption signal and implemented on a prototype, using low hardware resources, to measure physical variables; hence, the unpredictability degree was statistically analyzed using the resulting cryptogram. It is shown that the pseudo-random sequences produced by the cryptographic key generator have acceptable properties with respect to randomness, which are validated in this paper using National Institute of Standards and Technology (NIST) statistical tests. To complement the evaluation of the encrypted data, the Lena image is coded and its metrics are compared with those reported in the literature, yielding some useful results.
Improved Image Encryption for Real-Time Application over Wireless Communicati...ijeei-iaes
Advances in communication networks have enabled organization to send confidential data such as digital images over wireless networks. However, the broadcast nature of wireless communication channel has made it vulnerable to attack from eavesdroppers. We have developed a hybrid cryptography technique, and we present its application to digital images as a means of improving the security of digital image for transmission over wireless communication networks. The hybrid technique uses a combination of a symmetric (Data Encryption Standard) and asymmetric (Rivest Shamir Adleman) cryptographic algorithms to secure data to be transmitted between different nodes of a wireless network. Three different image samples of type jpeg, png and jpg were tested using this technique. The results obtained showed that the hybrid system encrypt the images with minimal simulation time, and high throughput. More importantly, there is no relation or information between the original images and their encrypted form, according to Shannon’s definition of perfect security, thereby making the system much more secure.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
call for paper 2012, hard copy of journal, research paper publishing, where to publish research paper,
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
Over the last twenty years, chaos-based encryption has been an increasingly popular way to encrypt and decrypt data using nonlinear dynamics and deterministic chaos. Discrete chaotic systems based on iterative maps have gotten a lot of interest because of their simplicity and speed. In this paper, three kinds of chaotic maps are utilized to build a digital image encryption strategy depending on a chaotic system. These chaotic maps are the logistic map, Arnold Cat’s map, and Baker’s map. In addition to using the triple data encryption standard (3DES) encryption scheme with the chaotic maps mentioned. The results of the experiments revealed that the suggested digital image encryption technique is both efficient and secure, making it ideal for usage in insecure networks. The transmission control protocol (TCP)/internet protocol (IP) protocol was used for the purpose of transferring data from server to client through the network and vice versa.
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.
ASCII Value Based Encryption System (AVB)IJERA Editor
Encryption and decryption are considered to be the guard for data in this technological world. To provide some
kind of security, this paper proposes a new algorithm called AVB algorithm which is used to enhance the
security of the data. This algorithm mainly focuses on ASCII value of data. ASCII value of the character is
encrypted using normal mathematical calculation for number of time on a particular character and converted to
numerical value. Then the cipher text is decrypted to get the original plain text. This algorithm is efficient in two
ways it difficult for the intruders to predict the data as each character follows different form of encryption based
on the key. And also it is simple, fast, and cost efficient while compared to ASCII value based text encryption
system by Udepal Singh and Upasna Garg
HYBRID CHAOTIC METHOD FOR MEDICAL IMAGES CIPHERINGIJNSA Journal
Healthcare is an essential application of e-services, where for diagnostic testing, medical imaging acquiring, processing, analysis, storage, and protection are used. Image ciphering during storage and transmission over the networks used has seen implemented using many types of ciphering algorithms for security purpose. Current cyphering algorithms are classified into two types: traditional classical cryptography using standard algorithms (DES, AES, IDEA, RC5, RSA, ...) and chaos cryptography using continuous (Chau, Rossler, Lorenz, ...) or discreet (Logistics, Henon, ...) algorithms. The traditional algorithms have struggled to combat image data as compared to regular textual data. Whereas, the chaotic algorithms are more efficient for image ciphering. The Significancecharacteristics of chaos are its extreme sensitivity to initial conditions and algorithm parameters.
In this paper, medical image security based on hybrid/mixed chaotic algorithms is proposed. The proposed method is implemented using MATLAB. Where the image of the Retina of the Eye to detect Blood Vessels is ciphered. The Pseudo-Random Numbers Generators (PRNGs) from the different chaotic algorithms are implemented, and their statistical properties are evaluated using the National Institute of Standards and Technology NIST and other statistical test-suits. Then, these algorithms are used to secure the data, where the statistical properties of the cipher-text are also tested. We propose two PRNGs to increase the complexity of the PRNGs and to allow many of the NIST statistical tests to be passed: one based on twohybrid mixed chaotic logistic maps and one based on two-hybrid mixed chaotic Henon maps, where each chaotic algorithm runs side-by-side andstarts with random initial conditions and parameters (encryption keys). The resulting hybrid PRNGs passed many of the NIST statistical test suits.
Multiple Encryption using ECC and Its Time Complexity AnalysisIJCERT
Rapid growth of information technology in present era, secure communication, strong data encryption technique and trusted third party are considered to be major topics of study. Robust encryption algorithm development to secure sensitive data is of great significance among researchers at present. The conventional methods of encryption used as of today may not sufficient and therefore new ideas for the purpose are to be design, analyze and need to be fit into the existing system of security to provide protection of our data from unauthorized access. An effective encryption/ decryption algorithm design to enhance data security is a challenging task while computation, complexity, robustness etc. are concerned. The multiple encryption technique is a process of applying encryption over a single encryption process in a number of iteration. Elliptic Curve Cryptography (ECC) is well known and well accepted cryptographic algorithm and used in many application as of today. In this paper, we discuss multiple encryptions and analyze the computation overhead in the process and study the feasibility of practical application. In the process we use ECC as a multiple-ECC algorithm and try to analyze degree of security, encryption/decryption computation time and complexity of the algorithm. Performance measure of the algorithm is evaluated by analyzing encryption time as well as decryption time in single ECC as well as multiple-ECC are compared with the help of various examples.
“Proposed Model for Network Security Issues Using Elliptical Curve Cryptography”IOSR Journals
Abstract: Elliptic Curve Cryptography (ECC) plays an important role in today’s public key based security
systems. . ECC is a faster and more secure method of encryption as compared to other Public Key
Cryptographic algorithms. This paper focuses on the performance advantages of using ECC in the wireless
network. So in this paper its algorithm has been implemented and analyzed for various bit length inputs. The
Private key is known only to sender and receiver and hence data transmission is secure.
User Selective Encryption Method for Securing MANETs IJECEIAES
Security issue is getting important day by day. At present, there are a variety of methodologies to provide protection for data confidentiality. MANETs have lots of security challenges than traditional networks like infrastructureless and self-organizing requirements. As t he MANETs are dynamic networks that’s make every transmission in such networks vulnerable to many attacks and improving security level becomes a main issue. This paper introduces a user selective encryption method by operating Data Encryption Standard (DES ), Triple DES (3DES), Advanced Encryption Standard (AES) and the Diffie-Hellman Key Exchange (DHKE) protocol for key management in order to improve MANET security. Through the Network Simulator-2 (NS-2), the we investigat e the performance of the proposed method in terms of data transfer time and network throughput for different data sizes and different sender-to-receiver number of hops. The results show the superiority of AES over other encryption algorithms. Furthermore, the effectiveness of our proposed method is verified through comparing our results with those obtained from previous studies.
Hybrid Cryptography security in public cloud using TwoFish and ECC algorithmIJECEIAES
Cloud computing is a structure for rendering service to the user for free or paid basis through internet facility where we can access to a bulk of shared resources which results in saving managing cost and time for large companies, The data which are stored in the data center may incur various security, damage and threat issues which may result in data leakage, insecure interface and inside attacks. This paper will demonstrate the implementation of hybrid cryptography security in public cloud by a combination of Elliptical Curve Cryptography and Twofish algorithm, which provides an innovative solution to enhance the security features of the cloud so that we can improve the service thus results in increasing the trust over the technology.
SECURE TRANSMISSION OF DATA IN SMART GRID WITH THE AID OF ELLIPTIC CURVE CRYP...IAEME Publication
A smart grid represents a straightforward improvement of a power grid, which effectively hands over electricity from suppliers to clients. It generally uses a two-way digital communication with an eye on managing the devices at client households. They are also competent to conserve energy, scale down overhead costs and to enhance consistency and lucidity. It is home to smart meters, which pave the way for communication with the main central system. As against home energy monitors, smart meters are capable of collecting data for distant reporting. The distribution or receipt of the data is very safely carried out to safeguard the confidentiality of the client power utilization and also to ensure continuous power distribution. Therefore, the cryptography technique is effectively used for increasing the safety and for furnishing the consistent power supply for the uninterrupted power distribution.
06-04-2024 - NYC Tech Week - Discussion on Vector Databases, Unstructured Data and AI
Round table discussion of vector databases, unstructured data, ai, big data, real-time, robots and Milvus.
A lively discussion with NJ Gen AI Meetup Lead, Prasad and Procure.FYI's Co-Found
06-04-2024 - NYC Tech Week - Discussion on Vector Databases, Unstructured Data and AI
Discussion on Vector Databases, Unstructured Data and AI
https://www.meetup.com/unstructured-data-meetup-new-york/
This meetup is for people working in unstructured data. Speakers will come present about related topics such as vector databases, LLMs, and managing data at scale. The intended audience of this group includes roles like machine learning engineers, data scientists, data engineers, software engineers, and PMs.This meetup was formerly Milvus Meetup, and is sponsored by Zilliz maintainers of Milvus.
Explore our comprehensive data analysis project presentation on predicting product ad campaign performance. Learn how data-driven insights can optimize your marketing strategies and enhance campaign effectiveness. Perfect for professionals and students looking to understand the power of data analysis in advertising. for more details visit: https://bostoninstituteofanalytics.org/data-science-and-artificial-intelligence/
Levelwise PageRank with Loop-Based Dead End Handling Strategy : SHORT REPORT ...Subhajit Sahu
Abstract — Levelwise PageRank is an alternative method of PageRank computation which decomposes the input graph into a directed acyclic block-graph of strongly connected components, and processes them in topological order, one level at a time. This enables calculation for ranks in a distributed fashion without per-iteration communication, unlike the standard method where all vertices are processed in each iteration. It however comes with a precondition of the absence of dead ends in the input graph. Here, the native non-distributed performance of Levelwise PageRank was compared against Monolithic PageRank on a CPU as well as a GPU. To ensure a fair comparison, Monolithic PageRank was also performed on a graph where vertices were split by components. Results indicate that Levelwise PageRank is about as fast as Monolithic PageRank on the CPU, but quite a bit slower on the GPU. Slowdown on the GPU is likely caused by a large submission of small workloads, and expected to be non-issue when the computation is performed on massive graphs.
2. Abstract
In this work, we propose an encryption and decryption algorithm in a computer
network, using ideas from graph theory and matrices. We attempt to simulate a
method in which data can be transferred efficiently post-encryption and study how
such an algorithm performs. Random complete graphs consisting of 250 vertices
and 31125 edges were created, with randomly chosen start and end nodes to depict
the initial source and final destination for data transferred. The algorithm harnesses
the idea of a random graph and assigns a multi-dimensional weight to each node.
These weights, along with a randomly generated path are used to build an
encryption matrix that increases the randomness in the encryption, making it a
more robust encryption algorithm. An analysis of the average time taken for which a
16-bit number was encoded, using an M1 2020 Macbook Air was just over 5
milliseconds, relatively fast for a secure algorithm. The algorithm could be improved
by having additional parameters, such as increasing the random path length, the
number of vertices or even using 3 x 3 matrices, resulting in more data to be
encrypted and a more secure system, though this may lead to a trade-off of a
longer run time.
3. ● Matrices are a set of
elements that are
represented as R rows and C
columns to form an R × C
array.
● Matrix multiplication is
known and defined on a
square matrix, where R = C
● Matrix multiplication is non-
commutative; therefore, the
sequence of multiplication
matters. We use this
property of matrices to
generate unique encrypting
matrices for our algorithm
● Cybersecurity is the practice of
safeguarding systems against
vulnerabilities, threats and
attacks
● Cryptography is a foundational
pillar of cybersecurity. It is the
art of securing communication
through the manipulation of
data and is a process that
involves hiding or coding
information so that only the
recipient (whom the message
was intended for) can read it
Graphs and Networks Linear Algebra Cybersecurity
and
Cryptography
● A graph is a set of nodes and edges
connected to each other to represent
relationships between vertices
● Networks are practical applications of
graphs, where the edges and nodes
represent real-world relationships
between systems
4. Literature Review
● Cryptography is crucial in network security. Recent advanced cryptographic
algorithms have enhanced the fields of cloud computing, wireless sensor
networks, and on-chip networks, according to Sarkar, Chatterjee, and
Chakraborty’s paper, “Role of cryptography in network security”.
● To evaluate the behaviors of networks, concepts from graph theory have been
used previously. The importance of techniques like graph sampling and the
characterization of network features such as node centrality, densification, and
diameter in understanding network vulnerabilities and shifts in network behavior
over time have laid the foundations for using graph theory in the field of
cybersecurity, in Namayanja and Janeja’s paper, “Characterization of evolving
networks for cybersecurity”.
● Various key elements in network security and graph theory can be used to design
public key encryption schemes based on matrices generated from a graph or
graphical codes, according to Sen Sarma’s paper “Application of graphs in
security”. Such schemes can be used to understand and prevent attacks.
5. ● In 2016, Namayanja and
Janeja explored the use of
analytics to model and
evaluate computer network
behavior using graph theory
concepts, focusing on
potential cyber threats, in the
paper, ”Characterization of
Evolving Networks for
Cybersecurity”.
● They highlight the
significance of techniques
like graph sampling and
characterization of network
features for understanding
network vulnerabilities.
● The paper, ”Network Security
and Types of Attacks in
Network” tackles security
issues in mobile ad-hoc
networks (MANETs) due to
node independence and
malicious activities.
● Pawar and Anuradha introduce
network security elements like
confidentiality, integrity, and
availability, classify major
attacks like spoofing, and
emphasize securing individual
computers and network
communication channels.
Cryptography
Graph Theory
Networks Network Security
● Sarkar, Chatterjee, and Chakraborty
talked about the,”Role of Cryptography in
Network Security” in 2020, exploring the
role of cryptography in network security,
focusing on encryption and decryption
techniques.
● It categorizes techniques into symmetric-
key, asymmetric-key, and authentication,
and discusses recent advanced
cryptographic algorithms for cloud
computing, wireless sensor networks, and
on-chip networks.
● The publication provides an
understanding of secure network
communication and the importance of
cryptography in maintaining data
confidentiality.
6. ● The research paper, ”A Survey
on Cryptography Algorithms”,
published in 2018, provides a
comparative study of various
cryptography encryption and
decryption algorithms, such as
AES, DES and RSA.
● Abood and Guirguis explore
these systems by analyzing
the benefits and drawbacks of
factors such as security,
effectiveness, and time.
● We find out that symmetric
algorithms are faster than
asymmetric ones, and AES is
the most reliable algorithm in
terms of speed, decoding,
complexity, flexibility, and
more.
● The paper, ”Network Security
and Types of Attacks in
Network” tackles security
issues in mobile ad-hoc
networks (MANETs) due to
node independence and
malicious activities.
● Pawar and Anuradha
introduce network security
elements like confidentiality,
integrity, and availability,
classify major attacks like
spoofing, and emphasize
securing individual computers
and network communication
channels.
Graphs in Security Cryptography Algorithms Network Security
● In the 2019 research paper,
”Application of Graphs in
Security’, Sensarma and Sarma
explore the concepts of
cryptography and graph theory to
design and propose two public key
encryption schemes:
1. Focuses on matrices generated
from a graph
2. Focuses on properties of
graphical codes.
7. ● The paper by Hogan, Johnson,
and Halappanavar, ”Graph
coarsening for pathfinding in
cybersecurity graphs”,
published in 2013 employs
graph coarsening to detect
hackers using “Pass- the-
Hash Attacks” and assess
network risk by repeatedly
contracting edges to identify
high-risk paths.
● The 2017 paper discussing
the ‘Advanced Encryption
Standard Algorithm To
Encrypt and Decrypt Data’,
Abdullah explains the AES
algorithm as a symmetric
block cipher algorithm and
details the algorithm’s
process of transforming data
through a series of rounds.
● Involves applying
substitutions, permutations,
and bitwise operations to
protect sensitive information.
Graph Theory
Encryption Algorithm
Method for Path Finding in
Cybersecurity Graphs
Encryption and
Decryption of Data
● In the paper written in 2014,
”Encryption Algorithm Using
Graph Theory”, Al Eitawi proposes
a new symmetric encryption
algorithm based on graph theory
properties such as cycle graphs
and complete graphs.
● The algorithm is based on the
foundation of data being
represented as vertices, creating a
cycle graph, with weighted edges
according to an encoding table.
After that, it builds a complete
graph, determines the minimum
spanning tree, and carries out
matrix operations for encryption
and decryption.
8. We define the following variables:
V = Total number of vertices,
L = Path length
How do we know that 1.28 × 1019 paths in a network is secure enough? A 9-character ASCII passcode has
1289 possible combinations. According to the Cyber Security Agency of Singapore, a password of this
nature would take approximately 3 years to break into the system. Since our network exceeds the
number of possible combinations in a 9-character password threshold, we know it would take longer
than 3 years, meeting our security criteria.
To check the number of random
paths, we calculate the number of
permutations, considering the order
of selection and without repetition.
This is done by subtracting 2 from the
total vertices and the path length
since the starting and ending nodes
are already randomly assigned, and
we want to calculate the number of
ways to arrange the remaining
vertices along the path.
Number of Random Paths
9. Procedure: Creating
Random Graph
1. Initially, a network is created using
a complete graph of 250 nodes,
and 31125 edges between them.
2. Next, a random path is created
between two randomly chosen
nodes, with a fixed path length of
10 in the graph.
Fig 1. An example graph with 30 nodes and 100 edges
10. Procedure: Product Matrix
1. 250 2 × 2 predefined matrices, A1, A2, A3 … A249, A250 are put into a list. 2 × 2
matrices are chosen due to their enhanced comprehension efficiency through
the organization of data into categories, therefore being computationally less
intensive while providing an optimal level of security.
2. Based on the random path taken, a product matrix is created by choosing N
numbers of Ai from this list where i is 1 ≤ i ≤ 250, where N represents the number
of elements from the list and the number of vertices in the random path.
3. For each i that represents a node in the random path, starting from the first
node to the Nth node, we multiply the Ai in sequence to obtain the product
matrix. Together, the matrices multiplied to obtain the product matrix are
represented as the sub-keys to the encryption key.
11. Procedure: Encryption and Decryption
1. The user defines a input data to be a 2x2 matrix.
2. To encrypt this data, we multiply the product matrix and the input data. This
encrypted 2x2 matrix is obfuscated and original data cannot be obtained
without the decryption key.
3. The decryption algorithm takes place by multiplying the inverse of the product
matrix by the encrypted data to get back the original input data.
4. To verify that the algorithm works, we subtracted the decrypted data from the
original input data to see if the resulting matrix is a zero matrix. If this works,
the algorithm is a success.
13. Results (Sample Output 1)
● In this sample case, the input data matrix was [-4 5] [6 5].
● A path was randomly generated, with the start and end nodes being
14 and 83 respectively. In the path, the 14th, 47th, 94th, 36th, 25th, 15th
and 83rd vertices were chosen, therefore the corresponding
predefined matrices were multiplied together in that order.
● This final product matrix is multiplied with the input data, to obtain
the encrypted data. Finally, we multiply the inverse of the final
product matrix by encrypted data to return the decrypted data.
14. Results (Case of Final Product Matrix = 0)
● In this output, the inputted data was also kept as [-4 5] [6 5].
● A path was randomly generated, with the start and end nodes being 44 and
18 respectively. In the path, the 44th, 61st, 12th, 51st, 3rd, 69th and 18th vertices
were chosen, therefore the corresponding predefined matrices were
multiplied together in that order.
● Since the determinant of the product matrix, add a randomly predefined
matrix (in this case [1 6] [4 5]).
● This final product matrix is multiplied with the original data, to obtain the
encrypted data. Finally, we multiplying the inverse of the final product matrix
by encrypted data to return the decrypted data.
15. Data Analysis: Performance
An analysis of the average time
taken for the encryption and
decryption algorithm to execute for I
iterations was carried out by
repeating the 50 iteration cycle 10
times, in order to obtain a more
precise result.
The mean time taken is
approximately 5.43 milliseconds,
which is relatively fast for a secure
encryption and decryption
algorithm. In these trials, a 16 bit
number was encoded, using an M1
2020 Macbook Air.
16. Data Analysis:
Error and Special Cases
If during the process of obtaining the product matrix, the product of two of the predefined
matrices results in a zero matrix, then the final product matrix would be a zero matrix itself,
meaning that the encrypted data would also be a zero matrix. For such a matrix, the
inverse would not exist as it’s determinant is 0 and so, the encrypted data cannot be
decrypted.Therefore, if the product matrix is a 0 matrix, we add a random predefined 2x2
matrix to the product matrix, so that it can encrypt and decrypt. If one of the predefined
matrices is a zero matrix and the multiplication of matrices in the random path end up as
zero matrix, the random matrix chosen for addition excludes the zero matrix from the set of
total predefined matrices, so that the zero matrix is not added.
17. Summary and Conclusion
● In this paper, we explored the idea of using random graphs to create an effective
encryption and decryption algorithm, addressing all possible input scenarios.
● The model leverages linear algebra concepts, specifically matrices, to represent
data, bridging theoretical concepts and practical applications in encryption and
decryption.
● The success of the algorithm is proved by an efficient execution time, of just over 5
milliseconds.
● As technology advances and becomes more widely and rapidly utilized, the number
of security and data breaches has been increasing year upon year, hence the
increasing importance of cybersecurity.
● Therefore, an algorithm of this nature enhances data security and serves as a
foundation for advancement in newer encryption algorithms in the future.
18. Summary and Conclusion:
Improvements
● The model could be improved by including additional graph theory parameters such
as the following;
○ increasing the random path length
○ increasing the total number of vertices in the network, resulting in a more
secure system, though this may lead to a trade-off of a longer run time.
● Using 3 x 3 matrices would allow for more data to be encrypted in each run of the
algorithm.
● Exploring whether such an algorithm can have successful implementation of
securely encrypting big data.
19. References
G Yee. Optimal security protection for sensitive data. International Journal on Advances in Security, 11(1&2):80–90, 2018.
R.A. Kemmerer. Cybersecurity. In 25th International Conference on Software Engineering, 2003. Proceedings., pages 705–715, 2003.
VV Iashchenko. Cryptography: An Introduction: An Introduction. Number 18. American Mathematical Soc., 2002.
Chengdong Tao, Adama Diene, Shaohua Tang, and Jintai Ding. Simple matrix scheme for encryption. In Post-Quantum Cryptography:
5th International Workshop, PQCrypto 2013, Limoges, France, June 4-7, 2013. Proceedings 5, pages 231–242. Springer, 2013.
Network topology matrices. https://www.tutorialspoint.com/network theory/networktheorytopology matrices.htm.
Remco Van Der Hofstad. Random graphs and complex networks. Available on http://www. win. tue. nl/rhofstad/NotesRGCN. pdf, 11:60, 2009.
Georgi E Shilov. Linear algebra. Courier Corporation, 2012.
Omar G Abood and Shawkat K Guirguis. A survey on cryptography algorithms. International Journal of Scientific and Research Publications,
8(7):495–516, 2018.
Anindita Sarkar, Swagata Roy Chatterjee, and Mohuya Chakraborty. Role of cryptography in network security. The” Essence” of Network Security:
An End-to-End Panorama, pages 103–143, 2021.
Josephine M Namayanja and Vandana P Janeja. Characterization of evolving networks for cybersecurity. Information Fusion for CyberSecurity Analytics,
pages 111–127, 2017.
Mohan V Pawar and J Anuradha. Network security and types of attacks in network. Procedia Computer Science, 48:503–506, 2015.
Debajit Sensarma and Samar Sen Sarma. Application of graphs in security. International Journal of Innovative Technology and Exploring Engineering,
8(10):2273–2279, 2019.
Emilie Hogan, John R Johnson, and Mahantesh Halappanavar. Graph coarsening for path finding in cybersecurity graphs. In Proceedings of the Eighth
Annual Cyber Security and Information Intelligence Research Workshop, pages 1–4, 2013.
Ako Muhamad Abdullah et al. Advanced encryption standard (aes) algorithm to encrypt and decrypt data. Cryptography and Network Security,
16(1):11, 2017.
Wael Mahmoud Al Etaiwi. Encryption algorithm using graph theory. Journal of scientific research and reports, 3(19):2519–2527, 2014.
P Amudha, AC Charles Sagayaraj, and AC Shantha Sheela. An application of graph theory in cryptography. International Journal of Pure and Applied
Mathematics, 119(13):375–383, 2018.
Password checker. https://www.csa.gov.sg/Tips-Resource/Interactive-Tools/Password-Checker.
Alexander Craig Aitken. Determinants and matrices. Read Books Ltd, 2017.
Naveen Kumar. Today’s importance of cybersecurity. PhD thesis, Utica College, 2014.