This document proposes a lightweight cryptography solution for secure communication in mobile ad hoc networks (MANETs). It describes creating a distributed public key infrastructure (PKI) using Shamir's secret sharing to decentralize the certificate authority role among MANET nodes. Each node holds a share of the private key. It then proposes using Tiny Encryption Algorithm (TEA), an efficient symmetric-key cipher, along with elliptic curve Diffie-Hellman key exchange to establish secure communication between nodes with limited resources. The system initializes by having founding MANET nodes act as dealers to distribute secret shares. Nodes then use Diffie-Hellman to independently derive a secret key to encrypt communications.
Pairing Based Elliptic Curve Cryptosystem for Message AuthenticationIJTET Journal
This document summarizes a research paper on using elliptic curve cryptography for message authentication. It begins with an introduction to elliptic curve cryptography and how it can provide equivalent security to other public key encryption methods but with smaller key sizes. It then describes the proposed methodology which includes generating an ECC key pair, encrypting a message with the public key, transmitting the encrypted message, and decrypting it with the private key. The results show a message being encrypted and decrypted correctly using this ECC process. It concludes that ECC can provide an efficient method for authentication in systems like vehicular networks due to its lower computation and communication overhead compared to other encryption methods.
This document discusses the implementation of a new steganography technique called BPCS-Steganography. Steganography hides secret data within other carrier data without leaving any visible evidence of alteration. Traditional techniques have limited capacity of less than 10% of the carrier size. The new technique embeds secrets in the bit-planes of an image carrier. It takes advantage of human inability to perceive shapes in complex binary patterns to replace "noise-like" bit-plane regions with secret data without affecting image quality. This allows hiding secret data up to 50% of the original image size. The document also discusses technologies, security considerations using RSA encryption, and a system study of the proposed technique versus existing work.
This document discusses using threshold cryptography and maximum distance separable (MDS) codes for key management in mobile ad hoc networks (MANETs). It begins with an introduction to MANETs and the need for distributed key management approaches. It then provides background on threshold cryptography and MDS codes. The document proposes using threshold cryptography combined with MDS codes to create a distributed cooperative key management system for MANETs that generates and distributes encryption keys among network nodes in a secure and fault-tolerant manner.
“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.
The document proposes a novel secure scheme for computing the cosine similarity between two integer vectors with malicious adversaries. The scheme uses distributed ElGamal encryption and zero-knowledge proofs to privately compute the cosine coefficient between two parties' vector inputs while preserving privacy. Security analysis shows the scheme can resist attacks from malicious adversaries by simulating the ideal functionality using the encryption scheme and zero-knowledge proofs.
A NOVEL SECURE COSINE SIMILARITY COMPUTATION SCHEME WITH MALICIOUS ADVERSARIESIJNSA Journal
Similarity coefficients play an important role in many aspects. Recently, several schemes were proposed, but these schemes aimed to compute the similarity coefficients of binary data. In this paper, a novel scheme
which can compute the coefficients of integer is proposed. To the best knowledge of us, this is the first scheme which canesist malicious adversaries attack.
This document describes a proposed approach called UDRPG for dynamic key management and node authentication in mobile ad hoc networks (MANETs). UDRPG uses four random processes to generate unique and dynamic random passwords for each node in the network. It allows each node to submit a unique random key during communication. The approach distributes the task of a trusted dynamic key generator among all participating nodes, addressing issues with prior centralized approaches. It generates public/private key pairs for nodes and encrypts messages using the public keys during communication between nodes. The simulation results show UDRPG can provide better security than existing approaches for MANETs.
The document describes a modified AES key expansion algorithm for image encryption and decryption. It discusses basics of cryptography and image encryption. It introduces AES and describes the standard AES key expansion process. It then presents a modified AES key expansion algorithm tailored for images where the keys are expanded based on image pixel count, Rcon values are derived from the initial key, and the S-box is shifted based on the initial key. It analyzes the proposed algorithm and shows it offers high encryption quality with minimal time compared to previous techniques.
Pairing Based Elliptic Curve Cryptosystem for Message AuthenticationIJTET Journal
This document summarizes a research paper on using elliptic curve cryptography for message authentication. It begins with an introduction to elliptic curve cryptography and how it can provide equivalent security to other public key encryption methods but with smaller key sizes. It then describes the proposed methodology which includes generating an ECC key pair, encrypting a message with the public key, transmitting the encrypted message, and decrypting it with the private key. The results show a message being encrypted and decrypted correctly using this ECC process. It concludes that ECC can provide an efficient method for authentication in systems like vehicular networks due to its lower computation and communication overhead compared to other encryption methods.
This document discusses the implementation of a new steganography technique called BPCS-Steganography. Steganography hides secret data within other carrier data without leaving any visible evidence of alteration. Traditional techniques have limited capacity of less than 10% of the carrier size. The new technique embeds secrets in the bit-planes of an image carrier. It takes advantage of human inability to perceive shapes in complex binary patterns to replace "noise-like" bit-plane regions with secret data without affecting image quality. This allows hiding secret data up to 50% of the original image size. The document also discusses technologies, security considerations using RSA encryption, and a system study of the proposed technique versus existing work.
This document discusses using threshold cryptography and maximum distance separable (MDS) codes for key management in mobile ad hoc networks (MANETs). It begins with an introduction to MANETs and the need for distributed key management approaches. It then provides background on threshold cryptography and MDS codes. The document proposes using threshold cryptography combined with MDS codes to create a distributed cooperative key management system for MANETs that generates and distributes encryption keys among network nodes in a secure and fault-tolerant manner.
“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.
The document proposes a novel secure scheme for computing the cosine similarity between two integer vectors with malicious adversaries. The scheme uses distributed ElGamal encryption and zero-knowledge proofs to privately compute the cosine coefficient between two parties' vector inputs while preserving privacy. Security analysis shows the scheme can resist attacks from malicious adversaries by simulating the ideal functionality using the encryption scheme and zero-knowledge proofs.
A NOVEL SECURE COSINE SIMILARITY COMPUTATION SCHEME WITH MALICIOUS ADVERSARIESIJNSA Journal
Similarity coefficients play an important role in many aspects. Recently, several schemes were proposed, but these schemes aimed to compute the similarity coefficients of binary data. In this paper, a novel scheme
which can compute the coefficients of integer is proposed. To the best knowledge of us, this is the first scheme which canesist malicious adversaries attack.
This document describes a proposed approach called UDRPG for dynamic key management and node authentication in mobile ad hoc networks (MANETs). UDRPG uses four random processes to generate unique and dynamic random passwords for each node in the network. It allows each node to submit a unique random key during communication. The approach distributes the task of a trusted dynamic key generator among all participating nodes, addressing issues with prior centralized approaches. It generates public/private key pairs for nodes and encrypts messages using the public keys during communication between nodes. The simulation results show UDRPG can provide better security than existing approaches for MANETs.
The document describes a modified AES key expansion algorithm for image encryption and decryption. It discusses basics of cryptography and image encryption. It introduces AES and describes the standard AES key expansion process. It then presents a modified AES key expansion algorithm tailored for images where the keys are expanded based on image pixel count, Rcon values are derived from the initial key, and the S-box is shifted based on the initial key. It analyzes the proposed algorithm and shows it offers high encryption quality with minimal time compared to previous techniques.
NeuroCrypto: C++ Implementation of Neural Cryptography with Rijndael CipherSagun Man Singh Shrestha
This work is the software implementation of the concept of neural cryptography, which is a communication of two tree parity machines for agreement on a common key over a public channel. This key is utilized to encrypt a sensitive message to be transmitted over an insecure channel using Rijndael cipher. This is a new potential source for public key cryptography schemes which are not based on number theoretic functions, and have small time and memory complexities. This paper will give a brief introduction to artificial neural networks, cryptography and its types, which will help explain why the two communicating terminals converge to a common key in neural cryptography and will also cover the Rijndael (AES) cipher. This paper is intended to show that such neural key exchange protocol and AES encryption can be practically implemented in a high-level programming language viz. C++, which could be further extended in higher-level applications. Both CLI and GUI implementations of the software created using Visual C++ (.NET framework) are presented.
This document summarizes a lecture on public-key cryptography and the RSA algorithm. It begins by introducing public-key cryptography and how it can provide both confidentiality and authentication simultaneously. It then describes the basic idea behind the RSA algorithm, which uses modular exponentiation and the fact that exponents behave modulo the totient of a number when the number is a product of two primes. The document provides details on how to implement RSA, including choosing the modulus as a product of two large prime numbers, and proves that the RSA algorithm works as intended. It also discusses computational and security aspects of RSA.
A New Security Level for Elliptic Curve Cryptosystem Using Cellular Automata ...Editor IJCATR
Elliptic curve cryptography (ECC) is an effective approach to protect privacy and security of information. Encryption
provides only one level of security during transmission over the channel. Hence there is a need for a stronger encryption which is very
hard to break. So, to achieve better results and improve security, information has to pass through several levels of encryption. The aim
of this paper would be to provide two levels of security. First level comprises of plaintext using as security key compressed block to
encrypt text based ECC technique and the second level comprises of scrambling method with compression using 2D Cellular rules. In
particular, we propose an efficient encryption algorithm based ECC using Cellular automata and it is termed as Elliptic Curve
Cryptosystem based Cellular Automata (ECCCA). This paper presents the implementation of ECCCA for communication over
insecure channel. The results are provided to show the encryption performance of the proposed method.
Implementation Secure Authentication Using Elliptic Curve CryptographyAM Publications
Elliptic curve cryptography is the most efficient public key encryption scheme based on the elliptic curve concepts that
can be used to create faster, smaller, and efficient cryptographic keys. As a use of network increase for critical transaction, so
huge damages are caused by intrusion attacks hence there is the need of computer network security. To protect network against
various active and passive attack, various technique have been suggested. Mobile devices have many differences in their
capabilities, computational powers and security requirements. The security of mobile communication has stopped the list of
concerns for mobile phone users. Confidentiality, Authentication, Integrity and Non-repudiation are required security services for mobile communication.
Application of bpcs steganography to wavelet compressed video (synopsis)Mumbai Academisc
This document discusses applying BPCS steganography techniques to embed secret information in wavelet compressed video. It begins with an abstract describing BPCS steganography, which embeds secret data in the bit-planes of an image without deteriorating image quality. It then provides an introduction to steganography and its applications for secure internet communication. The document discusses the design of the steganography technique, including its high embedding capacity of up to 50% of the original image size without increasing file size. It also covers security considerations like the RSA encryption algorithm.
Image Encryption Using Advanced Hill Cipher AlgorithmIDES Editor
The Hill cipher algorithm is one of the symmetric
key algorithms that have several advantages in data
encryption. But, the inverse of the key matrix used for
encrypting the plaintext does not always exist. Then if the
key matrix is not invertible, then encrypted text cannot be
decrypted. In the Involutory matrix generation method the
key matrix used for the encryption is itself invertible. So, at
the time of decryption we need not to find the inverse of the
key matrix. The objective of this paper is to encrypt an
image using a technique different from the conventional Hill
Cipher. In this paper a novel advanced Hill (AdvHill)
encryption technique has been proposed which uses an
involutory key matrix. The scheme is a fast encryption
scheme which overcomes problems of encrypting the images
with homogeneous background. A comparative study of the
proposed encryption scheme and the existing scheme is
made. The output encrypted images reveal that the
proposed technique is quite reliable and robust.
Image encryption using elliptical curve cryptosytem with hill cipherkarthik kedarisetti
IMAGE ENCRYPTION-BTECH FINAL YEAR PROJECT ZEROTH REVIEW.
Image encryption is rapidly increased recently by the increasing use of the internet and communication
media. Sharing important images over unsecured channels is liable for attacking and stealing. Encryption
techniques are the suitable methods to protect images from attacks. Hill cipher algorithm is one of the
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 channels. A new image
encryption technique that combines Elliptic Curve Cryptosystem with Hill Cipher (ECCHC) has been proposed
in this paper to convert Hill cipher from symmetric technique to asymmetric one and increase its
security and efficiency and resist the hackers. Self-invertible key matrix is used to generate encryption
and decryption secret key. So, no need to find the inverse key matrix in the decryption process. A secret
key matrix with dimensions 4 4 will be used as an example in this study. Entropy, Peak Signal to Noise
Ratio (PSNR), and Unified Average Changing Intensity (UACI) will be used to assess the grayscale image
encryption efficiency and compare the encrypted image with the original image to evaluate the performance
of the proposed encryption technique.
Information security is one of the most important issues in the
recent times. Elliptic Curve Cryptography (ECC) is one of the most
efficient public key cryptosystems that is secured against adversaries
because it is hard for them to find the secret key and solve
the elliptic curve discrete logarithm problem. Its strengthened
security also comes from the small key size that is used in it with
the same level of safety compared to the other cryptosystems like RSA(Rivest–Shamir–Adleman))
IRJET- Secure Data on Multi-Cloud using Homomorphic EncryptionIRJET Journal
This document discusses secure data storage on multi-cloud systems using homomorphic encryption. It begins by introducing homomorphic encryption and its uses for secure computation on encrypted data. It then describes different types of homomorphic encryption schemes, including partially homomorphic (e.g. RSA, Paillier) and fully homomorphic encryption. The document proposes a multi-cloud architecture using several distributed servers to partition and store encrypted data in a way that aims to achieve the capabilities of fully homomorphic encryption.
Presentation on Cryptography_Based on IEEE_PaperNithin Cv
The document summarizes a seminar report on a hybrid cryptography architecture that uses multiple cryptographic algorithms. It discusses Elliptic Curve Cryptography (ECC), Elliptic Curve Diffie-Hellman (ECDH), Elliptic Curve Digital Signature Algorithm (ECDSA), and Dual-RSA. ECC is used to encrypt data onto an elliptic curve. ECDH generates shared secret keys between two parties for use in symmetric encryption. ECDSA allows digital signatures using elliptic curve parameters. Dual-RSA improves decryption efficiency using the Chinese Remainder Theorem to split computations between prime factors p and q. The hybrid architecture combines the strengths of these algorithms to provide secure encryption, authentication, and key exchange.
WEAKNESS ON CRYPTOGRAPHIC SCHEMES BASED ON REGULAR LDPC CODESIJNSA Journal
We propose a method to recover the structure of a randomly permuted chained code and how to cryptanalyse cryptographic schemes based on these kinds of error coding. As application of these methods is a cryptographic schema using regular Low Density Parity Check (LDPC) Codes. This result prohibits the use of chained code and particularly regular LDPC codes on cryptography
Color Image Encryption and Decryption Using Multiple Chaotic MapsIJTET Journal
Owing to advances in communication technology, a bulk of visual digital data is being stored and transmitted over the internet now-a-days. Particularly millions and millions of images transfer through the network per day as per the statistics and a result, the security of image data is an important requirement. Image encryption algorithm is used to provide this security. In this paper, an image encryption algorithm based on confusion diffusion architecture that uses dynamic key space is proposed. An internal key generator is used to generate the initial seeds for the overall encryption scheme is proposed. With these initial seeds logistic map generates pseudo random numbers then these numbers are converted into permutation order for permutation. The diffusion bits are generated in parallel using the logistic map and manipulated with pixels confused. The image pixels are iteratively confused and diffused using permutation order and diffusion bits respectively to produce cipher image in minimum number of rounds. This paper proposes a new kind of initial seed generation that utilizes the combo of logistic and tent maps. Even all external seeds are same. The internal seeds will be totally different. This ensures the key sensitivity. The simulation results and analysis confirm that the satisfactory level of security is achieved in three rounds and overall encryption time is saved.
Secrecy and Performance Analysis of Symmetric Key Encryption AlgorithmsTharindu Weerasinghe
The document analyzes the secrecy and performance of symmetric key encryption algorithms including block ciphers (DES, TripleDES, AES), stream ciphers (RC2, RC4) and hybrid algorithms combining block and stream ciphers (TripleDES+RC4, AES+RC4). The analysis is conducted based on two measurement criteria (secrecy of ciphers and encryption time) under two circumstances (variable input plaintext size and variable input plaintext length representing passwords). Results are presented in a table showing average secrecy values for each algorithm over varying input data sizes. The tool created allows users to select an algorithm and see corresponding performance and secrecy results.
This document discusses public key cryptography and the RSA encryption algorithm. It provides an overview of public key cryptography, how the RSA algorithm works using a public and private key pair, and some of its applications. The RSA algorithm is based on the difficulty of factoring large prime numbers and allows for secure communication without needing to share secret keys. Some advantages are convenience and enabling message authentication and non-repudiation using digital signatures, while disadvantages include slower performance and the need to authenticate public keys.
Cryptography using artificial neural networkMahira Banu
This document proposes using artificial neural networks for cryptography. It describes using a backpropagation neural network for decryption, where the network is trained on encrypted-decrypted message pairs. Boolean algebra is used for encryption, permuting messages and "doping" with additional bits. The neural network can then be used as a public key for decryption, with a private key for encryption. Simulation results showed the neural network approach weakened key guessing compared to other methods.
A comparative analysis of the possible attacks on rsa cryptosystemIAEME Publication
The document summarizes various attacks on the RSA cryptosystem. It discusses two main categories of attacks: 1) Mathematical attacks that exploit weaknesses in the mathematical structure of RSA, such as factoring the modulus or using a small private key. 2) Implementation attacks that take advantage of flaws in how RSA is implemented, like timing attacks. It then proposes a new attack algorithm that claims to be able to recover the private exponent d and factor the modulus n given only the public key (e,n), potentially breaking RSA without factoring.
On the Usage of Chained Codes in CryptographyCSCJournals
This document summarizes a research paper on using randomized chained linear codes for digital signatures. The summary is:
1) Randomized chained linear codes are proposed to address attacks on previous signature schemes that used regular chained codes. Random vectors are concatenated to the generator matrix of a chained code to create randomized chained codes.
2) A digital signature scheme is presented that uses randomized chained codes. The private key consists of the generator matrix and randomization matrices. The public key is the randomized parity check matrix. Signatures are created using the chain code decoding algorithm.
3) Security analysis shows the scheme is secure if the code length is over 1350 bits, preventing an attacker from determining the private key from the public information
Introduction to Public key Cryptosystems with block diagrams
Reference : Cryptography and Network Security Principles and Practice , Sixth Edition , William Stalling
A Novel Key Distribution Scheme f or a Visual Crypto SystemIRJET Journal
This document proposes a novel key distribution scheme for visual cryptography. It begins with an introduction to cryptography and visual cryptography. It then describes the existing Diffie-Hellman key exchange algorithm. The proposed method generates a shared secret key through a multi-step process using asymmetric key cryptography and modulus operation on private keys and a public image. Both parties are able to derive the same symmetric key for encrypting future communications without directly transmitting their private keys. The methodology and implementation details are provided, along with experimental results demonstrating the generation of matching keys within 0.11 seconds on average.
DATA SECURITY ANALYSIS AND SECURITY EXTENSION FOR SMART CARDS USING JAVA CARDijait
This document discusses and compares two public key cryptosystems - RSA and Elliptic Curve Cryptography (ECC) - for use in smart cards. It finds that ECC provides equivalent security to RSA but with significantly smaller key sizes, making it more efficient and suitable for smart cards with limited storage and processing capabilities. The document outlines the principles, key generation algorithms, and encryption/signature schemes for both RSA and ECC, including specific algorithms like Menezes-Vanstone and Nyberg-Rueppel. It analyzes the security level, efficiency, and space requirements of RSA and ECC, finding that ECC requires keys 10 times smaller than RSA for the same security level and its operations are an order of magnitude faster.
Secure Data Storage on Cloud System for Privacy PreservingIRJET Journal
The document describes a proposed system for secure data storage on cloud systems using elliptic curve cryptography and Shamir's secret sharing algorithm. It discusses how ECC and secret sharing can be used to encrypt data before storing it on the cloud to preserve privacy. The system aims to provide security services like confidentiality. It generates keys using ECC and secret sharing that are shared with authenticated users to allow access to encrypted data stored on the cloud. The system reduces storage and computational overhead for the customer and cloud storage server.
The document proposes an efficient generalized signcryption scheme based on elliptic curve cryptography (ECC) that avoids computationally heavy bilinear pairing operations. It first identifies security issues in a previous tripartite signcryption scheme and proposes corrections. The corrected scheme is extended to support multiple receivers. It then further extends this signcryption scheme to a generalized signcryption scheme that provides either confidentiality, authentication, or a combination of both for messages with multiple receivers. The proposed schemes use only ECC operations and satisfy security properties like forward secrecy and public verification more efficiently than other existing schemes. An application of the generalized signcryption scheme for key management in wireless sensor networks is also discussed.
NeuroCrypto: C++ Implementation of Neural Cryptography with Rijndael CipherSagun Man Singh Shrestha
This work is the software implementation of the concept of neural cryptography, which is a communication of two tree parity machines for agreement on a common key over a public channel. This key is utilized to encrypt a sensitive message to be transmitted over an insecure channel using Rijndael cipher. This is a new potential source for public key cryptography schemes which are not based on number theoretic functions, and have small time and memory complexities. This paper will give a brief introduction to artificial neural networks, cryptography and its types, which will help explain why the two communicating terminals converge to a common key in neural cryptography and will also cover the Rijndael (AES) cipher. This paper is intended to show that such neural key exchange protocol and AES encryption can be practically implemented in a high-level programming language viz. C++, which could be further extended in higher-level applications. Both CLI and GUI implementations of the software created using Visual C++ (.NET framework) are presented.
This document summarizes a lecture on public-key cryptography and the RSA algorithm. It begins by introducing public-key cryptography and how it can provide both confidentiality and authentication simultaneously. It then describes the basic idea behind the RSA algorithm, which uses modular exponentiation and the fact that exponents behave modulo the totient of a number when the number is a product of two primes. The document provides details on how to implement RSA, including choosing the modulus as a product of two large prime numbers, and proves that the RSA algorithm works as intended. It also discusses computational and security aspects of RSA.
A New Security Level for Elliptic Curve Cryptosystem Using Cellular Automata ...Editor IJCATR
Elliptic curve cryptography (ECC) is an effective approach to protect privacy and security of information. Encryption
provides only one level of security during transmission over the channel. Hence there is a need for a stronger encryption which is very
hard to break. So, to achieve better results and improve security, information has to pass through several levels of encryption. The aim
of this paper would be to provide two levels of security. First level comprises of plaintext using as security key compressed block to
encrypt text based ECC technique and the second level comprises of scrambling method with compression using 2D Cellular rules. In
particular, we propose an efficient encryption algorithm based ECC using Cellular automata and it is termed as Elliptic Curve
Cryptosystem based Cellular Automata (ECCCA). This paper presents the implementation of ECCCA for communication over
insecure channel. The results are provided to show the encryption performance of the proposed method.
Implementation Secure Authentication Using Elliptic Curve CryptographyAM Publications
Elliptic curve cryptography is the most efficient public key encryption scheme based on the elliptic curve concepts that
can be used to create faster, smaller, and efficient cryptographic keys. As a use of network increase for critical transaction, so
huge damages are caused by intrusion attacks hence there is the need of computer network security. To protect network against
various active and passive attack, various technique have been suggested. Mobile devices have many differences in their
capabilities, computational powers and security requirements. The security of mobile communication has stopped the list of
concerns for mobile phone users. Confidentiality, Authentication, Integrity and Non-repudiation are required security services for mobile communication.
Application of bpcs steganography to wavelet compressed video (synopsis)Mumbai Academisc
This document discusses applying BPCS steganography techniques to embed secret information in wavelet compressed video. It begins with an abstract describing BPCS steganography, which embeds secret data in the bit-planes of an image without deteriorating image quality. It then provides an introduction to steganography and its applications for secure internet communication. The document discusses the design of the steganography technique, including its high embedding capacity of up to 50% of the original image size without increasing file size. It also covers security considerations like the RSA encryption algorithm.
Image Encryption Using Advanced Hill Cipher AlgorithmIDES Editor
The Hill cipher algorithm is one of the symmetric
key algorithms that have several advantages in data
encryption. But, the inverse of the key matrix used for
encrypting the plaintext does not always exist. Then if the
key matrix is not invertible, then encrypted text cannot be
decrypted. In the Involutory matrix generation method the
key matrix used for the encryption is itself invertible. So, at
the time of decryption we need not to find the inverse of the
key matrix. The objective of this paper is to encrypt an
image using a technique different from the conventional Hill
Cipher. In this paper a novel advanced Hill (AdvHill)
encryption technique has been proposed which uses an
involutory key matrix. The scheme is a fast encryption
scheme which overcomes problems of encrypting the images
with homogeneous background. A comparative study of the
proposed encryption scheme and the existing scheme is
made. The output encrypted images reveal that the
proposed technique is quite reliable and robust.
Image encryption using elliptical curve cryptosytem with hill cipherkarthik kedarisetti
IMAGE ENCRYPTION-BTECH FINAL YEAR PROJECT ZEROTH REVIEW.
Image encryption is rapidly increased recently by the increasing use of the internet and communication
media. Sharing important images over unsecured channels is liable for attacking and stealing. Encryption
techniques are the suitable methods to protect images from attacks. Hill cipher algorithm is one of the
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 channels. A new image
encryption technique that combines Elliptic Curve Cryptosystem with Hill Cipher (ECCHC) has been proposed
in this paper to convert Hill cipher from symmetric technique to asymmetric one and increase its
security and efficiency and resist the hackers. Self-invertible key matrix is used to generate encryption
and decryption secret key. So, no need to find the inverse key matrix in the decryption process. A secret
key matrix with dimensions 4 4 will be used as an example in this study. Entropy, Peak Signal to Noise
Ratio (PSNR), and Unified Average Changing Intensity (UACI) will be used to assess the grayscale image
encryption efficiency and compare the encrypted image with the original image to evaluate the performance
of the proposed encryption technique.
Information security is one of the most important issues in the
recent times. Elliptic Curve Cryptography (ECC) is one of the most
efficient public key cryptosystems that is secured against adversaries
because it is hard for them to find the secret key and solve
the elliptic curve discrete logarithm problem. Its strengthened
security also comes from the small key size that is used in it with
the same level of safety compared to the other cryptosystems like RSA(Rivest–Shamir–Adleman))
IRJET- Secure Data on Multi-Cloud using Homomorphic EncryptionIRJET Journal
This document discusses secure data storage on multi-cloud systems using homomorphic encryption. It begins by introducing homomorphic encryption and its uses for secure computation on encrypted data. It then describes different types of homomorphic encryption schemes, including partially homomorphic (e.g. RSA, Paillier) and fully homomorphic encryption. The document proposes a multi-cloud architecture using several distributed servers to partition and store encrypted data in a way that aims to achieve the capabilities of fully homomorphic encryption.
Presentation on Cryptography_Based on IEEE_PaperNithin Cv
The document summarizes a seminar report on a hybrid cryptography architecture that uses multiple cryptographic algorithms. It discusses Elliptic Curve Cryptography (ECC), Elliptic Curve Diffie-Hellman (ECDH), Elliptic Curve Digital Signature Algorithm (ECDSA), and Dual-RSA. ECC is used to encrypt data onto an elliptic curve. ECDH generates shared secret keys between two parties for use in symmetric encryption. ECDSA allows digital signatures using elliptic curve parameters. Dual-RSA improves decryption efficiency using the Chinese Remainder Theorem to split computations between prime factors p and q. The hybrid architecture combines the strengths of these algorithms to provide secure encryption, authentication, and key exchange.
WEAKNESS ON CRYPTOGRAPHIC SCHEMES BASED ON REGULAR LDPC CODESIJNSA Journal
We propose a method to recover the structure of a randomly permuted chained code and how to cryptanalyse cryptographic schemes based on these kinds of error coding. As application of these methods is a cryptographic schema using regular Low Density Parity Check (LDPC) Codes. This result prohibits the use of chained code and particularly regular LDPC codes on cryptography
Color Image Encryption and Decryption Using Multiple Chaotic MapsIJTET Journal
Owing to advances in communication technology, a bulk of visual digital data is being stored and transmitted over the internet now-a-days. Particularly millions and millions of images transfer through the network per day as per the statistics and a result, the security of image data is an important requirement. Image encryption algorithm is used to provide this security. In this paper, an image encryption algorithm based on confusion diffusion architecture that uses dynamic key space is proposed. An internal key generator is used to generate the initial seeds for the overall encryption scheme is proposed. With these initial seeds logistic map generates pseudo random numbers then these numbers are converted into permutation order for permutation. The diffusion bits are generated in parallel using the logistic map and manipulated with pixels confused. The image pixels are iteratively confused and diffused using permutation order and diffusion bits respectively to produce cipher image in minimum number of rounds. This paper proposes a new kind of initial seed generation that utilizes the combo of logistic and tent maps. Even all external seeds are same. The internal seeds will be totally different. This ensures the key sensitivity. The simulation results and analysis confirm that the satisfactory level of security is achieved in three rounds and overall encryption time is saved.
Secrecy and Performance Analysis of Symmetric Key Encryption AlgorithmsTharindu Weerasinghe
The document analyzes the secrecy and performance of symmetric key encryption algorithms including block ciphers (DES, TripleDES, AES), stream ciphers (RC2, RC4) and hybrid algorithms combining block and stream ciphers (TripleDES+RC4, AES+RC4). The analysis is conducted based on two measurement criteria (secrecy of ciphers and encryption time) under two circumstances (variable input plaintext size and variable input plaintext length representing passwords). Results are presented in a table showing average secrecy values for each algorithm over varying input data sizes. The tool created allows users to select an algorithm and see corresponding performance and secrecy results.
This document discusses public key cryptography and the RSA encryption algorithm. It provides an overview of public key cryptography, how the RSA algorithm works using a public and private key pair, and some of its applications. The RSA algorithm is based on the difficulty of factoring large prime numbers and allows for secure communication without needing to share secret keys. Some advantages are convenience and enabling message authentication and non-repudiation using digital signatures, while disadvantages include slower performance and the need to authenticate public keys.
Cryptography using artificial neural networkMahira Banu
This document proposes using artificial neural networks for cryptography. It describes using a backpropagation neural network for decryption, where the network is trained on encrypted-decrypted message pairs. Boolean algebra is used for encryption, permuting messages and "doping" with additional bits. The neural network can then be used as a public key for decryption, with a private key for encryption. Simulation results showed the neural network approach weakened key guessing compared to other methods.
A comparative analysis of the possible attacks on rsa cryptosystemIAEME Publication
The document summarizes various attacks on the RSA cryptosystem. It discusses two main categories of attacks: 1) Mathematical attacks that exploit weaknesses in the mathematical structure of RSA, such as factoring the modulus or using a small private key. 2) Implementation attacks that take advantage of flaws in how RSA is implemented, like timing attacks. It then proposes a new attack algorithm that claims to be able to recover the private exponent d and factor the modulus n given only the public key (e,n), potentially breaking RSA without factoring.
On the Usage of Chained Codes in CryptographyCSCJournals
This document summarizes a research paper on using randomized chained linear codes for digital signatures. The summary is:
1) Randomized chained linear codes are proposed to address attacks on previous signature schemes that used regular chained codes. Random vectors are concatenated to the generator matrix of a chained code to create randomized chained codes.
2) A digital signature scheme is presented that uses randomized chained codes. The private key consists of the generator matrix and randomization matrices. The public key is the randomized parity check matrix. Signatures are created using the chain code decoding algorithm.
3) Security analysis shows the scheme is secure if the code length is over 1350 bits, preventing an attacker from determining the private key from the public information
Introduction to Public key Cryptosystems with block diagrams
Reference : Cryptography and Network Security Principles and Practice , Sixth Edition , William Stalling
A Novel Key Distribution Scheme f or a Visual Crypto SystemIRJET Journal
This document proposes a novel key distribution scheme for visual cryptography. It begins with an introduction to cryptography and visual cryptography. It then describes the existing Diffie-Hellman key exchange algorithm. The proposed method generates a shared secret key through a multi-step process using asymmetric key cryptography and modulus operation on private keys and a public image. Both parties are able to derive the same symmetric key for encrypting future communications without directly transmitting their private keys. The methodology and implementation details are provided, along with experimental results demonstrating the generation of matching keys within 0.11 seconds on average.
DATA SECURITY ANALYSIS AND SECURITY EXTENSION FOR SMART CARDS USING JAVA CARDijait
This document discusses and compares two public key cryptosystems - RSA and Elliptic Curve Cryptography (ECC) - for use in smart cards. It finds that ECC provides equivalent security to RSA but with significantly smaller key sizes, making it more efficient and suitable for smart cards with limited storage and processing capabilities. The document outlines the principles, key generation algorithms, and encryption/signature schemes for both RSA and ECC, including specific algorithms like Menezes-Vanstone and Nyberg-Rueppel. It analyzes the security level, efficiency, and space requirements of RSA and ECC, finding that ECC requires keys 10 times smaller than RSA for the same security level and its operations are an order of magnitude faster.
Secure Data Storage on Cloud System for Privacy PreservingIRJET Journal
The document describes a proposed system for secure data storage on cloud systems using elliptic curve cryptography and Shamir's secret sharing algorithm. It discusses how ECC and secret sharing can be used to encrypt data before storing it on the cloud to preserve privacy. The system aims to provide security services like confidentiality. It generates keys using ECC and secret sharing that are shared with authenticated users to allow access to encrypted data stored on the cloud. The system reduces storage and computational overhead for the customer and cloud storage server.
The document proposes an efficient generalized signcryption scheme based on elliptic curve cryptography (ECC) that avoids computationally heavy bilinear pairing operations. It first identifies security issues in a previous tripartite signcryption scheme and proposes corrections. The corrected scheme is extended to support multiple receivers. It then further extends this signcryption scheme to a generalized signcryption scheme that provides either confidentiality, authentication, or a combination of both for messages with multiple receivers. The proposed schemes use only ECC operations and satisfy security properties like forward secrecy and public verification more efficiently than other existing schemes. An application of the generalized signcryption scheme for key management in wireless sensor networks is also discussed.
The document discusses encryption and decryption techniques. It introduces symmetric-key cryptography, where the sender and receiver share a single key, and public-key cryptography, which avoids the problem of secure key exchange. It then discusses the Data Encryption Standard (DES) algorithm, which transforms 64-bit blocks of data using a complex computation controlled by a 64-bit key. DES applies initial and final permutations to the data and uses a cipher function and key schedule for the encryption.
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
Secure Checkpointing Approach for Mobile Environmentidescitation
The document describes a secure checkpointing approach for mobile environments. It proposes using elliptic curve cryptography combined with checkpointing to provide a low overhead, secure, fault tolerant system. Key points:
- Checkpointing is used to save system states to allow recovery from failures. Elliptic curve cryptography provides security by encrypting communication and generating digital signatures.
- The approach shifts cryptographic calculations to base stations to reduce mobile node overhead. Checkpoints and recovery information are stored at base stations.
- Mobile nodes save checkpoints and transfer them to the current base station they are connected to. A recovery algorithm allows processes to rollback and resume from the last saved checkpoint if a failure occurs.
Lightweight secure scheme for detecting provenance forgery and packet drop at...Pvrtechnologies Nellore
The document proposes a lightweight secure scheme to detect packet forgery and loss attacks in wireless sensor networks. It relies on in-packet Bloom filters to encode data provenance. The scheme introduces efficient mechanisms for provenance verification and reconstruction at the base station. Key generation, encryption, and signature techniques are used to securely transmit provenance information and detect suspicious data packets. The proposed technique is evaluated analytically and empirically, proving its effectiveness and efficiency in detecting attacks.
ELECTRONIC MAIL SECURITY USING ASYMMETRIC CRYPTOGRAPHIC ALGORITHM: A NOVEL AP...IRJET Journal
This document proposes a novel approach for securing electronic mail communication using an asymmetric cryptographic algorithm. It develops a new public-key encryption algorithm that encrypts email data into a matrix using mathematical concepts like matrix properties. The algorithm enciphers the email into a matrix and retrieves the original data by decrypting the encrypted data. It generates encryption keys using a key generation algorithm that produces a matrix with a determinant value equal to the public key. The performance of the algorithms and data ciphering is also evaluated.
Certificate less key management scheme inIJNSA Journal
In mobile adhoc networks (MANETs) an efficient and secure key management scheme is extremely crucial. Key management schemes for MANETs are mainly based on identity-based public key cryptography (ID-PKC) or certificate-based public key cryptography, both of which has their inherit problem. The ID-PKC has the key escrow problem and certificate based cryptography have a high computational costs of certificates deployment. In this paper, we present a distributed key management scheme, in which a combination of certificate less public key cryptography (CL-PKC) and threshold cryptography is employed. The scheme proposed in this paper not only achieves several enhanced security attributes for key management in MANET but also eliminates the need for certificate-based public key distribution and the key escrow problem efficiently.
CERTIFICATE LESS KEY MANAGEMENT SCHEME IN MANET USING THRESHOLD CRYPTOGRAPHYIJNSA Journal
In mobile adhoc networks (MANETs) an efficient and secure key management scheme is extremely crucial. Key management schemes for MANETs are mainly based on identity-based public key cryptography (IDPKC) or certificate-based public key cryptography, both of which has their inherit problem. The ID-PKC has the key escrow problem and certificate based cryptography have a high computational costs of certificates deployment. In this paper, we present a distributed key management scheme, in which a combination of certificate less public key cryptography (CL-PKC) and threshold cryptography is employed. The scheme proposed in this paper not only achieves several enhanced security attributes for key management in MANET but also eliminates the need for certificate-based public key distribution and the key escrow problem efficiently.
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.
This document presents a proposed algorithm for public key cryptography using matrices. The algorithm has three stages: 1) shuffling the original data using a linear congruential method and arranging it in a matrix, 2) traversing the data matrix in different patterns, and 3) generating a system of non-homogeneous linear equations from the matrix to derive private keys. The algorithm aims to provide data confidentiality, integrity and authentication for cloud computing applications using public key cryptography with matrices in a way that has constant complexity regardless of key size.
A Survey on Comparisons of Cryptographic Algorithms Using Certain Parameters ...IJECEIAES
he Wireless Sensor Networks (WSNs) have spread its roots in almost every application. Owing to their scattered nature of sensor nodes, they are more prone to attacks. There are certain applications e.g. military, where sensor data‟s confidentiality requirement during transmission is essential. Cryptography has a vital role for achieving security in WSNs.WSN has resource constraints like memory size, processing speed and energy consumption which bounds the applicability of existing cryptographic algorithms for WSN. Any good security algorithms has higher energy consumption by the nodes, so it‟s a need to choose most energy-efficient cryptographic encryption algorithms for WSNs. This paper surveys different asymmetric algorithms such as RSA, Diffie-Hellman, DSA, ECC, hybrid and DNA cryptography. These algorithms are compared based on their key size, strength, weakness, attacks and possible countermeasures in the form of table.
Network coding combined with onion routing for anonymous and secure communica...IJCNCJournal
This paper presents a novel scheme that provides high level of security and privacy in a Wireless Mesh
Network (WMN). We combine an approach of Network Coding with multiple layered encryption of onion routing for a WMN. An added superior feature provides higher level of security and privacy. Sensitive network information is confined to 1-hop neighborhood which is available anyways in a wireless medium with nodes using a bivariate polynomial. The only routing information divulged to a relay node is about next hop. No plain text is ever transmitted and all data can only be decrypted by its source and destination.Prior work finds it difficult to enforce encryption with network coding without divulging in complete
routing information,hence losing privacy and anonymity. We compare our scheme with other existing approach for several networks. The preliminary results show this work to provide superior security and anonymity at low overhead cost.
A New Approach of Cryptographic Technique Using Simple ECC & ECFIJAEMSJORNAL
Cryptography is the technique in which usually a file is converted into unreadable format by using public key and private key system called as public key cryptosystem. Then as per the user requirement that file is send to another user for secure data transmission. In this paper we purposed an image based cryptography that Elliptic Curve Function (ECF) techniques and pseudo random encoding technique on images to enhance the security of RFID communication. In the ECF approach, the basic idea is to replace the Elliptic Curve Function (ECF) of the cover image with the Bits of the messages to be hidden without destroying the property of the cover image significantly. The ECF based technique is the most challenging one as it is difficult to differentiate between the cover object and Crypto object if few ECF bits of the cover object are replaced. In Pseudo Random technique, a random key is used as seed for the Pseudo Random Number Generator in needed in the embedding process. Both the techniques used a Crypto key while embedding messages inside the cover image. By using the key, the chance of getting attacked by the attacker is reduced.
IRJET- FPGA Implementation of Image Encryption and Decryption using Fully Hom...IRJET Journal
This document describes a proposed method for implementing image encryption and decryption using fully homomorphic encryption on an FPGA. The method involves:
1. Loading an image into MATLAB and converting it to a text file for processing.
2. Developing homomorphic encryption and decryption algorithms in VHDL and simulating/synthesizing them for implementation on an FPGA.
3. Encrypting the image by applying the homomorphic encryption algorithm to the text data and reconverting to an encrypted image. Decrypting works in the reverse manner applying the decryption algorithm.
4. The goal is to allow computations on encrypted data by combining properties of partial homomorphic encryption schemes to enable a fully hom
UNIT - 2
SYMMETRIC CIPHERS: Symmetric Cipher Model, Substitution Techniques,
Transposition Techniques, Simplified DES, Data encryption standard (DES), The strength of
DES, Differential and Linear Cryptanalysis, Block Cipher Design Principles and Modes of
Operation, Evaluation Criteria for Advanced Encryption Standard, The AES Cipher.
The document contains a series of questions and answers related to the topics of cryptography and network security. It is divided into 5 units, with questions ranging from defining basic terms to explaining concepts in more depth. Some of the questions ask for examples or demonstrations of algorithms and techniques. The document serves as a study guide or practice test for a course on cryptography and security.
Similar to Lightweight Cryptography for Distributed PKI Based MANETS (20)
Rendezvous Sequence Generation Algorithm for Cognitive Radio Networks in Post...IJCNCJournal
Recent natural disasters have inflicted tremendous damage on humanity, with their scale progressively increasing and leading to numerous casualties. Events such as earthquakes can trigger secondary disasters, such as tsunamis, further complicating the situation by destroying communication infrastructures. This destruction impedes the dissemination of information about secondary disasters and complicates post-disaster rescue efforts. Consequently, there is an urgent demand for technologies capable of substituting for these destroyed communication infrastructures. This paper proposes a technique for generating rendezvous sequences to swiftly reconnect communication infrastructures in post-disaster scenarios. We compare the time required for rendezvous using the proposed technique against existing methods and analyze the average time taken to establish links with the rendezvous technique, discussing its significance. This research presents a novel approach enabling rapid recovery of destroyed communication infrastructures in disaster environments through Cognitive Radio Network (CRN) technology, showcasing the potential to significantly improve disaster response and recovery efforts. The proposed method reduces the time for the rendezvous compared to existing methods, suggesting that it can enhance the efficiency of rescue operations in post-disaster scenarios and contribute to life-saving efforts.
Blockchain Enforced Attribute based Access Control with ZKP for Healthcare Se...IJCNCJournal
The relationship between doctors and patients is reinforced through the expanded communication channels provided by remote healthcare services, resulting in heightened patient satisfaction and loyalty. Nonetheless, the growth of these services is hampered by security and privacy challenges they confront. Additionally, patient electronic health records (EHR) information is dispersed across multiple hospitals in different formats, undermining data sovereignty. It allows any service to assert authority over their EHR, effectively controlling its usage. This paper proposes a blockchain enforced attribute-based access control in healthcare service. To enhance the privacy and data-sovereignty, the proposed system employs attribute-based access control, zero-knowledge proof (ZKP) and blockchain. The role of data within our system is pivotal in defining attributes. These attributes, in turn, form the fundamental basis for access control criteria. Blockchain is used to keep hospital information in public chain but EHR related data in private chain. Furthermore, EHR provides access control by using the attributed based cryptosystem before they are stored in the blockchain. Analysis shows that the proposed system provides data sovereignty with privacy provision based on the attributed based access control.
EECRPSID: Energy-Efficient Cluster-Based Routing Protocol with a Secure Intru...IJCNCJournal
A revolutionary idea that has gained significance in technology for Internet of Things (IoT) networks backed by WSNs is the " Energy-Efficient Cluster-Based Routing Protocol with a Secure Intrusion Detection" (EECRPSID). A WSN-powered IoT infrastructure's hardware foundation is hardware with autonomous sensing capabilities. The significant features of the proposed technology are intelligent environment sensing, independent data collection, and information transfer to connected devices. However, hardware flaws and issues with energy consumption may be to blame for device failures in WSN-assisted IoT networks. This can potentially obstruct the transfer of data. A reliable route significantly reduces data retransmissions, which reduces traffic and conserves energy. The sensor hardware is often widely dispersed by IoT networks that enable WSNs. Data duplication could occur if numerous sensor devices are used to monitor a location. Finding a solution to this issue by using clustering. Clustering lessens network traffic while retaining path dependability compared to the multipath technique. To relieve duplicate data in EECRPSID, we applied the clustering technique. The multipath strategy might make the provided protocol more dependable. Using the EECRPSID algorithm, will reduce the overall energy consumption, minimize the End-to-end delay to 0.14s, achieve a 99.8% Packet Delivery Ratio, and the network's lifespan will be increased. The NS2 simulator is used to run the whole set of simulations. The EECRPSID method has been implemented in NS2, and simulated results indicate that comparing the other three technologies improves the performance measures.
Analysis and Evolution of SHA-1 Algorithm - Analytical TechniqueIJCNCJournal
A 160-bit (20-byte) hash value, sometimes called a message digest, is generated using the SHA-1 (Secure Hash Algorithm 1) hash function in cryptography. This value is commonly represented as 40 hexadecimal digits. It is a Federal Information Processing Standard in the United States and was developed by the National Security Agency. Although it has been cryptographically cracked, the technique is still in widespread usage. In this work, we conduct a detailed and practical analysis of the SHA-1 algorithm's theoretical elements and show how they have been implemented through the use of several different hash configurations.
Optimizing CNN-BiGRU Performance: Mish Activation and Comparative AnalysisIJCNCJournal
Deep learning is currently extensively employed across a range of research domains. The continuous advancements in deep learning techniques contribute to solving intricate challenges. Activation functions (AF) are fundamental components within neural networks, enabling them to capture complex patterns and relationships in the data. By introducing non-linearities, AF empowers neural networks to model and adapt to the diverse and nuanced nature of real-world data, enhancing their ability to make accurate predictions across various tasks. In the context of intrusion detection, the Mish, a recent AF, was implemented in the CNN-BiGRU model, using three datasets: ASNM-TUN, ASNM-CDX, and HOGZILLA. The comparison with Rectified Linear Unit (ReLU), a widely used AF, revealed that Mish outperforms ReLU, showcasing superior performance across the evaluated datasets. This study illuminates the effectiveness of AF in elevating the performance of intrusion detection systems.
An Hybrid Framework OTFS-OFDM Based on Mobile Speed EstimationIJCNCJournal
The Future wireless communication systems face the challenging task of simultaneously providing high-quality service (QoS) and broadband data transmission, while also minimizing power consumption, latency, and system complexity. Although Orthogonal Frequency Division Multiplexing (OFDM) has been widely adopted in 4G and 5G systems, it struggles to cope with a significant delay and Doppler spread in high mobility scenarios. To address these challenges, a novel waveform named Orthogonal Time Frequency Space (OTFS). Designers aim to outperform OFDM by closely aligning signals with the channel behaviour. In this paper, we propose a switching strategy that empowers operators to select the most appropriate waveform based on an estimated speed of the mobile user. This strategy enables the base station to dynamically choose the waveform that best suits the mobile user’s speed. Additionally, we suggest retaining an Integrated Sensing and Communication (ISAC) radar approach for accurate Doppler estimation. This provides precise information to facilitate the waveform selection procedure. By leveraging the switching strategy and harnessing the Doppler estimation capabilities of an ISAC radar.Our proposed approach aims to enhance the performance of wireless communication systems in high mobility cases. Considering the complexity of waveform processing, we introduce an optimized hybrid system that combines OTFS and OFDM, resulting in reduced complexity while still retaining performance benefits.This hybrid system presents a promising solution for improving the performance of wireless communication systems in higher mobility.The simulation results validate the effectiveness of our approach, demonstrating its potential advantages for future wireless communication systems. The effectiveness of the proposed approach is validated by simulation results as it will be illustrated.
Enhanced Traffic Congestion Management with Fog Computing - A Simulation-Base...IJCNCJournal
Accurate latency computation is essential for the Internet of Things (IoT) since the connected devices generate a vast amount of data that is processed on cloud infrastructure. However, the cloud is not an optimal solution. To overcome this issue, fog computing is used to enable processing at the edge while still allowing communication with the cloud. Many applications rely on fog computing, including traffic management. In this paper, an Intelligent Traffic Congestion Mitigation System (ITCMS) is proposed to address traffic congestion in heavily populated smart cities. The proposed system is implemented using fog computing and tested in a crowdedCairo city. The results obtained indicate that the execution time of the simulation is 4,538 seconds, and the delay in the application loop is 49.67 seconds. The paper addresses various issues, including CPU usage, heap memory usage, throughput, and the total average delay, which are essential for evaluating the performance of the ITCMS. Our system model is also compared with other models to assess its performance. A comparison is made using two parameters, namely throughput and the total average delay, between the ITCMS, IOV (Internet of Vehicle), and STL (Seasonal-Trend Decomposition Procedure based on LOESS). Consequently, the results confirm that the proposed system outperforms the others in terms of higher accuracy, lower latency, and improved traffic efficiency.
Rendezvous Sequence Generation Algorithm for Cognitive Radio Networks in Post...IJCNCJournal
Recent natural disasters have inflicted tremendous damage on humanity, with their scale progressively increasing and leading to numerous casualties. Events such as earthquakes can trigger secondary disasters, such as tsunamis, further complicating the situation by destroying communication infrastructures. This destruction impedes the dissemination of information about secondary disasters and complicates post-disaster rescue efforts. Consequently, there is an urgent demand for technologies capable of substituting for these destroyed communication infrastructures. This paper proposes a technique for generating rendezvous sequences to swiftly reconnect communication infrastructures in post-disaster scenarios. We compare the time required for rendezvous using the proposed technique against existing methods and analyze the average time taken to establish links with the rendezvous technique, discussing its significance. This research presents a novel approach enabling rapid recovery of destroyed communication infrastructures in disaster environments through Cognitive Radio Network (CRN) technology, showcasing the potential to significantly improve disaster response and recovery efforts. The proposed method reduces the time for the rendezvous compared to existing methods, suggesting that it can enhance the efficiency of rescue operations in post-disaster scenarios and contribute to life-saving efforts.
Vehicle Ad Hoc Networks (VANETs) have become a viable technology to improve traffic flow and safety on the roads. Due to its effectiveness and scalability, the Wingsuit Search-based Optimised Link State Routing Protocol (WS-OLSR) is frequently used for data distribution in VANETs. However, the selection of MultiPoint Relays (MPRs) plays a pivotal role in WS-OLSR's performance. This paper presents an improved MPR selection algorithm tailored to WS-OLSR, designed to enhance the overall routing efficiency and reduce overhead. The analysis found that the current OLSR protocol has problems such as redundancy of HELLO and TC message packets or failure to update routing information in time, so a WS-OLSR routing protocol based on improved-MPR selection algorithm was proposed. Firstly, factors such as node mobility and link changes are comprehensively considered to reflect network topology changes, and the broadcast cycle of node HELLO messages is controlled through topology changes. Secondly, a new MPR selection algorithm is proposed, considering link stability issues and nodes. Finally, evaluate its effectiveness in terms of packet delivery ratio, end-to-end delay, and control message overhead. Simulation results demonstrate the superior performance of our improved MR selection algorithm when compared to traditional approaches.
May 2024, Volume 16, Number 3 - The International Journal of Computer Network...IJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
Vehicle Ad Hoc Networks (VANETs) have become a viable technology to improve traffic flow and safety on the roads. Due to its effectiveness and scalability, the Wingsuit Search-based Optimised Link State Routing Protocol (WS-OLSR) is frequently used for data distribution in VANETs. However, the selection of MultiPoint Relays (MPRs) plays a pivotal role in WS-OLSR's performance. This paper presents an improved MPR selection algorithm tailored to WS-OLSR, designed to enhance the overall routing efficiency and reduce overhead. The analysis found that the current OLSR protocol has problems such as redundancy of HELLO and TC message packets or failure to update routing information in time, so a WS-OLSR routing protocol based on improved-MPR selection algorithm was proposed. Firstly, factors such as node mobility and link changes are comprehensively considered to reflect network topology changes, and the broadcast cycle of node HELLO messages is controlled through topology changes. Secondly, a new MPR selection algorithm is proposed, considering link stability issues and nodes. Finally, evaluate its effectiveness in terms of packet delivery ratio, end-to-end delay, and control message overhead. Simulation results demonstrate the superior performance of our improved MR selection algorithm when compared to traditional approaches.
A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...IJCNCJournal
So far, Wireless Body Area Networks (WBANs) have played a pivotal role in driving the development of intelligent healthcare systems with broad applicability across various domains. Each WBAN consists of one or more types of sensors that can be embedded in clothing, attached directly to the body, or even implanted beneath an individual's skin. These sensors typically serve asingle application. However, the traffic generated by each sensor may have distinct requirements. This diversity necessitates a dual approach: tailored treatment based on the specific needs of each traffic typeand the fulfillment of application requirements, such asreliability and timeliness. Never the less, the presence of energy constraints and the unreliable nature of wireless communications make QoS provisioning under such networks a non-trivial task. In this context, the current paper introduces a novel Medium AccessControl (MAC) strategy for the regular traffic applications of WBANs, designed to significantly enhance efficiency when compared to the established MAC protocols IEEE 802.15.4 and IEEE 802.15.6, with a particular focus on improving reliability, timeliness, and energy efficiency.
May_2024 Top 10 Read Articles in Computer Networks & Communications.pdfIJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
A Topology Control Algorithm Taking into Account Energy and Quality of Transm...IJCNCJournal
The efficient use of energy in wireless sensor networks is critical for extending node lifetime. The network topology is one of the factors that have a significant impact on the energy usage at the nodes and the quality of transmission (QoT) in the network. We propose a topology control algorithm for software-defined wireless sensor networks (SDWSNs) in this paper. Our method is to formulate topology control algorithm as a nonlinear programming (NP) problem with the objective to optimizing two metrics, maximum communication range, and desired degree. This NP problem is solved at the SDWSN controller by employing the genetic algorithm (GA) to determine the best topology. The simulation results show that the proposed algorithm outperforms the MaxPower algorithm in terms of average node degree and energy expansion ratio.
Multi-Server user Authentication Scheme for Privacy Preservation with Fuzzy C...IJCNCJournal
The integration of artificial intelligence technology with a scalable Internet of Things (IoT) platform facilitates diverse smart communication services, allowing remote users to access services from anywhere at any time. The multi-server environment within IoT introduces a flexible security service model, enabling users to interact with any server through a single registration. To ensure secure and privacy preservation services for resources, an authentication scheme is essential. Zhao et al. recently introduced a user authentication scheme for the multi-server environment, utilizing passwords and smart cards, claiming resilience against well-known attacks. This paper conducts cryptanalysis on Zhao et al.'s scheme, focusing on denial of service and privacy attacks, revealing a lack of user-friendliness. Subsequently, we propose a new multi-server user authentication scheme for privacy preservation with fuzzy commitment over the IoT environment, addressing the shortcomings of Zhao et al.'s scheme. Formal security verification of the proposed scheme is conducted using the ProVerif simulation tool. Through both formal and informal security analyses, we demonstrate that the proposed scheme is resilient against various known attacks and those identified in Zhao et al.'s scheme.
Advanced Privacy Scheme to Improve Road Safety in Smart Transportation SystemsIJCNCJournal
In -Vehicle Ad-Hoc Network (VANET), vehicles continuously transmit and receive spatiotemporal data with neighboring vehicles, thereby establishing a comprehensive 360-degree traffic awareness system. Vehicular Network safety applications facilitate the transmission of messages between vehicles that are near each other, at regular intervals, enhancing drivers' contextual understanding of the driving environment and significantly improving traffic safety. Privacy schemes in VANETs are vital to safeguard vehicles’ identities and their associated owners or drivers. Privacy schemes prevent unauthorized parties from linking the vehicle's communications to a specific real-world identity by employing techniques such as pseudonyms, randomization, or cryptographic protocols. Nevertheless, these communications frequently contain important vehicle information that malevolent groups could use to Monitor the vehicle over a long period. The acquisition of this shared data has the potential to facilitate the reconstruction of vehicle trajectories, thereby posing a potential risk to the privacy of the driver. Addressing the critical challenge of developing effective and scalable privacy-preserving protocols for communication in vehicle networks is of the highest priority. These protocols aim to reduce the transmission of confidential data while ensuring the required level of communication. This paper aims to propose an Advanced Privacy Vehicle Scheme (APV) that periodically changes pseudonyms to protect vehicle identities and improve privacy. The APV scheme utilizes a concept called the silent period, which involves changing the pseudonym of a vehicle periodically based on the tracking of neighboring vehicles. The pseudonym is a temporary identifier that vehicles use to communicate with each other in a VANET. By changing the pseudonym regularly, the APV scheme makes it difficult for unauthorized entities to link a vehicle's communications to its real-world identity. The proposed APV is compared to the SLOW, RSP, CAPS, and CPN techniques. The data indicates that the efficiency of APV is a better improvement in privacy metrics. It is evident that the AVP offers enhanced safety for vehicles during transportation in the smart city.
April 2024 - Top 10 Read Articles in Computer Networks & CommunicationsIJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
DEF: Deep Ensemble Neural Network Classifier for Android Malware DetectionIJCNCJournal
Malware is one of the threats to security of computer networks and information systems. Since malware instances are available sufficiently, there is increased interest among researchers on usage of Artificial Intelligence (AI). Of late AI-enabled methods such as machine learning (ML) and deep learning paved way for solving many real-world problems. As it is a learning-based approach, accumulated training samples help in improving thequality of training and thus leveraging malware detection accuracy. Existing deep learning methods are focusing on learning-based malware detection systems. However, there is need for improving the state of the art through ensemble approach. Towards this end, in this paper we proposed a framework known as Deep Ensemble Framework (DEF) for automatic malware detection. The framework obtains features from training samples. From given malware instance a grayscale image is generated. There is another process to extract the opcode sequences. Convolutional Neural Network (CNN) and Long Short Term Memory (LSTM) techniques are used to obtain grayscale image and opcode sequence respectively. Afterwards, a stacking ensemble is employed in order to achieve efficient malware detection and classification. Malware samples collected fromthe Internet sources and Microsoft are used for theempirical study. An algorithm known as Ensemble Learning for Automatic Malware Detection (EL-AML) is proposed to realize our framework. Another algorithm named Pre-Process is proposed to assist the EL-AML algorithm for obtaining intermediate features required by CNN and LSTM.Empirical study reveals that our framework outperforms many existing methods in terms of speed-up and accuracy.
High Performance NMF Based Intrusion Detection System for Big Data IOT TrafficIJCNCJournal
With the emergence of smart devices and the Internet of Things (IoT), millions of users connected to the network produce massive network traffic datasets. These vast datasets of network traffic, Big Data are challenging to store, deal with and analyse using a single computer. In this paper we developed parallel implementation using a High Performance Computer (HPC) for the Non-Negative Matrix Factorization technique as an engine for an Intrusion Detection System (HPC-NMF-IDS). The large IoT traffic datasets of order of millions samples are distributed evenly on all the computing cores for both storage and speedup purpose. The distribution of computing tasks involved in the Matrix Factorization takes into account the reduction of the communication cost between the computing cores. The experiments we conducted on the proposed HPC-IDS-NMF give better results than the traditional ML-based intrusion detection systems. We could train the HPC model with datasets of one million samples in only 31 seconds instead of the 40 minutes using one processor), that is a speed up of 87 times. Moreover, we have got an excellent detection accuracy rate of 98% for KDD dataset.
A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...IJCNCJournal
So far, Wireless Body Area Networks (WBANs) have played a pivotal role in driving the development of intelligent healthcare systems with broad applicability across various domains. Each WBAN consists of one or more types of sensors that can be embedded in clothing, attached directly to the body, or even implanted beneath an individual's skin. These sensors typically serve asingle application. However, the traffic generated by each sensor may have distinct requirements. This diversity necessitates a dual approach: tailored treatment based on the specific needs of each traffic typeand the fulfillment of application requirements, such asreliability and timeliness. Never the less, the presence of energy constraints and the unreliable nature of wireless communications make QoS provisioning under such networks a non-trivial task. In this context, the current paper introduces a novel Medium AccessControl (MAC) strategy for the regular traffic applications of WBANs, designed to significantly enhance efficiency when compared to the established MAC protocols IEEE 802.15.4 and IEEE 802.15.6, with a particular focus on improving reliability, timeliness, and energy efficiency.
How to Build a Module in Odoo 17 Using the Scaffold MethodCeline George
Odoo provides an option for creating a module by using a single line command. By using this command the user can make a whole structure of a module. It is very easy for a beginner to make a module. There is no need to make each file manually. This slide will show how to create a module using the scaffold method.
Main Java[All of the Base Concepts}.docxadhitya5119
This is part 1 of my Java Learning Journey. This Contains Custom methods, classes, constructors, packages, multithreading , try- catch block, finally block and more.
Walmart Business+ and Spark Good for Nonprofits.pdfTechSoup
"Learn about all the ways Walmart supports nonprofit organizations.
You will hear from Liz Willett, the Head of Nonprofits, and hear about what Walmart is doing to help nonprofits, including Walmart Business and Spark Good. Walmart Business+ is a new offer for nonprofits that offers discounts and also streamlines nonprofits order and expense tracking, saving time and money.
The webinar may also give some examples on how nonprofits can best leverage Walmart Business+.
The event will cover the following::
Walmart Business + (https://business.walmart.com/plus) is a new shopping experience for nonprofits, schools, and local business customers that connects an exclusive online shopping experience to stores. Benefits include free delivery and shipping, a 'Spend Analytics” feature, special discounts, deals and tax-exempt shopping.
Special TechSoup offer for a free 180 days membership, and up to $150 in discounts on eligible orders.
Spark Good (walmart.com/sparkgood) is a charitable platform that enables nonprofits to receive donations directly from customers and associates.
Answers about how you can do more with Walmart!"
How to Manage Your Lost Opportunities in Odoo 17 CRMCeline George
Odoo 17 CRM allows us to track why we lose sales opportunities with "Lost Reasons." This helps analyze our sales process and identify areas for improvement. Here's how to configure lost reasons in Odoo 17 CRM
ISO/IEC 27001, ISO/IEC 42001, and GDPR: Best Practices for Implementation and...PECB
Denis is a dynamic and results-driven Chief Information Officer (CIO) with a distinguished career spanning information systems analysis and technical project management. With a proven track record of spearheading the design and delivery of cutting-edge Information Management solutions, he has consistently elevated business operations, streamlined reporting functions, and maximized process efficiency.
Certified as an ISO/IEC 27001: Information Security Management Systems (ISMS) Lead Implementer, Data Protection Officer, and Cyber Risks Analyst, Denis brings a heightened focus on data security, privacy, and cyber resilience to every endeavor.
His expertise extends across a diverse spectrum of reporting, database, and web development applications, underpinned by an exceptional grasp of data storage and virtualization technologies. His proficiency in application testing, database administration, and data cleansing ensures seamless execution of complex projects.
What sets Denis apart is his comprehensive understanding of Business and Systems Analysis technologies, honed through involvement in all phases of the Software Development Lifecycle (SDLC). From meticulous requirements gathering to precise analysis, innovative design, rigorous development, thorough testing, and successful implementation, he has consistently delivered exceptional results.
Throughout his career, he has taken on multifaceted roles, from leading technical project management teams to owning solutions that drive operational excellence. His conscientious and proactive approach is unwavering, whether he is working independently or collaboratively within a team. His ability to connect with colleagues on a personal level underscores his commitment to fostering a harmonious and productive workplace environment.
Date: May 29, 2024
Tags: Information Security, ISO/IEC 27001, ISO/IEC 42001, Artificial Intelligence, GDPR
-------------------------------------------------------------------------------
Find out more about ISO training and certification services
Training: ISO/IEC 27001 Information Security Management System - EN | PECB
ISO/IEC 42001 Artificial Intelligence Management System - EN | PECB
General Data Protection Regulation (GDPR) - Training Courses - EN | PECB
Webinars: https://pecb.com/webinars
Article: https://pecb.com/article
-------------------------------------------------------------------------------
For more information about PECB:
Website: https://pecb.com/
LinkedIn: https://www.linkedin.com/company/pecb/
Facebook: https://www.facebook.com/PECBInternational/
Slideshare: http://www.slideshare.net/PECBCERTIFICATION
This presentation was provided by Steph Pollock of The American Psychological Association’s Journals Program, and Damita Snow, of The American Society of Civil Engineers (ASCE), for the initial session of NISO's 2024 Training Series "DEIA in the Scholarly Landscape." Session One: 'Setting Expectations: a DEIA Primer,' was held June 6, 2024.
हिंदी वर्णमाला पीपीटी, hindi alphabet PPT presentation, hindi varnamala PPT, Hindi Varnamala pdf, हिंदी स्वर, हिंदी व्यंजन, sikhiye hindi varnmala, dr. mulla adam ali, hindi language and literature, hindi alphabet with drawing, hindi alphabet pdf, hindi varnamala for childrens, hindi language, hindi varnamala practice for kids, https://www.drmullaadamali.com
How to Add Chatter in the odoo 17 ERP ModuleCeline George
In Odoo, the chatter is like a chat tool that helps you work together on records. You can leave notes and track things, making it easier to talk with your team and partners. Inside chatter, all communication history, activity, and changes will be displayed.
How to Make a Field Mandatory in Odoo 17Celine George
In Odoo, making a field required can be done through both Python code and XML views. When you set the required attribute to True in Python code, it makes the field required across all views where it's used. Conversely, when you set the required attribute in XML views, it makes the field required only in the context of that particular view.
Lightweight Cryptography for Distributed PKI Based MANETS
1. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.2, March 2018
Lightweight Cryptography for Distributed
PKI Based MANETS
N Chaitanya Kumar, Abdul Basit, Priyadarshi Singh, and V. Ch. Venkaiah
School of Computer and Information Sciences, University of Hyderabad,
Hyderabad-500046, India
Abstract. Because of lack of infrastructure and Central Authority(CA), secure communication is
a challenging job in MANETs. A lightweight security solution is needed in MANET to balance its
nodes resource tightness and mobility feature. The role of CA should be decentralized in MANET
because the network is managed by the nodes themselves without any fixed infrastructure and cen-
tralized authority. In this paper, we created a distributed PUblic Key Infrastructure (PKI) using
Shamir secret sharing mechanism which allows the nodes of the MANET to have a share of its pri-
vate key. The traditional PKI protocols require centralized authority and heavy computing power to
manage public and private keys, thus making them not suitable for MANETs. To establish a secure
communication for the MANET nodes, we proposed a lightweight crypto protocol which requires
limited resources, making it suitable for MANETs.
Keywords: Secret sharing, Lightweight Cryptography, Public key cryptography, MANETS
1 Introduction
MANET known as Mobile ad hoc Network is a self-configuring, a dynamic and
infrastructure-less network of wireless connected mobile nodes [1] [2]. These mobile
nodes move freely. Every node in the network has its own communication range and
other nodes within the range can interact and exchange messages. If any nodes tend
to go from the prescribed range of the MANET, it eventually leads to the failure of
nodes [3]. The computational power of the fixed infrastructure devices are greater
than the nodes i.e, the nodes are less computational because of their restrictions
on the amount of energy utilization. Denial of service, eavesdropping, interception
and routing attacks are major threats to security in MANETS.[4] [5]. The advent of
IOT devices and the wide usage of the electronic devices raised concerns over these
security issues. There are several factors like power dissipation, area and cost that
affect embedded applications which implement a full-fledged cryptographic environ-
ment. Because of these factors the concept of lightweight cryptography emerged.
Less amount of memory space is utilized by lightweight cryptography. As a result of
this, the amount of gate equivalent count is less and eventually leads to an efficient
hardware implementation. Nowadays Public key cryptosystem(PKC) is used widely
in many applications. The main concept of PKC is to provide key exchange services
and digital signatures for authentication purpose. In PKC, the concept of public
DOI: 10.5121/ijcnc.2018.10207 69
2. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.1, January 2018
key management is to be handled carefully to avoid the wide range of attacks. In
PKC, an authority looks after all the public parameters and generates them and
will provide the details when necessary to a particular user. The authority might
also generate the private keys too. But as it is a third party, there are cases where
the authority might misuse its power, therefore the trusted authority will generate
only partial private key [6]. In our proposal, the nodes of the MANET hold a partial
share of the MANET secret and they use that share to generate a secret key using
Diffie - Hellman key exchange to communicate among them
2 Preliminaries
2.1 Shamir Secret Sharing
Blakley [10] and Shamir [12] are the first to introduce secret sharing techniques. In
general a secret sharing scheme contains a dealer D and a set U = {u1, u2, . . . , un}
of n users. The dealer has a secret s and a share si of which is privately distributed
to user ui, 1 ≤ i ≤ n. A valid subset u ( for : u ⊂ U) of t number of users
holding valid shares can reconstruct the secret s, where t is minimum number of
users or threshold value and (t, n) scheme is called as threshold access structure
[12]. In threshold cryptography, the private key s is shared among n participants
using a (t,n) threshold access structure with the help of a secret sharing scheme,
with each participant ui having a partial share si [13]. For example, in public key
cryptography(PKC), let the public key be pk and the corresponding private key be
s. If a user has encrypted a message using the public key pk then to decrypt the
message, at-least t out of n nodes are needed to decrypt the message.
Shamir’s secret sharing scheme realizes a (t, n) threshold access structures by
means of polynomial interpolation. Let Zq be a finite field with q > n and let s ∈ Zq
be the secret. A polynomial P(x) is taken by the dealer having degree t − 1, here
the actual secret is s which is a constant term of P(x) and all other coefficients
ai for i ∈ 1, 2, 3, . . . , t − 1 are selected from Zq uniformly and independently at
random. That is, P(x) = s + t−1
i=1 ai ∗ xi. Every party or user ui is associated
to a field element bi publicly for i ∈ 1, 2, 3, . . . , n. The different field elements are
associated with different parties or users. The dealer privately sends to party ui the
value [s]i = P(bi), for i = 1, 2, . . . , n.This scheme realizes (t, n) threshold access
structure. The parties agreeing to recover secret s is u1, . . . , ut. The secret s can
be obtained as
t
i=1
[s]i
t
m=0,m=j
xm
xm−xj
. The number of parties less than t cannot
interpret any information regarding the secret s. We used basic Shamir’s secret
sharing to share the key among the MANET nodes, however depending on the
application different variations can also be used like the one proposed by Abdul et.
al. [21] and [11].
70
3. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.1, January 2018
2.2 Elliptic Curve Cryptography [14] and Diffie Hellman Key
Exchange
Elliptic curve cryptosystems were first proposed independently by Neil Koblitz and
Victor Miller in 1985. Elliptic curve cryptography (ECC) is a public key encryp-
tion technique that is based on the algebraic structure of elliptic curves over finite
fields. In comparison to non-Elliptic curve cryptography, Elliptic curve cryptogra-
phy makes use of relatively smaller keys to provide the same level of security. The
discrete logarithmic defined using a group of points on an elliptic curve over a finite
field is the hardest among the remaining groups. The security of a cryptosystem
relies on the hardness of this discrete logarithmic problem. [15].
Elliptic Curve Discrete Logarithm Problem (ECDLP) ECDLP is the prob-
lem of finding the integer s, given a rational point Q on the elliptic curve E and the
value of s*Q. Elliptic curve cryptosystems are dependent on the level of difficulty
of ECDLP. If an attacker can solve the ECDLP then he will be able to break the
system, but ECDLP is much harder than Discrete Logarithm Problem(DLP) in
finite fields. The strongest techniques generally used to solve DLP in finite fields,
like the index calculus method, Shank’s baby step giant step algorithm, the Pohlig
- Hellmann method and Pollard’s ρ method don’t work in solving ECDLP prob-
lem. Most of them work only if the group order is divisible by some large prime.
In 1993, Menezes, Okamoto and Vanstone reduced the ECDLP to DLP on F∗
( qk).
This method works only for supersingular curves i.e curves of the form y2 = x3 +ax
when the characteristic p of Fq ≡ −1(mod 4) and also curves of the form y2 = x3 +b
when p ≡ −1(mod 3) i.e curves for which k is small. This method known as MOV
method is only useful for a small class of elliptic curves but most elliptic curves are
non supersingular.
The Diffie Hellman Key Exchange using ECC Symmetric Encryption of
data requires the transfer of secret key from the sender to receiver without anyone
intercepting the key, which is the most challenging task [8]. Diffie-Hellman algorithm
made the transfer and the generation of similar keys at two ends secretly successful.
The idea of the Diffie-Hellman algorithm was coined by Diffie and Martin Hellman
in the year 1976. The key goal behind the development of this algorithm was not
mere encryption and decryption of data, but it completely revolved around the
generation of a similar private cryptographic key at two ends so that the transferring
of a key.[9]. The algorithm may lag behind due to its speed, but the power of
the algorithm is the ultimate reason behind its popularity among key generation
techniques. The following procedure generates a common secret key between two
parties A and B using ECC.
– A and B agree on a Finite field Fq and an elliptic curve E defined over Fq.
71
4. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.1, January 2018
– They also choose a public random base point P that belongs to E.
– A chooses a random secret integer a, computes a · P ∈ E and sends it to B.
– B chooses a secret random integer b, computes b · B ∈ E and sends it to A.
– A computes the secret key s = a(b·P) and B computes the secret key s = b(a·P).
so they both have the common secret point s.
– If the attacker gets hold of P, a · P, b · P, then there is no easy way to calculate
abP because of ECDLP.
2.3 Lightweight Cryptography
The type of cryptography which deals with the integration of cryptographic prim-
itives, ciphers and various techniques utilizing a small computing power and de-
liver high standards of security is known as lightweight cryptography. To design
lightweight algorithms, the computational complexity and the demands on hard-
ware and other limitations of the device are to be analyzed. In this paper we
considered Tiny Encryption Algorithm (TEA), which is one of the fastest and most
efficient lightweight algorithm.
Tiny Encryption Algorithm(TEA) [7] TEA is a symmetric Feistel type cipher
created by David Wheeler and Roger Needham of Cambridge University, which
come under a specialized class possessing iterated block ciphers. The ciphertext is
generated from the plain text by repeatedly applying the same transformation or
round function. In this form of cipher, there are two stages of encryption process.
The first stage is the application of a round function F on the first part with the
use of a subkey and the output of this stage is XOred with the remaining part. The
above mentioned pattern is followed for each round except the final round where
the swapping is not applied. A double shift operation in TEA results in the mixing
of key and all bits containing the data repeatedly. The 128-bit key K is split into
four 32-bit blocks (K = (K[0], K[1], K[2], K[3]) by using the key shift algorithm.
ENCRYPTION OF TEA [20] A plain text P of 64 bit length will be splitting into
2 equal halves i.e 32 bit each. The encryption of one half is done with the other
half by processing it in 64 rounds. Later this is joined and eventually leads to the
formation of cipher text block( C = Left[64], Right[64]). A 128 bit key K is divided
in to four parts ( K =K[0], K[1], K[2], K[3]).
– A sub key k[i], Left[i-1] and Right[i-1] act as inputs to each round i which are
the output from the previous round.
– The sub keys K[i] are different from K and from each other.
– The constant delta = (
√
5 − 1) ∗ 231 = 0x9E3779B9.
– The round function slightly differs from a classical Fiestel cipher structure in
that integer addition modulo 232 is used instead of exclusive-or as the combining
operator.
72
5. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.1, January 2018
Fig. 1. TEA Encryption Structure
73
6. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.1, January 2018
The structure of TEA encryption algorithm is depicted in figure 1 and the
symbol denotes integer addition modulo 232. The round function F, consists
of the key addition, bit wise XOR and left and right shift operations. The output
(Left[i+1],Right[i+1]) of the ith cycle of TEA with respect to the input (Left[i],Right[i])
is described as follows :
Left[i + 1] = Left[i] F(Right[i], K[0, 1], delta[i])
Right[i + 1] = Right[i] F(Right[i + 1], k[2, 3], delta[i])
delta[i] = (i + 1)/2 ∗ delta
The round function F, is denoted by
F(M, K[j,k], delta[i]) = ((M 4) K[j]) ⊕ (M delta[i])⊕ ((M 5) K[k]), where
j,k ranges from 1 to 64. The round function structure is same for each round but
takes parameters from the round sub key K[i]. It uses simple key schedule algorithm,
the 128-bit key K is divided into four 32-bit blocks K = K[0],K[1],K[2],K[3]). The
odd rounds used the keys K[0] and K[1] and the even rounds use the keys K[2] and
K[3]. Figure 2 shows the internal details of the ith cycle of TEA.
Fig. 2. General View of TEA in its i-th Cycle
74
7. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.1, January 2018
DECRYPTION OF TEA The decryption process initiates with accepting the ci-
pher text as input followed by the reverse application of the K[i] subkeys. This
process is similar to the encryption process.The Decryption is similar to encryption
which takes cipher text as input and the sub keys K[i] are iapplied in the reverse
order. The intermediate value of the decryption process is equal to the correspond-
ing value of the encryption process with the two halves of the values swapped. For
example, if the output of the ith encryption round is
ELeft[i]||ERight[i] (ELeft[i] concatenated with ERight[i]).
Then the corresponding input to the (64 − i)th decryption round is
DRight[i]||DLeft[i] (DRight[i] concatenated with DLeft[i]).
Once the last iteration of the encryption process is completed then the two halves
of the output are exchanged, so that the cipher text is ERight[64]||ELeft[64] and
the final cipher text C is the output of that round. Figure 3 represents the structure
of the TEA decryption process.
Fig. 3. The structure of TEA decryption process
75
8. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.1, January 2018
3 Proposed System
In our Proposed system, we show how the nodes of MANET can communicate
securely using lightweight cryptography. An additive group G being generated by
some element Q having prime order q, and is hard under the assumption of discrete
logarithmic problem are made public. The public key is given as PK = s ∗ Q. We
use a collision-resistant hash function h : {0, 1}∗ → Zq. All the values G, q, Q, PK
are made public. The nodes exchange the private keys by using the Diffie hell-
man key exchange. Our proposed scheme consists of the phases Initial Setup,
Key Distribution, Computing a secret Key and Secure communication.
3.1 Initial Setup
The very first step is to make the MANET as de-centralized as possible, i.e., the
role of the dealer has to be played by nodes themselves.
Let N be the initial set of k founding nodes in the MANET, t be the threshold
for t ≤ k. Every founding node ni ∈ N chooses a bi-variate polynomial, symmetric
in x, z with the degree of x and z being t−1, where t is the threshold number. Every
node ni ∈ N obtains its partial secret si by implementing Shamir secret sharing
scheme. The protocol also supports new nodes joining the network, by obtaining
their respective partial share. The complete step by step procedure is described in
the next section Key Distribution
3.2 Key Distribution
Every node ni ∈ N which is part of the MANET receives partial share si of the
actual secret s. This is achieved using the following protocol.
1. Every founding node ni ∈ N chooses a bi-variate polynomial Fi(x, z) ∈ Zq[x, z],
symmetric in x, z and the degree of x and z is at most t − 1, where t is the
threshold value. These polynomials implicitly define a polynomial F(x, z) =
Σni∈N Fi(x, z). Let us denote fi,0 = Fi(0, 0) the constant term of polynomial
Fi(x, z) and s =
k
i=1
fi,0 = F(0, 0) the constant term of F(x, z).
2. Every node ni ∈ N computes and secretly sends to all other nodes nj ∈ N the
univariate polynomial Fij(x) = Fi(x, h(nj), along with the value Yi = Fi(0, 0)∗Q
(where Q is the generator of Group G).
3. Finally every node nj has values received from other k-1 nodes and also has
it’s own value Fjj(x, h(nj)) with it. Then every node nj ∈ N computes Sj(x) =
k
j=1
Fij(x) =
k
j=1
Fi(x, h(nj) = F(x, h(nj))
4. Now every node njnN has a share sj = Sj(0) = F(0, h(nj) of implicit MANET
secret s = F(0, 0) and a secret univariate polynomial of its own Si(x).
76
9. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.1, January 2018
5. The public key PK of the MANET is made public by each node in MANET.
This public key is computed by each node in MANET with the help of the
information acquired from the rest of the nodes in the initial setup. The public
key is given as PK = Σi∈N Fi(0) ∗ Q = s ∗ Q
The MANET secret function F(x, z) =
k
i=1
Fi(x, z) and MANET secret key
s = F(0, 0) are safe and hidden as they are implicit and not known to any particular
node. The reconstruction of the secret takes place if any only if minimum of t
nodes possessing the partial secret of the actual MANET secret come together.
Key distribution process is depicted in Figure 4. The shares of the nodes can be
frequently updated by using the concept of proactive secret sharing as discussed in
[19].
3.3 Computing a Secret Key
If the nodes ni, nj ∈ N want to communicate securely then they need a common
secret key, which is used for both encryption and decryption. The nodes follow
the Diffie Hellman Key exchange algorithm discussed in section 2.2.2 to compute
the secret key. They use the following protocol: The General Algorithm for Diffie
Hellman is as follows:
1. ni and nj choose random numbers a, b ∈ Zq.
2. ni sends a point A = a ∗ Q (where Q is the generator of Group G) and nj sends
B = b ∗ Q to ni
3. ni computes a point R = a∗B = a∗b∗Q and nj computes R = b∗A = a∗b∗Q.
4. Both ni and nj have same secret point R = E(Rx, Ry) where RxandRy represent
x and y coordinate of the point R. The secret key sk is computed as sk =
Rx + Ry.
3.4 Secure Communication
Once the nodes ni, nj ∈ N have a common secret key sk then they communicate
securely using TEA algorithm discussed in section 2.3.1.
4 Example
The MANET setup is similar to Chaitanya et al. discussed in [18].
– Setup
– Let the intial set of nodes N = {N1, N2, N3, N4}
No. of Nodes = l = 4
77
10. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.1, January 2018
Fig. 4. Key Distribution process
78
11. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.1, January 2018
– Public Parmeters :
An additive group G is selected with the prime order q = 83.
- The curve used is E(F83) : y2 = x3 + 1
- The Generator is Q = E(38,50)
- Let t = 3.
– A collision resistant hash function - HTR
– Each node selects a random bivariate polynomial in GF(83)
N1 = 3x2z + 3z2x + 8xz + 5z + 5x + 5
N2 = 5x2z + 5z2x + 3xz + 8z + 8x + 9
N3 = 8x2z + 8z2x + 5xz + 3z + 3x + 6
N4 = 2x2z + 2z2x + 4xz + 8z + 8x + 4
– The polynomial implicitly defined by all the nodes is
F(x,z) = N1 + N2 + N3 + N4
= 18x2z + 18xz2 + 20xz + 24x + 24z + 24
– The MANET secret s F(0,0) = 24.
– Each node secretly sends to each of other founding nodes the univariate poly-
nomial Fij = Fi(x, h(Nj)).
– The hash function used is given below:
def HTR(id,p):
h = int(hashlib.sha224(str(id)).hexdigest(),16)
val = mod(h,p)
return val
– The hash values of the nodes are
hn1 = HTR( Node1 , k) = 21
hn2 = HTR( Node2 , k) = 57
hn3 = HTR( Node3 , k) = 63
hn4 = HTR( Node4 , k) = 31
– Share Distribution
– Each node sends the following values to other Nodes :
– N1 also includes Y1 = 5 * Q = (18,43)
N11 = 63x2 + 2x + 27
N12 = 5x2 − x + 41
N13 = 23x2 + 49x + 71
N14 = 10x2 + 65x + 77
– N2 also includes Y2 = 9 * Q = (57,41)
N21 = 22x2 + 35x + 11
N22 = 36x2 + 73x + 50
N23 = 66x2 + 39x + 15
N24 = 72x2 + 9x + 8
79
12. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.1, January 2018
– N3 also includes Y3 = 6 * Q = (68,64)
N31 = 2x2 + 67x + 69
N32 = 41x2 + 52x + 11
N33 = 6x2 + 32x + 29
N34 = −x2 + 44x + 16
– N4 also includes Y4 = 4 * Q = (48,55)
N41 = 42x2 + 61x + 6
N42 = 31x2 + 11x + 45
N43 = 43x2 + 64x + 10
N44 = 62x2 + 62x + 3
– Then from the received values all the nodes calculate their secret univariate
polynomial.
– S1(x) = 46x2 − x + 30
– S2(x) = 30x2 + 52x + 64
– S3(x) = −28 ∗ x2 + 18 ∗ x − 41
– S4(x) = −23 ∗ x2 + 14 ∗ x + 21
– The public key, PK = s * Q
= 24 * E(38,50) = E(11,81)
– PK should also be equal to Y1 + Y2 + Y3 + Y4
=E(18,43)+E(57,41)+E(68,64)+E(48,55)
= E(11,81)
– Each node computes its share from Si(0).
The shares of the nodes are
S1 = 30, S2 = 64, S3 = 42, S4 = 21
– If n1 and n2 wants to communicate securely then they compute a common secret
key using their shares.
– n1 sends S1 ∗ Q = 30 ∗ E(38, 50) = E(35, 31) to n2.
– n2 sends S2 ∗ Q = 64 ∗ E(38, 50) = E(50, 70) to n1.
– Both n1 and n2 computes the same secret point. At n1, 30∗E(50, 70) = E(6, 47)
at n2,64 ∗ E(35, 31) = E(6, 47).
– Now both n1 and n2 have a secret key 53, which they use for encryption and
decryption.
– If n1 wants to send a message ”hello” to n2 using TEA, then it sends the cipher
text [’0x95c88604’, ’0x1745f2d7’].
– Then n2 decrypts the cipher text to message ”hello” using the key 53.
5 Security Analysis
The TEA algorithm is prone to key equivalence attack as discussed below:Key
equivalence Attack:This attack on TEA is done by using Known plain/cipher text
pairs of any unknown key (K). The general idea of the attack is that the key in TEA
80
13. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.1, January 2018
is divided into four 32 bits (key=K[0], K[1],K[2],K[3]) and for one half of the plain
text K[0],K[1] are used and K[2],K[3] for another half. So, if we find the value of K[0]
then we can find K[1] (same with other half) becauseR[i + 1] = L[i] + (((R[i] <<
4)+K[0])⊕((R[i] >> 5)+K[1])⊕(R[i]+Delta))). As all values are known we need to
guess the value of K[0] starting from zero.and calculate k[1] for the first and second
plain text/cipher text pairs. If the these two values do not match then increment
the value of K[0] and proceed form the beginning. If they match then verify whether
this guess of K[0] is correct by checking K[1] for other plain text/cipher text pairs.
If the value of K[1] matched every time then this is the correct guess for K[0] and
the key is found. But we can avoid this attack in MANETs by adopting proactive
secret sharing techniques, where the nodes periodically update their shares thus
not giving enough time to the attacker to find the equivalent keys.
6 Conclusion
In this paper, we proposed the use of lightweight cryptography algorithm in MANETs.
As MANETs have less computation power, they can not use traditional cryptogra-
phy algorithms because of heavy computations. In our MANET setup, first all the
nodes have a share of MANET private key and they use this share to generate a
secret key using Diffie Hellman key exchange. Then they use the secret key with
the TEA algorithm to encrypt/decrypt messages. We also discussed that the gen-
eral key equivalence attack of TEA can be avoided by adopting to proactive secret
sharing.
References
1. F. Anjum and P. Mouchtaris, ”Security for wireless ad hoc networks”, in: Wiley-Blackwell,
Mar. 2007.
2. Chai-Keong Toh (2002). ”Ad Hoc Mobile Wireless Networks: Protocols and Systems 1st Edi-
tion”, in: Prentice Hall PTR. Retrieved 2016-04-20.
3. Vanesa Daza, Javier Herranz, Paz Morillo, Carla Rafols, ”Cryptographic techniques for mobile
ad-hoc networks,” in: Computer Networks, Volume 51, Issue 18, 19 December 2007, Pages
4938-4950.
4. Y.-C. Hu, A. Perrig, and D. B. Johnson. Ariadne, ”A secure on-demand routing protocol for
ad hoc networks”, in: Proceedings of the Eighth ACM International Conference on Mobile
Computing and Networking (Mobicom 2002), September 2002.
5. Y.C. Hu, A. Perrig, and D. B. Johnson, ”Packet leashes: A defense against wormhole attacks
in wireless networks”, in: Proceedings of IEEE Infocom 2003,pp. 1976-1986 vol.3.
6. X. Yao, X. Han and X. Du, ”A light-weight certificate-less public key cryptography scheme
based on ECC,” 2014 23rd International Conference on Computer Communication and Net-
works (ICCCN), Shanghai, 2014, pp. 1-8.
7. Rajashekarappa, K M Sunjiv Soyjaudah, Sumithra Devi K A, ”Study on Cryptanalysis of the
Tiny Encryption Algorithm” in: International Journal of Innovative Technology and Exploring
Engineering (IJITEE), vol. 2, issue 3 (2013) pp. 88-91.
8. Y. Amir, Y.Kim, C. Nita-Rotaru, ”Secure communication using contributory key agreement”,
in: IEEE Transactions on Parallel and Distributed systems, pp. 468-480, 2009.
81
14. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.1, January 2018
9. N. Koblitz, ”Elliptic curve cryptosystems,” in: Mathematics of Computation, vol. 48, no.177,
pp.203-209, Jan 1987.
10. G.R. Blakley, Safeguarding cryptographic keys, in: Proceedings of the National Computer
Conference, American Federation of Information, Processing Societies Proceedings, vol. 48,
1979, pp. 313-317.
11. Singh, Nidhi, Appala Naidu Tentu, Abdul Basit, and V. Ch Venkaiah. ”Sequential secret
sharing scheme based on Chinese remainder theorem.” In Computational Intelligence and
Computing Research (ICCIC), 2016 IEEE International Conference on, pp. 1-6. IEEE, 2016.
12. A. Shamir, ”How to share a secret”, in: Communications of the ACM 22 (1979) 612-613.
13. Lidong Zhou and Z. J. Haas, ”Securing ad hoc networks,” in IEEE Network, vol. 13, no. 6,
pp. 24-30, Nov/Dec 1999.
14. Koblitz, Neal. ”Elliptic curve cryptosystems.” in Mathematics of computation 48.177 (1987):
203-209.
15. Miller, Victor S. ”Use of elliptic curves in cryptography.” in: Conference on the Theory and
Application of Cryptographic Techniques, Springer Berlin Heidelberg, 1985.
16. Tentu, Appala Naidu, Abdul Basit, K. Bhavani, and V. Ch Venkaiah. ”Multi-secret Shar-
ing Scheme for Level-Ordered Access Structures.” In International Conference on Number-
Theoretic Methods in Cryptology, pp. 267-278. Springer, Cham, 2017.
17. Feldman, Paul. ”A practical scheme for non-interactive verifiable secret sharing.” in: Founda-
tions of Computer Science, 1987, 28th Annual Symposium on. IEEE, 1987.
18. Kumar, N. Chaitanya, Abdul Basit, Priyadarshi Singh, V. Ch Venkaiah, and Y. V. Rao. ”Node
Authentication Using BLS Signature in Distributed PKI Based MANETS.” arXiv preprint
arXiv:1708.08972 (2017).
19. N. Chaitanya Kumar, Abdul Basit, Priyadarshi Singh, V. Ch. Venkaiah, ”Proactive Secret
Sharing for Long Lived MANETs Using Elliptic Curve Cryptography”, in: 2017 IEEE In-
ternational Conference on Inventive Computing And Informatics (ICICI 2017), Coimbatore,
India, 2017.(In press)
20. S. A. Yee Hunn, S. Z. binti Md. Naziri and N. binti Idris, ”The development of tiny encryption
algorithm (TEA) crypto-core for mobile systems,” in: 2012 IEEE International Conference on
Electronics Design, Systems and Applications (ICEDSA), Kuala Lumpur, 2012, pp. 45-49.
21. Basit, Abdul, N. Chaitanya Kumar, V. Ch Venkaiah, Salman Abdul Moiz, Appala Naidu
Tentu, and Wilson Naik. ”Multi-stage Multi-secret sharing scheme for hierarchical access struc-
ture.” In Computing, Communication and Automation (ICCCA), 2017 International Confer-
ence on, pp. 557-563. IEEE, 2017.
Authors
N Chaitanya Kumar received M.Tech from JNTU Hyderabad, and he did Bach-
elor degree in computer science. Currently, he is pursuing his PhD in Computer
Science from the University of Hyderabad. His research interests include Informa-
tion security, Cryptography in MANET.
82
15. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.1, January 2018
Abdul Basit received Master of computer application from Jamia Hamdard Uni-
versity New Delhi. He did Bachelor of Science in Information technology from SMU
Gangtok. Currently, he is pursuing his PhD in Computer Science from the Univer-
sity of Hyderabad. His research interests include Information security, Cryptogra-
phy, and Cyber security.
Priyadarshi Singh received M.Tech from IIT(ISM) Dhanbad. He did Bachelor
degree in Information Technology. Currently, he is pursuing his PhD in Computer
Science from the University of Hyderabad. His research interests include Cryptog-
raphy, Public key infrastructure.
V. Ch. Venkaiah obtained his PhD in 1988 from the Indian Institute of Science
(IISc), Bangalore in the area of scientific computing. He worked for several or-
ganisations including the Central Research Laboratory of Bharat Electronics, Tata
Elxsi India Pvt. Ltd., Motorola India Electronics Limited, all in Bangalore. He then
moved onto academics and served IIT, Delhi, IIIT, Hyderabad, and C R Rao Ad-
vanced Institute of Mathematics, Statistics, and Computer Science. He is currently
serving the Hyderabad Central University. He is a vivid researcher. He designed
algorithms for linear programming, subspace rotation and direction of arrival es-
timation, graph coloring, matrix symmetriser, integer factorisation, cryptography,
knapsack problem, etc.
83