This document summarizes a research paper that proposes a new encryption algorithm to improve performance parameters. The algorithm is divided into two phases. Phase 1 involves reversing, swapping, circularly shifting bits of the plaintext and XORing with the key. Phase 2 divides the output into blocks, then recombines the left bits of each block. The paper analyzes avalanche effect and execution time of the proposed algorithm compared to existing algorithms to evaluate its performance. The results show better performance than existing algorithms.
Features of genetic algorithm for plain text encryption IJECEIAES
The data communication has been growing in present day. Therefore, the data encryption became very essential in secured data transmission and storage and protecting data contents from intruder and unauthorized persons. In this paper, a fast technique for text encryption depending on genetic algorithm is presented. The encryption approach is achieved by the genetic operators Crossover and mutation. The encryption proposal technique based on dividing the plain text characters into pairs, and applying the crossover operation between them, followed by the mutation operation to get the encrypted text. The experimental results show that the proposal provides an important improvement in encryption rate with comparatively high-speed processing.
Data Encryption and Decryption Algorithm Using Hamming Code and Arithmetic Op...IJERA Editor
This paper explains the implementation of data encryption and decryption algorithm using hamming code and arithmetic operations with the help of Verilog HDL. As the days are passing the old algorithms are not remained so strong cryptanalyst are familiar with them. Hamming code is one of forward error correcting code which has got many applications. In this paper hamming code algorithm was discussed and the implementation of it was done with arithmetic operations. For high security some arithmetic operations are added with hamming code process. A 3-bit data will be encrypted as 14-bit and using decryption process again we will receives 3-bit original data. The implemented design was tested on Spartan3A FPGA kit.
Application of Game Theory to Select the Most Suitable Cryptographic Algorith...AJSERJournal
The cryptographic systems used in an organization use a fixed cryptographic algorithm and the specific
procedures of that system. Due to the fact that the algorithm is fixed in these systems, the probability of failure or
success of such systems depends on human resources, hardware resources and work environment so that it can be said
that the probability of success or the failure of these systems is 50%. Also, in this kind of systems, there are no other
algorithms based on the needs of the user. This research addresses the question of how we can use multiple
asymmetric algorithms in a cryptographic system that does not defeat the algorithm by the opponent. In this research,
selection of algorithms based on some environmental parameters and the possibility of breaking the algorithm by the
opponent should be selected. This will be done using game theory. The problem is modeled as a model of solvable
problems by game theory and generated outputs will be use by Gambit software which is especial for Game theory. The
results obtained from this study indicate the ease of choosing the algorithm based on the need and with regard to the
attack on the opponent and how to reduce the likelihood of breaking the algorithm
A New Method for Encrypting Digital Data Using Symmetric Key in Information E...Editor IJCATR
with the arrival of the information age and much more important information systems and communication in human
everyday life, necessity immunization information and communication strategy were also raised. The easiest way to meet this
necessity is conventional encryption algorithms. Encryption is a right tool for data protection in an unsecure channel. To this end, from
two-method symmetric key encryption and public-key cryptography are used. In this paper we examine text cryptography, one of the
most important topics in cryptography. A unique attribute of this kind of encryption has been of interest to many researchers in this
field. This paper, considering the symmetric encryption algorithm, provides a text encryption algorithm using a 128-bit key. The
proposed algorithm uses a 128-bit key, the text data using the XOR operator to convert the encrypted information. Therefore, the aim
of this method is to provide a convenient method for symmetrically encrypting data not to be easily decoded, and finally, the results of
the tests show that the proposed method is better in terms of security and speed of execution
Security analysis of fbdk block cipher for digital imageseSAT Journals
Abstract Network security is one of the major concerns in the modern world. In this regard, a strong security technique is required to protect user data. Cryptography techniques plays an important role in secured transmission through encryption of data and thus ensuring integrity, authenticity, confidentiality of information. Several encryption algorithms have been proposed like AES (Advanced Encryption Standard), DES (Data Encryption Standard) and RSA. These provide very good encryption for text applications. However, these encryption schemes appear not to be ideal for image applications. Some algorithms like GKSBC and RC6 provide very good encryption for digital images. New techniques are emerging that are aimed at providing secured transmission of images over networks. The FBDK (Fixed Block with Dynamic Key Size) block cipher is a new cryptography technique designed using simple operations like XOR, substitutions, circular shifting. The FBDK algorithm is applicable for blocks of any size with key size being dynamic for each block. It does not involve any complex mathematical operations like modular exponentiation. It is a hybrid cryptography technique based on symmetric key and asymmetric key cryptosystems. This paper investigates the security of FBDK block cipher for digital images against brute-force attack, statistical analysis and Differential analysis attacks. In this paper, various security analysis tests has been discussed which are helpful in finding out whether the FBDK encryption algorithm can do secure encryption or not. Experimental results proves the security and efficiency of FBDK cipher for images against all aforementioned types of attacks which justifies its consideration for real time image applications. Keywords: Cryptography, Ciphers, Encryption, Security, and cryptanalysis.
Features of genetic algorithm for plain text encryption IJECEIAES
The data communication has been growing in present day. Therefore, the data encryption became very essential in secured data transmission and storage and protecting data contents from intruder and unauthorized persons. In this paper, a fast technique for text encryption depending on genetic algorithm is presented. The encryption approach is achieved by the genetic operators Crossover and mutation. The encryption proposal technique based on dividing the plain text characters into pairs, and applying the crossover operation between them, followed by the mutation operation to get the encrypted text. The experimental results show that the proposal provides an important improvement in encryption rate with comparatively high-speed processing.
Data Encryption and Decryption Algorithm Using Hamming Code and Arithmetic Op...IJERA Editor
This paper explains the implementation of data encryption and decryption algorithm using hamming code and arithmetic operations with the help of Verilog HDL. As the days are passing the old algorithms are not remained so strong cryptanalyst are familiar with them. Hamming code is one of forward error correcting code which has got many applications. In this paper hamming code algorithm was discussed and the implementation of it was done with arithmetic operations. For high security some arithmetic operations are added with hamming code process. A 3-bit data will be encrypted as 14-bit and using decryption process again we will receives 3-bit original data. The implemented design was tested on Spartan3A FPGA kit.
Application of Game Theory to Select the Most Suitable Cryptographic Algorith...AJSERJournal
The cryptographic systems used in an organization use a fixed cryptographic algorithm and the specific
procedures of that system. Due to the fact that the algorithm is fixed in these systems, the probability of failure or
success of such systems depends on human resources, hardware resources and work environment so that it can be said
that the probability of success or the failure of these systems is 50%. Also, in this kind of systems, there are no other
algorithms based on the needs of the user. This research addresses the question of how we can use multiple
asymmetric algorithms in a cryptographic system that does not defeat the algorithm by the opponent. In this research,
selection of algorithms based on some environmental parameters and the possibility of breaking the algorithm by the
opponent should be selected. This will be done using game theory. The problem is modeled as a model of solvable
problems by game theory and generated outputs will be use by Gambit software which is especial for Game theory. The
results obtained from this study indicate the ease of choosing the algorithm based on the need and with regard to the
attack on the opponent and how to reduce the likelihood of breaking the algorithm
A New Method for Encrypting Digital Data Using Symmetric Key in Information E...Editor IJCATR
with the arrival of the information age and much more important information systems and communication in human
everyday life, necessity immunization information and communication strategy were also raised. The easiest way to meet this
necessity is conventional encryption algorithms. Encryption is a right tool for data protection in an unsecure channel. To this end, from
two-method symmetric key encryption and public-key cryptography are used. In this paper we examine text cryptography, one of the
most important topics in cryptography. A unique attribute of this kind of encryption has been of interest to many researchers in this
field. This paper, considering the symmetric encryption algorithm, provides a text encryption algorithm using a 128-bit key. The
proposed algorithm uses a 128-bit key, the text data using the XOR operator to convert the encrypted information. Therefore, the aim
of this method is to provide a convenient method for symmetrically encrypting data not to be easily decoded, and finally, the results of
the tests show that the proposed method is better in terms of security and speed of execution
Security analysis of fbdk block cipher for digital imageseSAT Journals
Abstract Network security is one of the major concerns in the modern world. In this regard, a strong security technique is required to protect user data. Cryptography techniques plays an important role in secured transmission through encryption of data and thus ensuring integrity, authenticity, confidentiality of information. Several encryption algorithms have been proposed like AES (Advanced Encryption Standard), DES (Data Encryption Standard) and RSA. These provide very good encryption for text applications. However, these encryption schemes appear not to be ideal for image applications. Some algorithms like GKSBC and RC6 provide very good encryption for digital images. New techniques are emerging that are aimed at providing secured transmission of images over networks. The FBDK (Fixed Block with Dynamic Key Size) block cipher is a new cryptography technique designed using simple operations like XOR, substitutions, circular shifting. The FBDK algorithm is applicable for blocks of any size with key size being dynamic for each block. It does not involve any complex mathematical operations like modular exponentiation. It is a hybrid cryptography technique based on symmetric key and asymmetric key cryptosystems. This paper investigates the security of FBDK block cipher for digital images against brute-force attack, statistical analysis and Differential analysis attacks. In this paper, various security analysis tests has been discussed which are helpful in finding out whether the FBDK encryption algorithm can do secure encryption or not. Experimental results proves the security and efficiency of FBDK cipher for images against all aforementioned types of attacks which justifies its consideration for real time image applications. Keywords: Cryptography, Ciphers, Encryption, Security, and cryptanalysis.
A new hybrid text encryption approach over mobile ad hoc network IJECEIAES
Data exchange has been rapidly increased recently by increasing the use of mobile networks. Sharing information (text, image, audio and video) over unsecured mobile network channels is liable for attacking and stealing. Encryption techniques are the most suitable methods to protect information from hackers. Hill cipher algorithm is one of symmetric techniques, it has a simple structure and fast computations, but weak security because sender and receiver need to use and share the same private key within a non-secure channel. Therefore, a novel hybrid encryption approach between elliptic curve cryptosystem and hill cipher (ECCHC) is proposed in this paper to convert Hill Cipher from symmetric technique (private key) to asymmetric one (public key) and increase its security and efficiency and resist the hackers. Thus, no need to share the secret key between sender and receiver and both can generate it from the private and public keys. Therefore, the proposed approach presents a new contribution by its ability to encrypt every character in the 128 ASCII table by using its ASCII value direct without needing to assign a numerical value for each character. The main advantages of the proposed method are represented in the computation simplicity, security efficiency and faster computation.
A Survey on Different Data Hiding Techniques in Encrypted Imagesijsrd.com
In this paper, we are going to have survey on different data hiding techniques and our main focus is on†Reversible data hiding in encrypted imagesâ€Â. In recent year the security of the sensitive data has become of prime and supreme importance and concern. To protect this data or secret information from unauthorized person we use many data hiding techniques like stegnography, cryptography and RDH. In this paper we will discuss on one such data hiding technique called Reversible Data Hiding (RDH). In this instead of embedding data in encrypted images directly, some pixels are estimated before encryption so that additional data can be embedded in the estimating errors. Without the encryption key, one cannot get access to the original image. A RC4 algorithm is applied on the rest pixels of the image and a special encryption scheme is designed to encrypt the estimating errors.Our paper presents a survey on various data hiding techniques and their comparative analysis.
Ciphering algorithms play a main role in information security systems. Therefore in this paper we are
considering the important performance of these algorithms like CPU time consumption, memory usage and
battery usage. This research tries to demonstrate a fair comparison between the most common algorithms
and with a novel method called Secured Watermark System (SWS) in data encryption field according to
CPU time, packet size and power consumption. It provides a comparison the most known algorithms used
in encryption: AES (Rijndael), DES, Blowfish, and Secured Watermark System (SWS).
For comparing these algorithms with each other variations of data block sizes, and a variation of
encryption-decryption speeds where used in this research.
In addition a comparison with different platforms such as Windows 8, Windows XP and Linux has been
conducted. Finally the results of the experimentation demonstrate the performance and efficiency of the
compared encryption algorithms with different parameters.
Improving Cloud Security Using Multi Level Encryption and AuthenticationAM Publications,India
As people have become more social and electronically attached, the concern for information sharing over the internet still persist. As known many powerful cryptographical approaches have been proposed in the past which are practically impossible to break, yet there exists a major concern of total encryption and decryption time taken as a whole. It is a known fact that in encrypting a large chunk of data, traditional asymmetric key algorithm may be slower to symmetric key algorithm by 1000 times or more. Hence this paper proposes a hierarchical structure in which the parties are first authenticated, then exchange keys by asymmetric key algorithm, then do actual encryption and decryption by the symmetric key algorithm. This will be useful to improve the security in cloud applications.
Genetic algorithm based key generation for fully homomorphic encryptionMajedahAlkharji
This article describes a method to use Genetic Algorithm to generate keys for the fully homomorphic encryption scheme. Then perform some simple computations on the encrypted data.
Results show that a GA generated key provides more randomness than other conventional methods used to generate public and private keys.
Comparative Analysis of Cryptographic Algorithms and Advanced Cryptographic A...editor1knowledgecuddle
Today is the era of Internet and networks applications. So,Information security is a challenging issue in today’s technological world. There is a demand for a stronger encryption which is very hard to crack. The role of Cryptography is most important in the field of network security. There is a broad range of cryptographic algorithms that are used for securing networks and presently continuous researches on the new cryptographic algorithms are going on for evolving more advanced techniques for secures
communication. In this study is made for the cryptography algorithms, particularly algorithms- AES, DES, RSA, Blowfishare compared and performance is evaluated. Also some enhanced algorithms are described and compared with the enhanced algorithms.
Keywords - AES, DES, BLOWFISH, Decryption, Encryption, Security
survey paper on object oriented cryptographic security for runtime entitiesINFOGAIN PUBLICATION
With the advent of complex systems the need for large data storage with less space utility & high performance have become the vital features. Another important concern of the data is the security which is assured via the cryptographic techniques implemented at all levels of data storage. In this survey paper we introduce the concept of security between two hierarchical data accesses and propose the concept of hierarchical cryptography between data of different classes of different hierarchies.
PERFORMANCE ANALYSIS OF PARALLEL IMPLEMENTATION OF ADVANCED ENCRYPTION STANDA...ijistjournal
Cryptography is the study of mathematical techniques related to aspects of information security such as confidentiality, data integrity, entity authentication, and data origin authentication. Most cryptographic algorithms function more efficiently when implemented in hardware than in software running on single processor. However, systems that use hardware implementations have significant drawbacks: they are unable to respond to flaws discovered in the implemented algorithm or to changes in standards. As an alternative, it is possible to implement cryptographic algorithms in software running on multiple processors. However, most of the cryptographic algorithms like DES (Data Encryption Standard) or 3DES have some drawbacks when implemented in software: DES is no longer secure as computers get more powerful while 3DES is relatively sluggish in software. AES (Advanced Encryption Standard), which is rapidly being adopted worldwide, provides a better combination of performance and enhanced network security than DES or 3DES by being computationally more efficient than these earlier standards. Furthermore, by supporting large key sizes of 128, 192, and 256 bits, AES offers higher security against brute-force attacks.
In this paper, AES has been implemented with single processor. Then the result has been compared with parallel implementations of AES with 2 varying different parameters such as key size, number of rounds and extended key size, and show how parallel implementation of the AES offers better performance yet flexible enough for cryptographic algorithms.
Different date block size using to evaluate the performance between different...IJCNCJournal
The different computer networks whether wired or wireless are becoming more popular with its high
security aspect. Different security algorithms and technique are using to avoid any aforementioned attacks.
One of these technique is a cryptography technique that makes the data as unreadable during the transfer
hence; there is no chance to reclaim the information. Presently, most of the users are using various media
types and internet to transfer the data but, it has the chance to retrieve the data by using these media types.
The perfect solution for this problem is to provide security on time-to-time basis; this stage is always
significant to the security related community discussions. This paper explains the comparison between the
run time of three different encryption algorithms which are DES, AES and Blowfish The compression
includes using different modes, data block size and different operation modes. As a result, Blowfish
algorithm followed by AES take less time for running compared to DES.
Comparison of Secret Splitting, Secret Sharing and Recursive Threshold Visual...TELKOMNIKA JOURNAL
The secret sharing is a method to protect confidentiality and integrity of the secret messages by distributing the message shares into several recipients. The secret message could not be revealed unless the recipients exchange and collect shares to reconstruct the actual message. Even though the attacker obtain shares shadow during the share exchange, it would be impossible for the attacker to understand the correct share. There are few algorithms have been developed for secret sharing, e.g. secret splitting, Asmuth-Bloom secret sharing protocol, visual cryptography, etc. There is an unanswered question in this research about which method provides best level of security and efficiency in securing message. In this paper, we evaluate the performance of three methods, i.e. secret splitting, secret sharing, and recursive threshold visual cryptography for handwritten image security in terms of execution time and mean squared error (MSE) simulation. Simulation results show the secret splitting algorithm produces the shortest time of execution. On the other hand, the MSE simulation result that the three methods can reconstruct the original image very well.
Comparative Study of Cryptography Algorithms and Its’ ApplicationsMahmudJion
In modern world, security is the most valuable term in the field of communication system. Security comes
along with many technologies and methods, where one of the most secure technologies is Cryptography
where ordinary plain text is converted into cipher text for transferring data to the valid user. Cryptography
algorithms can be divided into two types based on the number of keys such as Symmetric and Asymmetric
where Symmetric algorithm works with one single key and Asymmetric algorithm works with two different
keys. However, selecting the appropriate algorithms for specific application has been always a challenging
task because of the latency, key size, and security issues. Cryptographic algorithms face different type of
attacks like brute force attack, man in the middle attack, cycle attacks etc., which are still remained as
threads. This paper presents the performance analysis, based on different performance metrics and threads,
of various techniques of cryptographic algorithms and identifies the suitable algorithms for different types
of applications.
Improved Image Encryption for Real-Time Application over Wireless Communicati...ijeei-iaes
Advances in communication networks have enabled organization to send confidential data such as digital images over wireless networks. However, the broadcast nature of wireless communication channel has made it vulnerable to attack from eavesdroppers. We have developed a hybrid cryptography technique, and we present its application to digital images as a means of improving the security of digital image for transmission over wireless communication networks. The hybrid technique uses a combination of a symmetric (Data Encryption Standard) and asymmetric (Rivest Shamir Adleman) cryptographic algorithms to secure data to be transmitted between different nodes of a wireless network. Three different image samples of type jpeg, png and jpg were tested using this technique. The results obtained showed that the hybrid system encrypt the images with minimal simulation time, and high throughput. More importantly, there is no relation or information between the original images and their encrypted form, according to Shannon’s definition of perfect security, thereby making the system much more secure.
A new hybrid text encryption approach over mobile ad hoc network IJECEIAES
Data exchange has been rapidly increased recently by increasing the use of mobile networks. Sharing information (text, image, audio and video) over unsecured mobile network channels is liable for attacking and stealing. Encryption techniques are the most suitable methods to protect information from hackers. Hill cipher algorithm is one of symmetric techniques, it has a simple structure and fast computations, but weak security because sender and receiver need to use and share the same private key within a non-secure channel. Therefore, a novel hybrid encryption approach between elliptic curve cryptosystem and hill cipher (ECCHC) is proposed in this paper to convert Hill Cipher from symmetric technique (private key) to asymmetric one (public key) and increase its security and efficiency and resist the hackers. Thus, no need to share the secret key between sender and receiver and both can generate it from the private and public keys. Therefore, the proposed approach presents a new contribution by its ability to encrypt every character in the 128 ASCII table by using its ASCII value direct without needing to assign a numerical value for each character. The main advantages of the proposed method are represented in the computation simplicity, security efficiency and faster computation.
A Survey on Different Data Hiding Techniques in Encrypted Imagesijsrd.com
In this paper, we are going to have survey on different data hiding techniques and our main focus is on†Reversible data hiding in encrypted imagesâ€Â. In recent year the security of the sensitive data has become of prime and supreme importance and concern. To protect this data or secret information from unauthorized person we use many data hiding techniques like stegnography, cryptography and RDH. In this paper we will discuss on one such data hiding technique called Reversible Data Hiding (RDH). In this instead of embedding data in encrypted images directly, some pixels are estimated before encryption so that additional data can be embedded in the estimating errors. Without the encryption key, one cannot get access to the original image. A RC4 algorithm is applied on the rest pixels of the image and a special encryption scheme is designed to encrypt the estimating errors.Our paper presents a survey on various data hiding techniques and their comparative analysis.
Ciphering algorithms play a main role in information security systems. Therefore in this paper we are
considering the important performance of these algorithms like CPU time consumption, memory usage and
battery usage. This research tries to demonstrate a fair comparison between the most common algorithms
and with a novel method called Secured Watermark System (SWS) in data encryption field according to
CPU time, packet size and power consumption. It provides a comparison the most known algorithms used
in encryption: AES (Rijndael), DES, Blowfish, and Secured Watermark System (SWS).
For comparing these algorithms with each other variations of data block sizes, and a variation of
encryption-decryption speeds where used in this research.
In addition a comparison with different platforms such as Windows 8, Windows XP and Linux has been
conducted. Finally the results of the experimentation demonstrate the performance and efficiency of the
compared encryption algorithms with different parameters.
Improving Cloud Security Using Multi Level Encryption and AuthenticationAM Publications,India
As people have become more social and electronically attached, the concern for information sharing over the internet still persist. As known many powerful cryptographical approaches have been proposed in the past which are practically impossible to break, yet there exists a major concern of total encryption and decryption time taken as a whole. It is a known fact that in encrypting a large chunk of data, traditional asymmetric key algorithm may be slower to symmetric key algorithm by 1000 times or more. Hence this paper proposes a hierarchical structure in which the parties are first authenticated, then exchange keys by asymmetric key algorithm, then do actual encryption and decryption by the symmetric key algorithm. This will be useful to improve the security in cloud applications.
Genetic algorithm based key generation for fully homomorphic encryptionMajedahAlkharji
This article describes a method to use Genetic Algorithm to generate keys for the fully homomorphic encryption scheme. Then perform some simple computations on the encrypted data.
Results show that a GA generated key provides more randomness than other conventional methods used to generate public and private keys.
Comparative Analysis of Cryptographic Algorithms and Advanced Cryptographic A...editor1knowledgecuddle
Today is the era of Internet and networks applications. So,Information security is a challenging issue in today’s technological world. There is a demand for a stronger encryption which is very hard to crack. The role of Cryptography is most important in the field of network security. There is a broad range of cryptographic algorithms that are used for securing networks and presently continuous researches on the new cryptographic algorithms are going on for evolving more advanced techniques for secures
communication. In this study is made for the cryptography algorithms, particularly algorithms- AES, DES, RSA, Blowfishare compared and performance is evaluated. Also some enhanced algorithms are described and compared with the enhanced algorithms.
Keywords - AES, DES, BLOWFISH, Decryption, Encryption, Security
survey paper on object oriented cryptographic security for runtime entitiesINFOGAIN PUBLICATION
With the advent of complex systems the need for large data storage with less space utility & high performance have become the vital features. Another important concern of the data is the security which is assured via the cryptographic techniques implemented at all levels of data storage. In this survey paper we introduce the concept of security between two hierarchical data accesses and propose the concept of hierarchical cryptography between data of different classes of different hierarchies.
PERFORMANCE ANALYSIS OF PARALLEL IMPLEMENTATION OF ADVANCED ENCRYPTION STANDA...ijistjournal
Cryptography is the study of mathematical techniques related to aspects of information security such as confidentiality, data integrity, entity authentication, and data origin authentication. Most cryptographic algorithms function more efficiently when implemented in hardware than in software running on single processor. However, systems that use hardware implementations have significant drawbacks: they are unable to respond to flaws discovered in the implemented algorithm or to changes in standards. As an alternative, it is possible to implement cryptographic algorithms in software running on multiple processors. However, most of the cryptographic algorithms like DES (Data Encryption Standard) or 3DES have some drawbacks when implemented in software: DES is no longer secure as computers get more powerful while 3DES is relatively sluggish in software. AES (Advanced Encryption Standard), which is rapidly being adopted worldwide, provides a better combination of performance and enhanced network security than DES or 3DES by being computationally more efficient than these earlier standards. Furthermore, by supporting large key sizes of 128, 192, and 256 bits, AES offers higher security against brute-force attacks.
In this paper, AES has been implemented with single processor. Then the result has been compared with parallel implementations of AES with 2 varying different parameters such as key size, number of rounds and extended key size, and show how parallel implementation of the AES offers better performance yet flexible enough for cryptographic algorithms.
Different date block size using to evaluate the performance between different...IJCNCJournal
The different computer networks whether wired or wireless are becoming more popular with its high
security aspect. Different security algorithms and technique are using to avoid any aforementioned attacks.
One of these technique is a cryptography technique that makes the data as unreadable during the transfer
hence; there is no chance to reclaim the information. Presently, most of the users are using various media
types and internet to transfer the data but, it has the chance to retrieve the data by using these media types.
The perfect solution for this problem is to provide security on time-to-time basis; this stage is always
significant to the security related community discussions. This paper explains the comparison between the
run time of three different encryption algorithms which are DES, AES and Blowfish The compression
includes using different modes, data block size and different operation modes. As a result, Blowfish
algorithm followed by AES take less time for running compared to DES.
Comparison of Secret Splitting, Secret Sharing and Recursive Threshold Visual...TELKOMNIKA JOURNAL
The secret sharing is a method to protect confidentiality and integrity of the secret messages by distributing the message shares into several recipients. The secret message could not be revealed unless the recipients exchange and collect shares to reconstruct the actual message. Even though the attacker obtain shares shadow during the share exchange, it would be impossible for the attacker to understand the correct share. There are few algorithms have been developed for secret sharing, e.g. secret splitting, Asmuth-Bloom secret sharing protocol, visual cryptography, etc. There is an unanswered question in this research about which method provides best level of security and efficiency in securing message. In this paper, we evaluate the performance of three methods, i.e. secret splitting, secret sharing, and recursive threshold visual cryptography for handwritten image security in terms of execution time and mean squared error (MSE) simulation. Simulation results show the secret splitting algorithm produces the shortest time of execution. On the other hand, the MSE simulation result that the three methods can reconstruct the original image very well.
Comparative Study of Cryptography Algorithms and Its’ ApplicationsMahmudJion
In modern world, security is the most valuable term in the field of communication system. Security comes
along with many technologies and methods, where one of the most secure technologies is Cryptography
where ordinary plain text is converted into cipher text for transferring data to the valid user. Cryptography
algorithms can be divided into two types based on the number of keys such as Symmetric and Asymmetric
where Symmetric algorithm works with one single key and Asymmetric algorithm works with two different
keys. However, selecting the appropriate algorithms for specific application has been always a challenging
task because of the latency, key size, and security issues. Cryptographic algorithms face different type of
attacks like brute force attack, man in the middle attack, cycle attacks etc., which are still remained as
threads. This paper presents the performance analysis, based on different performance metrics and threads,
of various techniques of cryptographic algorithms and identifies the suitable algorithms for different types
of applications.
Improved Image Encryption for Real-Time Application over Wireless Communicati...ijeei-iaes
Advances in communication networks have enabled organization to send confidential data such as digital images over wireless networks. However, the broadcast nature of wireless communication channel has made it vulnerable to attack from eavesdroppers. We have developed a hybrid cryptography technique, and we present its application to digital images as a means of improving the security of digital image for transmission over wireless communication networks. The hybrid technique uses a combination of a symmetric (Data Encryption Standard) and asymmetric (Rivest Shamir Adleman) cryptographic algorithms to secure data to be transmitted between different nodes of a wireless network. Three different image samples of type jpeg, png and jpg were tested using this technique. The results obtained showed that the hybrid system encrypt the images with minimal simulation time, and high throughput. More importantly, there is no relation or information between the original images and their encrypted form, according to Shannon’s definition of perfect security, thereby making the system much more secure.
Design Issues for Search Engines and Web Crawlers: A ReviewIOSR Journals
Abstract: The World Wide Web is a huge source of hyperlinked information contained in hypertext documents.
Search engines use web crawlers to collect these web documents from web for storage and indexing. The prompt
growth of the World Wide Web has posed incomparable challenges for the designers of search engines and web
crawlers; that help users to retrieve web pages in a reasonable amount of time. In this paper, a review on need
and working of a search engine, and role of a web crawler is being presented.
Key words: Internet, www, search engine, types, design issues, web crawlers.
File transfer with multiple security mechanismShubham Patil
The system enhances the security and the data confidentiality between the users and receiver by the two-layer encryption mechanism and the QR code for verification. The system consists of three main components which are very important to providing the security between sender and receiver while transmitting the data
A PPLICATION OF C LASSICAL E NCRYPTION T ECHNIQUES FOR S ECURING D ATA -...IJCI JOURNAL
The process of protecting information by transformi
ng (encrypting) it into an unreadable format is cal
led
cryptography. Only those who possess secret key can
decipher (decrypt) the message into plain text.
Encrypted messages can sometimes be broken by crypt
analysis, also called code breaking, so there is a
need for strong and fast cryptographic methods for
securing the data from attackers. Although modern
cryptography techniques are virtually unbreakable,
sometimes they also tend to attack.
As the Internet, big data, cloud data storage and
other forms of electronic communication become more
prevalent, electronic security is becoming increasi
ngly important. Cryptography is used to protect e-m
ail
messages, credit card information, corporate data,
cloud data and big data so on... So there is a need
for
best and fast cryptographic methods for protecting
the data. In this paper a method is proposed to pro
tect
the data in faster way by using classical cryptogra
phy. The encryption and decryption are done in par
allel
using threads with the help of underlying hardware.
The time taken by sequential and parallel method i
s
analysed
Cryptography technology is a security technique used to change plain text to another shape of data or to
symbols, which is known as the cipher text. Cryptography aims to keep the data secure during its journey
through public networks. Currently, there are many proposed algorithms that provide this service
especially for sensitive data or very important conversations either through mobile or video conferences. In
this paper, an inventive security symmetric algorithm is implemented and evaluated, and its performance is
compared to the AES. The algorithm has four different rounds for each quarter of the key container table,
and each of them serves to shift the table. The algorithm uses the XOR operation, which, being lightweight
and cheap, is very appropriate for use with Real Time Applications. The result shows that the suggested
algorithm spends less time than AES although it has 16 rounds and the numbers used to mix up the table
are big.
IMPLEMENT A NOVEL SYMMETRIC BLOCK CIPHER ALGORITHMijcisjournal
Cryptography technology is a security technique used to change plain text to another shape of data or to symbols, which is known as the cipher text. Cryptography aims to keep the data secure during its journey through public networks. Currently, there are many proposed algorithms that provide this service especially for sensitive data or very important conversations either through mobile or video conferences. In this paper, an inventive security symmetric algorithm is implemented and evaluated, and its performance is compared to the AES. The algorithm has four different rounds for each quarter of the key container table, and each of them serves to shift the table. The algorithm uses the XOR operation, which, being lightweight and cheap, is very appropriate for use with Real Time Applications. The result shows that the suggested algorithm spends less time than AES although it has 16 rounds and the numbers used to mix up the table are big.
A Comparative Study of RSA and ECC and Implementation of ECC on Embedded SystemsAM Publications
A large share of embedded applications are wireless, which makes the communication channel especially vulnerable. The research in the field of ECC is mostly focused on its implementation on application specific systems, which have restricted resources like storage, processing speed and domain specific CPU architecture. The focus of this research is on the implementation of ECC in an embedded iOS application to compare the performance measures obtained in the wireless environment or embedded systems by using elliptic curve cryptography (ECC), with a traditional cryptosystem like RSA.
SYMMETRIC-KEY BASED PRIVACYPRESERVING SCHEME FOR MINING SUPPORT COUNTSacijjournal
In this paper we study the problem of mining support counts using symmetric-key crypto which is more
efficient than previous work. Consider a scenario that each user has an option (like or unlike) of the
specified product, and a third party wants to obtain the popularity of this product. We design a much more
efficient privacy-preserving scheme for users to prevent the loss of the personal interests. Unlike most
previous works, we do not use any exponential or modular algorithms, but we provide a symmetric-key
based method which can also protect the information. Specifically, our protocol uses a third party that
generates a number of matrixes as each user’s key. Then user uses these key to encrypt their data which is
more efficient to obtain the support counts of a given pattern.
In many of today’s computer application needs, faster operation is essential to the efficient implementation
of information security algorithm. RC4 has been used as the data encryption algorithm for many
applications and protocols including the Wi-Fi, Skype, and Bit Torrent to name a few. Several efficient
approaches to the implementation of RC4 have been proposed and we review some of those. More recently
some parallel approaches to faster implementation of RC4 have been presented and we include those in our
survey of efficient approaches to RC4. This paper presents an analysis of available hardware/software
parallel implementations of RC4 symmetric key-based algorithm and some security approaches which
make it more secure.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
The advent of Big Data has presented nee challenges in terms of Data Security. There is an increasing need of research
in technologies that can handle the vast volume of Data and make it secure efficiently. Current Technologies for securing data are
slow when applied to huge amounts of data. This paper discusses security aspect of Big Data.
A PERFORMANCE EVALUATION OF COMMON ENCRYPTION TECHNIQUES WITH SECURE WATERMAR...IJNSA Journal
Ciphering algorithms play a main role in information security systems. Therefore in this paper we are considering the important performance of these algorithms like CPU time consumption, memory usage and battery usage. This research tries to demonstrate a fair comparison between the most common algorithms and with a novel method called Secured Watermark System (SWS) in data encryption field according to CPU time, packet size and power consumption. It provides a comparison the most known algorithms used in encryption: AES (Rijndael), DES, Blowfish, and Secured Watermark System (SWS).
For comparing these algorithms with each other variations of data block sizes, and a variation of encryption-decryption speeds where used in this research.
In addition a comparison with different platforms such as Windows 8, Windows XP and Linux has been conducted. Finally the results of the experimentation demonstrate the performance and efficiency of the compared encryption algorithms with different parameters.
COMPARATIVE ANALYSIS OF DIFFERENT ENCRYPTION TECHNIQUES IN MOBILE AD HOC NETW...IJCNCJournal
In this paper a detailed analysis of Data Encryption Standard (DES), Triple DES (3DES) and Advanced
Encryption Standard (AES) symmetric encryption algorithms in MANET was done using the Network
Simulator 2 (NS-2) in terms of energy consumption, data transfer time, End-to-End delay time and
throughput with varying data sizes. Two simulation models were adopted: the first simulates the network
performance assuming the availability of the common key, and the second simulates the network
performance including the use of the Diffie-Hellman Key Exchange (DHKE) protocol in the key
management phase. The obtained simulation results showed the superiority of AES over DES by 65%, 70%
and 83% in term of the energy consumption, data transfer time, and network throughput respectively. On
the other hand, the results showed that AES is better than 3DES by approximately 90% for all of the
performance metrics. Based on these results the AES was the recommended encryption scheme.
Today information security is a challenging factor that touches a lot of areas, including computers and communications. Message communication is kept secure through cryptography so that an eavesdropper is not able to decipher a transmitted message. One of the oldest and simplest known algorithms for cryptography is the Caesar cipher algorithm. In this paper, three programs based on Java, C++, and Python languages have been developed to implement the Caesar cipher algorithm to aid information security students and help them understand this fundamental algorithm. A code flow chart is used for each program to describe the code’s flow. It also reveals the sequence of steps for the code’s main methods, as well as the relationships between them. Furthermore, various technical descriptions are presented in detail for each of the methods used in both the encoding and the decoding of the messages.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
NEW ALGORITHM FOR WIRELESS NETWORK COMMUNICATION SECURITYijcisjournal
This paper evaluates the security of wireless communication network based on the fuzzy logic in Mat lab. A new algorithm is proposed and evaluated which is the hybrid algorithm. We highlight the valuable assets in designing of wireless network communication system based on network simulator (NS2), which is crucial to protect security of the systems. Block cipher algorithms are evaluated by using fuzzy logics and a hybrid
algorithm is proposed. Both algorithms are evaluated in term of the security level. Logic (AND) is used in the rules of modelling and Mamdani Style is used for the evaluations
Similar to Design and Implementation of New Encryption algorithm to Enhance Performance Parameters (20)
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Albert Hoitingh
In this session I delve into the encryption technology used in Microsoft 365 and Microsoft Purview. Including the concepts of Customer Key and Double Key Encryption.
UiPath Test Automation using UiPath Test Suite series, part 4DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 4. In this session, we will cover Test Manager overview along with SAP heatmap.
The UiPath Test Manager overview with SAP heatmap webinar offers a concise yet comprehensive exploration of the role of a Test Manager within SAP environments, coupled with the utilization of heatmaps for effective testing strategies.
Participants will gain insights into the responsibilities, challenges, and best practices associated with test management in SAP projects. Additionally, the webinar delves into the significance of heatmaps as a visual aid for identifying testing priorities, areas of risk, and resource allocation within SAP landscapes. Through this session, attendees can expect to enhance their understanding of test management principles while learning practical approaches to optimize testing processes in SAP environments using heatmap visualization techniques
What will you get from this session?
1. Insights into SAP testing best practices
2. Heatmap utilization for testing
3. Optimization of testing processes
4. Demo
Topics covered:
Execution from the test manager
Orchestrator execution result
Defect reporting
SAP heatmap example with demo
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Connector Corner: Automate dynamic content and events by pushing a buttonDianaGray10
Here is something new! In our next Connector Corner webinar, we will demonstrate how you can use a single workflow to:
Create a campaign using Mailchimp with merge tags/fields
Send an interactive Slack channel message (using buttons)
Have the message received by managers and peers along with a test email for review
But there’s more:
In a second workflow supporting the same use case, you’ll see:
Your campaign sent to target colleagues for approval
If the “Approve” button is clicked, a Jira/Zendesk ticket is created for the marketing design team
But—if the “Reject” button is pushed, colleagues will be alerted via Slack message
Join us to learn more about this new, human-in-the-loop capability, brought to you by Integration Service connectors.
And...
Speakers:
Akshay Agnihotri, Product Manager
Charlie Greenberg, Host
Generating a custom Ruby SDK for your web service or Rails API using Smithyg2nightmarescribd
Have you ever wanted a Ruby client API to communicate with your web service? Smithy is a protocol-agnostic language for defining services and SDKs. Smithy Ruby is an implementation of Smithy that generates a Ruby SDK using a Smithy model. In this talk, we will explore Smithy and Smithy Ruby to learn how to generate custom feature-rich SDKs that can communicate with any web service, such as a Rails JSON API.
Accelerate your Kubernetes clusters with Varnish CachingThijs Feryn
A presentation about the usage and availability of Varnish on Kubernetes. This talk explores the capabilities of Varnish caching and shows how to use the Varnish Helm chart to deploy it to Kubernetes.
This presentation was delivered at K8SUG Singapore. See https://feryn.eu/presentations/accelerate-your-kubernetes-clusters-with-varnish-caching-k8sug-singapore-28-2024 for more details.
Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...Jeffrey Haguewood
Sidekick Solutions uses Bonterra Impact Management (fka Social Solutions Apricot) and automation solutions to integrate data for business workflows.
We believe integration and automation are essential to user experience and the promise of efficient work through technology. Automation is the critical ingredient to realizing that full vision. We develop integration products and services for Bonterra Case Management software to support the deployment of automations for a variety of use cases.
This video focuses on the notifications, alerts, and approval requests using Slack for Bonterra Impact Management. The solutions covered in this webinar can also be deployed for Microsoft Teams.
Interested in deploying notification automations for Bonterra Impact Management? Contact us at sales@sidekicksolutionsllc.com to discuss next steps.
JMeter webinar - integration with InfluxDB and GrafanaRTTS
Watch this recorded webinar about real-time monitoring of application performance. See how to integrate Apache JMeter, the open-source leader in performance testing, with InfluxDB, the open-source time-series database, and Grafana, the open-source analytics and visualization application.
In this webinar, we will review the benefits of leveraging InfluxDB and Grafana when executing load tests and demonstrate how these tools are used to visualize performance metrics.
Length: 30 minutes
Session Overview
-------------------------------------------
During this webinar, we will cover the following topics while demonstrating the integrations of JMeter, InfluxDB and Grafana:
- What out-of-the-box solutions are available for real-time monitoring JMeter tests?
- What are the benefits of integrating InfluxDB and Grafana into the load testing stack?
- Which features are provided by Grafana?
- Demonstration of InfluxDB and Grafana using a practice web application
To view the webinar recording, go to:
https://www.rttsweb.com/jmeter-integration-webinar
UiPath Test Automation using UiPath Test Suite series, part 3DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 3. In this session, we will cover desktop automation along with UI automation.
Topics covered:
UI automation Introduction,
UI automation Sample
Desktop automation flow
Pradeep Chinnala, Senior Consultant Automation Developer @WonderBotz and UiPath MVP
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Essentials of Automations: Optimizing FME Workflows with ParametersSafe Software
Are you looking to streamline your workflows and boost your projects’ efficiency? Do you find yourself searching for ways to add flexibility and control over your FME workflows? If so, you’re in the right place.
Join us for an insightful dive into the world of FME parameters, a critical element in optimizing workflow efficiency. This webinar marks the beginning of our three-part “Essentials of Automation” series. This first webinar is designed to equip you with the knowledge and skills to utilize parameters effectively: enhancing the flexibility, maintainability, and user control of your FME projects.
Here’s what you’ll gain:
- Essentials of FME Parameters: Understand the pivotal role of parameters, including Reader/Writer, Transformer, User, and FME Flow categories. Discover how they are the key to unlocking automation and optimization within your workflows.
- Practical Applications in FME Form: Delve into key user parameter types including choice, connections, and file URLs. Allow users to control how a workflow runs, making your workflows more reusable. Learn to import values and deliver the best user experience for your workflows while enhancing accuracy.
- Optimization Strategies in FME Flow: Explore the creation and strategic deployment of parameters in FME Flow, including the use of deployment and geometry parameters, to maximize workflow efficiency.
- Pro Tips for Success: Gain insights on parameterizing connections and leveraging new features like Conditional Visibility for clarity and simplicity.
We’ll wrap up with a glimpse into future webinars, followed by a Q&A session to address your specific questions surrounding this topic.
Don’t miss this opportunity to elevate your FME expertise and drive your projects to new heights of efficiency.
How world-class product teams are winning in the AI era by CEO and Founder, P...
Design and Implementation of New Encryption algorithm to Enhance Performance Parameters
1. IOSR Journal of Computer Engineering (IOSRJCE)
ISSN: 2278-0661 Volume 4, Issue 5 (Sep.-Oct. 2012), PP 33-39
www.iosrjournals.org
www.iosrjournals.org 33 | P a g e
Design and Implementation of New Encryption algorithm to
Enhance Performance Parameters
1
Rajni Jain, 2
Ajit Shrivastava
1
M. Tech. Scholar CSE Dept., TRUBA College, Bhopal (M.P.),India,
2
Prof. CSE Dept., TRUBA College, Bhopal (M.P.),India,
Abstract: The study of cryptography has always had interesting research area. It is already known that
security of data is the primary concerned in the public network. Encryption and decryption is the process of
cryptography technique which should be provided secrecy of the data over the network. In the real world there
are so many organizations working on large databases over a public network like the banking sector, so there
the security is of prime concern. Encryption is exhaustively used to keep confidential data. Other than
encryption, there are so many cryptography techniques like digital signature, digital time-stamping, digital
certificates etc. Used for security purpose. But encryption is the most used technique where transactions take
place continuously between users. This paper has suggested new block cipher encryption algorithm. Suggested
algorithm is the combination of different type of operation (logical and mathematical) to perform encryption. To
calculate the performance of the suggested algorithm, the two parameters were used; these parameters are
avalanche effect and execution time. The results achieved by applying the proposed technique show better
performance of the algorithm as compared existing algorithm.
Key Word: Cryptography, Encryption, Decryption, Security, Algorithm, Network.
I. Introduction
Use of the Internet is not always just clicking around and passively taking the information, such as
fetching information and sending information. Purchasing something over the Internet from an online vendor, or
signing up for an online account, requires entering into a good deal of sensitive personal information. A typical
transaction might include not only names, e-mail addresses and physical address and phone number, but also
passwords and personal identification numbers. The incredible growth of the Internet has excited businesses and
consumers alike with its promise of changing the way to live and work. It's extremely easy to buy and sell goods
all over the world while sitting in front of a laptop. But security is a major concern on the Internet. Especially,
when using it to send sensitive information between parties. There are various types of information that are not
concerned for everyone such as: Credit-card information, Social Security number, Private correspondence,
Personal details, Sensitive company information, and Bank-account information.
Encryption can be an effective method of protecting information, and is widely used for data security in
many applications. Cryptanalysis is used for discovering encryption methods and decoding encrypted messages,
and can be used to compromise data security. Certain encryption methods are more susceptible to cryptanalysis
attacks than others. Systems that employ an encryption mechanism for data security should be aware of its
susceptibility to cryptanalysis. This paper has presented the design and implementation of the new encryption
algorithm. The motive of the development of this new encryption algorithm is to improve performance
parameters. Avalanche effect and execution time are of main concerned with results comparison. The rest of the
paper is organized in the following sections. Section 2 is the literature survey and problem identification.
Section 3 explains proposed work. Section 4 explains the Results Comparison, conclusion.
II. Literature Survey and Problem Identification
Cryptography technique is used for hiding messages in the form of a cipher, but brute force attack is
the main drawback of the cryptography technique. It’s known that modern methods are less affected by brute
force attack because of the usage of keys. At present there are so many algorithms that combine the process of
scrambling of bits and substitution boxes resulting in high avalanche effect [1]. There are various functions
available to perform encryption and decryption like matrix operation, logical operation, feistel structure,
mathematical operation etc. In matrix function revision was done on the Hill cipher by developing an iterative
procedure [2]. The procedure defines different type of matrix operation like the plain text matrix is multiplied
with the key matrix on one side and with its inverse on the other side; furthermore, the plain text matrix is mixed
thoroughly by using mixing function. At last, the plain text matrix is modified by using the XOR operation
between the plain text matrix and the key metrics. At the start of the cryptography technique alphabetical cipher
technique has been used for increasing confusion in messages, but there are some drawbacks that are associated
with alphabetic techniques like concealment of key and plaintext [2]. [3] Proposed an encryption technique that
2. Design and Implementation of New Encryption algorithm to Enhance Performance Parameters
www.iosrjournals.org 34 | P a g e
is the combination of both classical encryption as well as modern technique, generally this type of technique
referred as hybrid technique. [5] Developed a block cipher by introducing a pair of keys-one as a left
multiplicand of the plaintext and the second one as a right multiplicand of the plaintext. The same utilizes
different type of character code like EBCDIC code for converting characters into decimal numbers and using
math function like mod 256. In the same, iterative procedure and permutation function is used to produce the
cipher text. The avalanche effect, execution time and the cryptanalysis can be used to measure the performance
of any encryption algorithm. [6] Shows comparison results between different type of performance parameter
like CPU time, memory, and battery power, these parameters is calculated by existing various encryption
algorithm Encryption algorithms play a main role in information security systems. It provides an evaluation of
six of the most common encryption algorithms namely: AES (Rijndael), DES, 3DES, RC2, Blowfish, and RC6.
A comparison has been conducted for those encryption algorithms at different settings for each algorithm such
as different sizes of data blocks, different data types, battery power consumption, different key size and finally
encryption/decryption speed. [7] Analyzed the time-consuming of the known cryptographic algorithms: triple-
DES, AES and RSA. In this they designed a new timing evaluation model based on random number generating
mechanism. In this model for evaluation, there are two evaluating modes: different plaintexts in the same key
(DPSK), the same plaintext in different keys (SPDK). As the basis of the evaluating model, the plaintext and the
corresponding key are both generated by random numbers. The results show that, under the same key length and
for the same size of the processed data, RSA is about several hundred times slower than AES, triple-DES is
about three times slower than AES, and there are other runtime characteristics which further highlights the
difference between these three cryptographic algorithms and provides a reference value for people’s rational
using.
Problem Identification: From the study of the previous research it is analyzed that there are so many issues in
the existing algorithms where improvements required. In order to apply an appropriate technique in a particular
application it’s required to know these issues. All the issues are described as follows.
Execution time of algorithm directly depends on the functionality of the algorithm and it’s clearly
defines that more complex structure originates poor execution time. Security of the data directly depends on the
key length, higher key length will provide higher security but it can increase the execution time of the algorithm
so it is very important that what should be the key length and how execution time got controlled, if selected key
length is higher. Avalanche effect is a desirable property of any encryption algorithm, in this a small change in
either the plaintext or the key, produces a significant change in the cipher text. So it can play an important role
in security issue. Another issue is the memory utilization because different encryption algorithms require
different memory size for implementation. This memory requirement depends on the number of operations to be
done by the algorithm. It is desirable that the memory required should be as small as possible. Selection of
operation is also responsible to increase or decrease the overall performance of the proposed algorithm.
III. Proposed Work
Here the proposed system design is divided into two phases; phase 1 and phase 2. Both phases are shown
in fig. 1 and fig. 2.
Figure 1: system architecture of proposed algorithm in phase 1
3. Design and Implementation of New Encryption algorithm to Enhance Performance Parameters
www.iosrjournals.org 35 | P a g e
Figure 2: system architecture of proposed algorithm in phase 2
1. Encryption Process of Proposed Algorithm: - Proposed algorithm is divided into two phases, phase 1 and
phase 2.
1.1 Step in the Phase 1
1. Take any 128 bit plain text.
2. Now divide this plain text into 2 parts, 64 bits each.
3. Reverse each part and then swap both.
4. Now apply a circular shift operation on both the parts twice and again combine parts to get 128 bit data.
5. Select 128 bits key value.
6. Perform XOR operation between plain text and key value and the final results should be in text data form.
7. Phase 1 is completed.
1.2 Step in the Phase 2
1. The 128 bits obtained after key mixing are divided into 16 equal parts of 8 bits each.
2. Again divide each 8 bit block into 2 parts of 4 bits each.
3. Now combine all the left 4 bit blocks to get a 64 bit block and perform the same with the right ones to get
another 64 bit block.
4. XOR both the 64 bit blocks. And the output is combined with the right 64 bit block (without any change) to
obtain 128 bit text.
5. Repeat the process 1 to 4 for N number of cycles.
6. Then the final 128 bits are divided into 16 blocks of 8 bits each.
7. Each 8 bit block is then split into 2 parts, of 2 bits and 6 bits, and circular shift is performed on the last 6
bits of each block.
8. Combine the 2 bit part and the modified 6 bit part to get 8 bit block (16 blocks in all).
9. These blocks are combined to finally obtain a 128 bit cipher text.
10. Exit.
2. Decryption Process of Proposed Algorithm: Decryption is the just reverse process of the encryption. Here
decryption process is also divided into two phases, phase 1 and phase 2.
2.1 Step for Phase 1
1. Select 128 bits cipher text.
2. The 128 bits cipher texts are divided into 16 equal parts of 8 bits each.
3. Each 8 bit cipher block is then split into 2 parts, of 2 bits and 6 bits.
4. Apply reverses circular shift on the second part of 6 bits
5. Combine the 2 bit part and the modified 6 bit part to get 8 bit block (16 blocks in all).
6. These blocks are combined to finally obtain a 128 bit cipher text.
7. Now divide this cipher text into 2 parts, 64 bits each, left and right.
8. XOR both the 64 bit blocks. And the output is a 64 bit block (without any change) to obtain left 64 bit
block 128 bit text.
9. After performing the XOR operation we will get both parts left and right parts of 64 bits each.
10. Now again divide both left and right 64 bits part into 4-4 bits part respectively.
11. Rearrange these 4 bits part in reversely to get original 64 bit parts (see architecture).
12. Finally combine all these blocks to get 128 bits.
13. Repeat process 7 to 12 for N number of cycles.
4. Design and Implementation of New Encryption algorithm to Enhance Performance Parameters
www.iosrjournals.org 36 | P a g e
14. Then the final 128 bits will produce.
15. Phase 1 is completed.
2.2 Step for Phase 2
1. Select 128 bits key value.
2. Perform XOR operation between 128 bits key values and 128 bit cipher text (final results of phase 1).
3. Now divide this cipher text into 2 parts, 64 bits each.
4. Now apply the reverse circular shift operation on both the parts twice
5. Swap both parts and apply re-reverse operation on both parts.
6. Finally combine both parts to get 128 bit plain text data.
7. Exit.
3. Advantage of Proposed Model:-
Efficient
Robustness
Secured
Simple
IV. Result Comparison
Here two different parameters are used to evaluate performance of the proposed system. First is
avalanche effect and second is encryption and decryption time. The proposed system is built on dot net platform,
Comparison of results performed between proposed algorithm and two existing algorithms. The observations
were made using a personal computer with the specifications of Intel Pentium Dual Core E2200 2.20 GHz, 1
GB of RAM and Window-XP SP2 as the platform. At the time of results evaluation, plain text and key value
both were written randomly. To calculate encryption and decryption time proposed system run so many times on
different-different text file with the same key value and then final results were observed. Similarly, in the case
of avalanche effect evaluation, after running proposed systems several times, the final results are the same i.e. in
numeric form.
1. Avalanche Effect Comparisons: Avalanche Effect is the important property of security in cryptographic
algorithms where, if an input is changed slightly (changing a single bit) the output changes significantly. In our
case, we have chosen two different input plain text as “welcometomycolle” and
“welcometomycollewelcometomycolle”
Because of key length used in existing algorithm, “proposed algorithm” and “A Block Cipher Having a Key on
One Side of the Plain Text Matrix and its Inverse on the Other Side” are using 128 bits key length where “A
Modified Hill Cipher Involving a Pair of Keys and a Permutation” is using 256 bits key length. Changing one
bit from the plain text, we get “welcometomycolla” (on changing me to a) for “proposed algorithm” and “A
Block Cipher Having a Key on one side of the Plain Text Matrix and its Inverse on the other side. Changing one
bit from the plain text, we get “welcometomycollewelcometomycolla” (on changing e to a) for “A Modified
Hill Cipher Involving a Pair of Keys and a Permutation”.
1.1 A Block Cipher Having a Key on one side of the Plain Text Matrix and its Inverse on the other side
Plain Text: welcometomycolle
000011000000111000001010101000100000010011000000000000001001100000001010001000110101100000
10100000000000011110000100000000000000
Change in Plain Text: welcometomycolla
000010000001010000010101010011000000000101010001000000000011000000001100010011101110000011
0100000000000001110000110000001000000
Avalanche Effect: 18
1.2 A Modified Hill Cipher Involving a Pair of Keys and a Permutation
Plain Text: welcometomycollewelcometomycolle
5. Design and Implementation of New Encryption algorithm to Enhance Performance Parameters
www.iosrjournals.org 37 | P a g e
000000000000000000000000000000000000000000000000000000000000100000000000000000000000000000
001000000000000110100000000000000000000010011000000000010100110000000001010110000000000010
0000001000110100011000100000100000000110100000010111001010010111110010110010
Change in Plain Text: welcometomycolle welcometomycolla
100000010000001000000100000010000111000000000111000110000011100010100011000110000001111100
001001111111100110100000000000000000000010011000000000010100110110000111010110000001111110
0000001111110100011000101100101111000110100111110111001011111111110010110010
Avalanche Effect: 59
1.3 Proposed Algorithm
Plain Text: welcometomycolle
010110101010000000101111001110110000111111111000110111111101000001001100010011001000011111
00000100111000101111110000111111000101
Change in Plain Text: welcometomycolla
101001111111111011110111111111011101000000011111000010000011111111111001110110011011100000
11111011000111010000001111000111111010
Avalanche Effect: 96
Table 1: Avalanche Effect Comparisons
Encryption Technique Avalanche Effect
“A Modified Hill Cipher
Involving a Pair of Keys
and a Permutation”
18
“A Block Cipher Having
a Key on One Side of the
Plain Text Matrix and its
Inverse on the Other
Side”.
59
“Proposed Algorithm” 96
A graphical representation of the TABLE 1 is shown in Fig.3 blue lines represent a comparison between
“Existing Algorithm” and “Proposed Algorithm”. According to the graph, there is a tendency that the
avalanche effect increases with file size. But the total avalanche effect through Proposed Algorithm is higher
than avalanche effect for comparing algorithms.
Figure 3: avalanche effect comparisons
2. Execution Time Comparison: Here, the proposed algorithm (with 128 bit block size in this) and selected
algorithms have been implemented in a number of different data files like text, pdf and image in varying types
of content and sizes of a wide range. But here we are using result of text file. Encryption and Decryption time
of Various Text file comparisons shown in TABLE 2 and TABLE 3 respectively.
Table 2: Encryption Time Comparison between Proposed Algorithm and Selected Existing Algorithm on
Various Text File
S.
N
O
FILE
SIZE
in KB
A Modified
Hill Cipher
Involving a
Pair of Keys
and a
Permutation
A Block Cipher
Having a Key on
One Side of the
Plain Text Matrix
and its Inverse on
the Other Side
Proposed
Algorithm
6. Design and Implementation of New Encryption algorithm to Enhance Performance Parameters
www.iosrjournals.org 38 | P a g e
1 10 11 9 1
2 70 14 12 5
3 300 22 19 13
4 700 43 37 20
Table 3: Decryption Time Comparison between Proposed Algorithm and Selected Existing Algorithm on
Various Text File
S
.
N
O
FILE
SIZE
in KB
A Modified
Hill Cipher
Involving a
Pair of Keys
and a
Permutation
A Block Cipher
Having a Key on
One Side of the
Plain Text Matrix
and its Inverse on
the Other Side
Proposed
Algorithm
1 10 11 9 1
2 70 14 12 5
3 300 22 19 13
4 700 43 37 20
A graphical representation in the TABLE 2 and TABLE 3 is shown in Fig.4 and Fig.5 with blue line
and orange line for encryption and decryption time of “Existing algorithm” and the green line is for “Proposed
Algorithm”. According to the graph, there is a tendency that encryption/decryption time for proposed algorithm,
and compared algorithms increases with file size. But the required time for the encryption/decryption through
proposed algorithm is much smaller than the encryption / decryption time for another two.
Figure 4: encryption time comparison between proposed algorithm and selected existing algorithm on
various text File
Figure 5: decryption time comparison between proposed algorithm and selected existing algorithm on
various text file
V. Conclusion
This paper has suggested and developed encryption algorithm and encryption system using a block
cipher symmetric technique. With the above, the performance between existing algorithm and suggested
algorithm has examined .Suggested algorithm has used logical functions like XOR and circular shift. Due to
these operations suggested algorithm becomes more secure because shifts and XOR cause changes to be
propagated left and right, and change in single bit results propagation in the full word, in about 4 iterations.
Measurements showed the diffusion was complete at about six iterations. It is quite easy and reducing response
time as shown in TABLE 2 and TABLE 3. The hacker cannot see the original key even if he knows the plaintext
7. Design and Implementation of New Encryption algorithm to Enhance Performance Parameters
www.iosrjournals.org 39 | P a g e
and the cipher text. The suggested algorithm will help to reduce response time taken by them for the
authentication protocols. The suggested system ensure without any problem on the decrypt of the text, image or
any other type of data, and. It is efficient and useable for the security in the different type of network. The
selected algorithms and Proposed Algorithm were tested. Several points can be concluded from the
Experimental results. Firstly; there is no significant difference when the results are displayed either in
hexadecimal base encoding or in base 64 encoding. Secondly; in the case of changing packet size, it was
concluded that proposed Algorithm has better performance than other common encryption algorithms used.
Thirdly; the avalanche effect of the proposed algorithm is producing very high as comparison other algorithm as
shown in TABLE 1. Fourth; memory utilization of proposed algorithm is also better than the other algorithm.
Future Enhancement: To achieve higher security proposed algorithm will include more complicated process
and will increase number of logical operations in such a way where performance cannot be decreased. Increase
Key length is also future work.
References
[1] Ramanujam and Marimuthu Karuppiah ”Designing an algorithm with high Avalanche Effect” IJCSNS International Journal of
Computer Science and Network Security, VOL.11 No.1, January 2011
[2] Dr. V. U. K. Sastry, Prof. D. S. R. Murthy, Dr. S. Durga Bhavani “A Block Cipher Having a Key on One Side of the Plain Text
Matrix and its Inverse on the Other Side” published in International Journal of Computer Theory and Engineering, Vol. 2, No. 5,
October, 2010 1793-8201.
[3] Fauzan Saeed and Mustafa Rashid “ Integrating Classical Encryption with Modern Technique” IJCSNS International Journal of
Computer Science and Network Security, VOL.10 No.5, May 2010
[4] V. U. K. Sastry, D. S. R. Murthy, S. Durga Bhavani, “A Block Cipher Involving a Key Applied on Both the Sides of the Plain
Text”, International Journal of Computer and Network Security (IJCNS), Vol. 1, No. 1, pp. 27 -30, Oct. 2009.
[5] V. U. K. Sastry, V. Janaki, “A Modified Hill Cipher with Multiple Keys”, International Journal of Computational Science, Vol. 2,
No. 6, 815 – 826, Dec. 2008.
[6] Diaa Salama Abdul. Elminaam1, Hatem Mohamed Abdul Kader2 and Mohie Mohamed Hadhoud3”Performance Evaluation of
Symmetric Encryption Algorithms” IJCSNS International Journal of Computer Science and Network Security, VOL.8 No.12,
December 2008
[7] Yan Wang and Ming Hu ”Timing evaluation of the known cryptographic algorithms” IEEE International Conference on
Computational Intelligence and Security 2009
[8] B. Schneier, Applied Cryptography, John Wiley & Sons, New York, 1994.
[9] B. Schneier, "Data Guardians," MacWorld, Feb 1993, 145-151.
[10] William Stallings, “Cryptography and Network Security: Principles & Practices”, second edition.
[11] Hardjono, ''Security in Wireless LANS and MANS,'' Artech House Publishers 2005.