The document proposes and evaluates an efficient and highly secure technique for encrypting and decrypting color images. The technique works by dividing the image matrix into blocks, selecting secret keys of the same size as the blocks, and applying exclusive-OR operations between the blocks and keys. Testing showed the technique encrypted and decrypted images accurately while providing faster speeds and higher throughput than other methods. It also offered a very high level of security due to the large number of possible key combinations.
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.
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.
An improved color image encryption algorithm with pixel permutation and bit s...eSAT Journals
Abstract Today the transmission of multimedia data including image and video is growing in telecommunications. Security is one of the main issues in transferring such sensitive information. Powerful image encryption algorithm is the solution for this problem. This paper is an implementation of a color image encryption algorithm based on Rubik’s cube technique. The Rubik’s cube technique is used for pixel permutation and a bit substitution method based on DNA sequences are used to change the value of each pixel on the image. Then the time-stamp is appended with encrypted image, which can be used to identify the replay attack. For evaluating the performance of the algorithm a series of tests are performed. These tests include information entropy analysis, correlation analysis, analysis of NPCR and UACI values etc. Index Terms: Cryptography, encryption, decryption, timestamp, replay attack, plaintext, cipher-text, algorithm, chaos.
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.
Transmission of cryptic text using rotational visual cryptographyeSAT Journals
Abstract Today security is an important thing when we need to transmit data from one location to another safely. In this paper we are proposing an empirical model of secure data transmission technique with a hybrid approach of Cryptography, Stegnography and rotational analysis. In the initial phase, data is encrypted with DES algorithm with the help of Session key which is generated by the Diffie-Hellman Key exchange Algorithm. In the second phase Cipher Data is hidden into the cover image’s LSB to form the stego image, by considering security as the optimal security parameter. In the third phase, the Stego image is rotated with specific angle. At the receiver end, the image is de-rotated and the cipher information from the LSB is retrieved and the cipher information is decrypted with session key. This scheme achieves lossless recovery and is difficult to decrypt by the attackers. Keywords: Cryptography, Stegnography, Visual Cryptography, DES, Diffie-Hellman Algorithm, Session Key
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.
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.
An improved color image encryption algorithm with pixel permutation and bit s...eSAT Journals
Abstract Today the transmission of multimedia data including image and video is growing in telecommunications. Security is one of the main issues in transferring such sensitive information. Powerful image encryption algorithm is the solution for this problem. This paper is an implementation of a color image encryption algorithm based on Rubik’s cube technique. The Rubik’s cube technique is used for pixel permutation and a bit substitution method based on DNA sequences are used to change the value of each pixel on the image. Then the time-stamp is appended with encrypted image, which can be used to identify the replay attack. For evaluating the performance of the algorithm a series of tests are performed. These tests include information entropy analysis, correlation analysis, analysis of NPCR and UACI values etc. Index Terms: Cryptography, encryption, decryption, timestamp, replay attack, plaintext, cipher-text, algorithm, chaos.
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.
Transmission of cryptic text using rotational visual cryptographyeSAT Journals
Abstract Today security is an important thing when we need to transmit data from one location to another safely. In this paper we are proposing an empirical model of secure data transmission technique with a hybrid approach of Cryptography, Stegnography and rotational analysis. In the initial phase, data is encrypted with DES algorithm with the help of Session key which is generated by the Diffie-Hellman Key exchange Algorithm. In the second phase Cipher Data is hidden into the cover image’s LSB to form the stego image, by considering security as the optimal security parameter. In the third phase, the Stego image is rotated with specific angle. At the receiver end, the image is de-rotated and the cipher information from the LSB is retrieved and the cipher information is decrypted with session key. This scheme achieves lossless recovery and is difficult to decrypt by the attackers. Keywords: Cryptography, Stegnography, Visual Cryptography, DES, Diffie-Hellman Algorithm, Session Key
Image Encryption Based on Pixel Permutation and Text Based Pixel Substitutionijsrd.com
Digital image Encryption techniques play a very important role to prevent image from unauthorized access. There are many types of methods available that can do Image Encryption, and the majority of them are scrambling algorithms based on pixel shuffling, which cannot change the histogram of an image. Hence, their security performances are not good. The encryption method that combines the pixel exchanging and gray level changing can handles reach a good chaotic effect. In this paper we focus on an image encryption technique based on pixel wise shuffling with the help of skew tent map and text based pixel substitution. The PSNR, NPCR and CC obtained by our technique shows that the proposed technique gives better result than the existing techniques.
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.
Highly secure scalable compression of encrypted imageseSAT Journals
Abstract A highly secure scalable compression method for stream cipher encrypted images is described in this journal. The input image first undergoes encryption and then shuffling. This shuffling in the image pixels enhances the security. For shuffling, Henon map is used. There are two layers for the scalable compression namely base layer and enhancement layer. Base layer bits are produced by coding a series of non-overlapping patches of uniformly down sampled version of encrypted image. In the enhancement layer pixels are selected by random permutation and then coded. From all the available pixel samples an iterative multi scale technique is used to reconstruct the image and finally performs decryption. The proposed method has high security. Key Words: Encryption, Decryption, Shuffling, Scalable compression
This is a project dealing with securing images over a network.
Image is a delicate piece of information shared between clients across the world.Cryptography plays a huge role during secure connections.Applying simple Gaussian elimination to achieve highly secured image encryption decryption technique is a interesting challenge.
Image and text Encryption using RSA algorithm in java PiyushPatil73
About RSA
RSA is an encryption algorithm.
Developed in: 1977.
Developed by: Ron Rivest, Adi Shamir, and Leonard Adleman.
The RSA algorithm is the most commonly used public key encryption algorithm.
Two keys are used: Public Key and Private Key.
Public Key: For encryption.
Private Key: For decryption, also known as a secret key.
Public Key: Shared with the public that wants to send us data.
Private Key: Kept secret so that when someone sends us data encrypted by our
Public Key, we can decrypt the data using the Private Key.
Visual Cryptography is a special encryption technique that encrypts the secret image into n
number of shares to hide information in images in such a way that it can be decrypted by the
human visual system. It is imperceptible to reveal the secret information unless a certain
number of shares (k) or more are superimposed. Simple visual cryptography is very insecure.
Variable length key based visual cryptography for color image uses a variable length Symmetric
Key based Visual Cryptographic Scheme for color images where a secret key is used to encrypt
the image and division of the encrypted image is done using Random Number. Unless the secret
key, the original image will not be decrypted. Here secret key ensures the security of image.
This paper describes the overall process of above scheme. Encryption process encrypts the
Original Image using variable length Symmetric Key, gives encrypted image. Share generation
process divides the encrypted image into n number of shares using random number. Decryption process stacks k number of shares out of n to reconstruct encrypted image and uses the same key for decryption.
Using this software any 50 sec audio message can be decrypted into image file and then original message can again be recovered from image file. This project is coded in Matlab and gui is also built in Matlab.
Data Hiding and Retrieval using Visual CryptographyAM Publications
Nath et al. developed several methods for hiding data in a cover file using different steganography
methods. In some methods Nath et al. first applied encryption method before hiding into the cover file. For security
reasons the secret message is encrypted first before inserting into the cover file. To make the system more complex the
authors used some random insertion of bits so that even if the intruders can extract the bits from cover file but they
cannot reconstruct the original secret message. In the present work the authors applied different data hiding
algorithm based on visual cryptography. Visual Cryptography is now a days a very popular method for hiding any
secret message inside multiple shares. Initially people were trying to hide some secret message which is simply B/W in
two shares. But slowly the researchers started to hide any color image (may be text or image or any object) in two or
more shares. In the present work the authors tried to hide any color message/image in two or more shares. The
interesting part of the present method is that from one share it impossible to create the second share or to extract the
hidden secret message from one share without having the other share(s). The present method may be used for
reconstructing password or any kind of important message or image. The present method may be applied in forensic
department or in defense for sending some confidential message
A new partial image encryption method for document images using variance base...IJECEIAES
The proposed method partially and completely encrypts the gray scale Document images. The complete image encryption is also performed to compare the performance with the existing encryption methods. The partial encryption is carried out by segmenting the image using the Quad-tree decomposition method based on the variance of the image block. The image blocks with uniform pixel levels are considered insignificant blocks and others the significant blocks. The pixels in the significant blocks are permuted by using 1D Skew tent chaotic map. The partially encrypted image blocks are further permuted using 2D Henon map to increase the security level and fed as input to complete encryption. The complete encryption is carried out by diffusing the partially encrypted image. Two levels of diffusion are performed. The first level simply modifies the pixels in the partially encrypted image with the Bernoulli’s chaotic map. The second level establishes the interdependency between rows and columns of the first level diffused image. The experiment is conducted for both partial and complete image encryption on the Document images. The proposed scheme yields better results for both partial and complete encryption on Speed, statistical and dynamical attacks. The results ensure better security when compared to existing encryption schemes.
Survey on Different Image Encryption Techniques with Tabular Formijsrd.com
Rapid growth of digital communication and multimedia application increases the need of security and it becomes an important issue of communication and storage of multimedia. Image Encryption is one of the techniques that are used to ensure high security. Various fields such as medical science military in which image encryption can be used. Recent cryptography provides necessary techniques for securing information and protective multimedia data. In last some years, encryption technology has been developed quickly and many image encryption methods have been used to protect confidential image data from illegal way in. Within this paper survey of different image encryption techniques have been discussed from which researchers can get an idea for efficient techniques to be used.
Unified Approach With Neural Network for Authentication, Security and Compres...CSCJournals
The Present demands of scientific and social life forced image processing based applications to have a tremendous growth. This growth at the same time has given numbers of challenges to researcher to meet the desired objectives of either users or from solution perspectives. Among the various challenges, the most dominating areas are: reduction in required memory spaces for storage or taken transmission time from one location to other, protection of image contents to maintain the privacy and to facilitate the mechanism to identify the malicious modification if there is any either in storage or in transmission channel. Even though there are number of methods proposed by various researchers and are existed as solutions, questions are remain open in terms of quality, cost and complexity. In this paper we have proposed the concept based on neural network to achieve the quality of compression, protection and authentication all together using the ability of universal approximation by learning, one way property and one to one mapping characteristics correspondingly. With the proposed methods not only we can authenticate the image but also positions of malicious activity given in the image can be located with high precision. Proposed methods are very efficient in performance as well as carry the features of simplicity and cost effectiveness.
DESIGN AND ANALYSIS OF A NOVEL DIGITAL IMAGE ENCRYPTION SCHEMEIJNSA Journal
In this paper, a new image encryption scheme using a secret key of 144-bits is proposed. In the substitution process of the scheme, image is divided into blocks and subsequently into color components. Each color component is modified by performing bitwise operation which depends on secret key as well as a few most significant bits of its previous and next color component. Three rounds are taken to complete substitution process. To make cipher more robust, a feedback mechanism is also applied by modifying used secret key after encrypting each block. Further, resultant image is partitioned into several key based dynamic sub-images. Each sub-image passes through the scrambling process where pixels of sub-image are reshuffled within itself by using a generated magic square matrix. Five rounds are taken for scrambling process. The propose scheme is simple, fast and sensitive to the secret key. Due to high order of substitution and permutation, common attacks like linear and differential cryptanalysis are infeasible. The experimental results show that the proposed encryption technique is efficient and has high security features.
Image Encryption Based on Pixel Permutation and Text Based Pixel Substitutionijsrd.com
Digital image Encryption techniques play a very important role to prevent image from unauthorized access. There are many types of methods available that can do Image Encryption, and the majority of them are scrambling algorithms based on pixel shuffling, which cannot change the histogram of an image. Hence, their security performances are not good. The encryption method that combines the pixel exchanging and gray level changing can handles reach a good chaotic effect. In this paper we focus on an image encryption technique based on pixel wise shuffling with the help of skew tent map and text based pixel substitution. The PSNR, NPCR and CC obtained by our technique shows that the proposed technique gives better result than the existing techniques.
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.
Highly secure scalable compression of encrypted imageseSAT Journals
Abstract A highly secure scalable compression method for stream cipher encrypted images is described in this journal. The input image first undergoes encryption and then shuffling. This shuffling in the image pixels enhances the security. For shuffling, Henon map is used. There are two layers for the scalable compression namely base layer and enhancement layer. Base layer bits are produced by coding a series of non-overlapping patches of uniformly down sampled version of encrypted image. In the enhancement layer pixels are selected by random permutation and then coded. From all the available pixel samples an iterative multi scale technique is used to reconstruct the image and finally performs decryption. The proposed method has high security. Key Words: Encryption, Decryption, Shuffling, Scalable compression
This is a project dealing with securing images over a network.
Image is a delicate piece of information shared between clients across the world.Cryptography plays a huge role during secure connections.Applying simple Gaussian elimination to achieve highly secured image encryption decryption technique is a interesting challenge.
Image and text Encryption using RSA algorithm in java PiyushPatil73
About RSA
RSA is an encryption algorithm.
Developed in: 1977.
Developed by: Ron Rivest, Adi Shamir, and Leonard Adleman.
The RSA algorithm is the most commonly used public key encryption algorithm.
Two keys are used: Public Key and Private Key.
Public Key: For encryption.
Private Key: For decryption, also known as a secret key.
Public Key: Shared with the public that wants to send us data.
Private Key: Kept secret so that when someone sends us data encrypted by our
Public Key, we can decrypt the data using the Private Key.
Visual Cryptography is a special encryption technique that encrypts the secret image into n
number of shares to hide information in images in such a way that it can be decrypted by the
human visual system. It is imperceptible to reveal the secret information unless a certain
number of shares (k) or more are superimposed. Simple visual cryptography is very insecure.
Variable length key based visual cryptography for color image uses a variable length Symmetric
Key based Visual Cryptographic Scheme for color images where a secret key is used to encrypt
the image and division of the encrypted image is done using Random Number. Unless the secret
key, the original image will not be decrypted. Here secret key ensures the security of image.
This paper describes the overall process of above scheme. Encryption process encrypts the
Original Image using variable length Symmetric Key, gives encrypted image. Share generation
process divides the encrypted image into n number of shares using random number. Decryption process stacks k number of shares out of n to reconstruct encrypted image and uses the same key for decryption.
Using this software any 50 sec audio message can be decrypted into image file and then original message can again be recovered from image file. This project is coded in Matlab and gui is also built in Matlab.
Data Hiding and Retrieval using Visual CryptographyAM Publications
Nath et al. developed several methods for hiding data in a cover file using different steganography
methods. In some methods Nath et al. first applied encryption method before hiding into the cover file. For security
reasons the secret message is encrypted first before inserting into the cover file. To make the system more complex the
authors used some random insertion of bits so that even if the intruders can extract the bits from cover file but they
cannot reconstruct the original secret message. In the present work the authors applied different data hiding
algorithm based on visual cryptography. Visual Cryptography is now a days a very popular method for hiding any
secret message inside multiple shares. Initially people were trying to hide some secret message which is simply B/W in
two shares. But slowly the researchers started to hide any color image (may be text or image or any object) in two or
more shares. In the present work the authors tried to hide any color message/image in two or more shares. The
interesting part of the present method is that from one share it impossible to create the second share or to extract the
hidden secret message from one share without having the other share(s). The present method may be used for
reconstructing password or any kind of important message or image. The present method may be applied in forensic
department or in defense for sending some confidential message
A new partial image encryption method for document images using variance base...IJECEIAES
The proposed method partially and completely encrypts the gray scale Document images. The complete image encryption is also performed to compare the performance with the existing encryption methods. The partial encryption is carried out by segmenting the image using the Quad-tree decomposition method based on the variance of the image block. The image blocks with uniform pixel levels are considered insignificant blocks and others the significant blocks. The pixels in the significant blocks are permuted by using 1D Skew tent chaotic map. The partially encrypted image blocks are further permuted using 2D Henon map to increase the security level and fed as input to complete encryption. The complete encryption is carried out by diffusing the partially encrypted image. Two levels of diffusion are performed. The first level simply modifies the pixels in the partially encrypted image with the Bernoulli’s chaotic map. The second level establishes the interdependency between rows and columns of the first level diffused image. The experiment is conducted for both partial and complete image encryption on the Document images. The proposed scheme yields better results for both partial and complete encryption on Speed, statistical and dynamical attacks. The results ensure better security when compared to existing encryption schemes.
Survey on Different Image Encryption Techniques with Tabular Formijsrd.com
Rapid growth of digital communication and multimedia application increases the need of security and it becomes an important issue of communication and storage of multimedia. Image Encryption is one of the techniques that are used to ensure high security. Various fields such as medical science military in which image encryption can be used. Recent cryptography provides necessary techniques for securing information and protective multimedia data. In last some years, encryption technology has been developed quickly and many image encryption methods have been used to protect confidential image data from illegal way in. Within this paper survey of different image encryption techniques have been discussed from which researchers can get an idea for efficient techniques to be used.
Unified Approach With Neural Network for Authentication, Security and Compres...CSCJournals
The Present demands of scientific and social life forced image processing based applications to have a tremendous growth. This growth at the same time has given numbers of challenges to researcher to meet the desired objectives of either users or from solution perspectives. Among the various challenges, the most dominating areas are: reduction in required memory spaces for storage or taken transmission time from one location to other, protection of image contents to maintain the privacy and to facilitate the mechanism to identify the malicious modification if there is any either in storage or in transmission channel. Even though there are number of methods proposed by various researchers and are existed as solutions, questions are remain open in terms of quality, cost and complexity. In this paper we have proposed the concept based on neural network to achieve the quality of compression, protection and authentication all together using the ability of universal approximation by learning, one way property and one to one mapping characteristics correspondingly. With the proposed methods not only we can authenticate the image but also positions of malicious activity given in the image can be located with high precision. Proposed methods are very efficient in performance as well as carry the features of simplicity and cost effectiveness.
DESIGN AND ANALYSIS OF A NOVEL DIGITAL IMAGE ENCRYPTION SCHEMEIJNSA Journal
In this paper, a new image encryption scheme using a secret key of 144-bits is proposed. In the substitution process of the scheme, image is divided into blocks and subsequently into color components. Each color component is modified by performing bitwise operation which depends on secret key as well as a few most significant bits of its previous and next color component. Three rounds are taken to complete substitution process. To make cipher more robust, a feedback mechanism is also applied by modifying used secret key after encrypting each block. Further, resultant image is partitioned into several key based dynamic sub-images. Each sub-image passes through the scrambling process where pixels of sub-image are reshuffled within itself by using a generated magic square matrix. Five rounds are taken for scrambling process. The propose scheme is simple, fast and sensitive to the secret key. Due to high order of substitution and permutation, common attacks like linear and differential cryptanalysis are infeasible. The experimental results show that the proposed encryption technique is efficient and has high security features.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Encryption-Decryption RGB Color Image Using Matrix Multiplicationijcsit
An enhanced technique of color image encryption based on random matrix key encoding is proposed. To
encrypt the color image a separation into Red Green and Blue (R, G, B) channels will applied. Each
channel is encrypted using a technique called double random matrix key encoding then three new coding
image matrices are constructed. To obtain the reconstructed image that is the same as the original image
in the receipted side; simple extracted and decryption operations can be maintained. The results shown
that the proposed technique is powerful for color image encryption and decryption and a MATLAB and
simulations were used to get the results.
The proposed technique has high security features because each color component is separately treated
using its own double random matrix key which is generated randomly and make the process of hacking the
three keys very difficult.
In recent years the topic of steganography has become
very popular and a lot of research is being done in this field.
Reversible data hiding is a method in which the image in which
the encrypted data is hidden is losslessly recovered. In this paper
we have proposed such a method that the previous work done
limitations can be overcome. In this paper, we embed the
encrypted data in the image by using LSB matching technique for
reserving room, so that fast, optimal and lossless steganography
is achieved. The proposed method provides total reversibility,
that is, data extraction and image recovery.
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.
Using image stitching and image steganography security can be provided to any image which has to be sent over the network or transferred using any electronic mode. There is a message and a secret image that has to be sent. The secret image is divided into parts.The first phase is the Encrypting Phase, which deals with the process of converting the actual secret message into ciphertext using the AES algorithm. In the second phase which is the Embedding Phase, the cipher text is embedded into any part of the secret image that is to be sent. Third phase is the Hiding Phase, where steganography is performed on the output image of Embedding Phase and other parts of the image where the parts are camouflaged by another image using least significant bit replacement. These individual parts are sent to the concerned receiver. At the receivers end decryption of Hiding phase and Embedding Phase takes place respectively. The parts obtained are stitched together using k nearest method. Using SIFT features the quality of the image is improved.
Using image stitching and image steganography security can be provided to any image which has to be
sent over the network or transferred using any electronic mode. There is a message and a secret image that
has to be sent. The secret image is divided into parts.The first phase is the Encrypting Phase, which deals
with the process of converting the actual secret message into ciphertext using the AES algorithm. In the
second phase which is the Embedding Phase, the cipher text is embedded into any part of the secret image
that is to be sent. Third phase is the Hiding Phase, where steganography is performed on the output image
of Embedding Phase and other parts of the image where the parts are camouflaged by another image using
least significant bit replacement. These individual parts are sent to the concerned receiver. At the
receivers end decryption of Hiding phase and Embedding Phase takes place respectively. The parts
obtained are stitched together using k nearest method. Using SIFT features the quality of the image is
improved.
SELECTIVE ENCRYPTION OF IMAGE BY NUMBER MAZE TECHNIQUEijcisjournal
Due to enormous increase in the usage of computers and mobiles, today’s world is currently flooded with huge volumes of data. This paper is primarily focused on multimedia data and how it can be protected from unwanted attacks. Sharing of multimedia data is easy and very efficient, it has been a customary practice to share multimedia data but there is no proper encryption technique to encrypt multimedia data. Sharing of multimedia data over unprotected networks using DCT algorithm and then applying selective encryption-based algorithm has never been adequately studied. This paper introduces a new selective encryption-based security system which will transfer data with protection even in unauthenticated network. Selective encryption-based security system will also minimize time during encryption process which there by achieves efficiency. The data in the image is transmitted over a network is discriminated using DCT transform and then it will be selectively encrypted using Number Puzzle technique, and thus provides security from unauthorized access. This paper discusses about numeric puzzle-based encryption technique
and how it can achieve security and integrity for multimedia data over traditional encryption technique.
Secure Image Transmission for Cloud Storage System Using Hybrid SchemeIJERD Editor
- Data over the cloud is transferred or transmitted between servers and users. Privacy of that
data is very important as it belongs to personal information. If data get hacked by the hacker, can be
used to defame a person’s social data. Sometimes delay are held during data transmission. i.e. Mobile
communication, bandwidth is low. Hence compression algorithms are proposed for fast and efficient
transmission, encryption is used for security purposes and blurring is used by providing additional
layers of security. These algorithms are hybridized for having a robust and efficient security and
transmission over cloud storage system.
Forklift Classes Overview by Intella PartsIntella Parts
Discover the different forklift classes and their specific applications. Learn how to choose the right forklift for your needs to ensure safety, efficiency, and compliance in your operations.
For more technical information, visit our website https://intellaparts.com
Student information management system project report ii.pdfKamal Acharya
Our project explains about the student management. This project mainly explains the various actions related to student details. This project shows some ease in adding, editing and deleting the student details. It also provides a less time consuming process for viewing, adding, editing and deleting the marks of the students.
NO1 Uk best vashikaran specialist in delhi vashikaran baba near me online vas...Amil Baba Dawood bangali
Contact with Dawood Bhai Just call on +92322-6382012 and we'll help you. We'll solve all your problems within 12 to 24 hours and with 101% guarantee and with astrology systematic. If you want to take any personal or professional advice then also you can call us on +92322-6382012 , ONLINE LOVE PROBLEM & Other all types of Daily Life Problem's.Then CALL or WHATSAPP us on +92322-6382012 and Get all these problems solutions here by Amil Baba DAWOOD BANGALI
#vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore#blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #blackmagicforlove #blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #Amilbabainuk #amilbabainspain #amilbabaindubai #Amilbabainnorway #amilbabainkrachi #amilbabainlahore #amilbabaingujranwalan #amilbabainislamabad
Online aptitude test management system project report.pdfKamal Acharya
The purpose of on-line aptitude test system is to take online test in an efficient manner and no time wasting for checking the paper. The main objective of on-line aptitude test system is to efficiently evaluate the candidate thoroughly through a fully automated system that not only saves lot of time but also gives fast results. For students they give papers according to their convenience and time and there is no need of using extra thing like paper, pen etc. This can be used in educational institutions as well as in corporate world. Can be used anywhere any time as it is a web based application (user Location doesn’t matter). No restriction that examiner has to be present when the candidate takes the test.
Every time when lecturers/professors need to conduct examinations they have to sit down think about the questions and then create a whole new set of questions for each and every exam. In some cases the professor may want to give an open book online exam that is the student can take the exam any time anywhere, but the student might have to answer the questions in a limited time period. The professor may want to change the sequence of questions for every student. The problem that a student has is whenever a date for the exam is declared the student has to take it and there is no way he can take it at some other time. This project will create an interface for the examiner to create and store questions in a repository. It will also create an interface for the student to take examinations at his convenience and the questions and/or exams may be timed. Thereby creating an application which can be used by examiners and examinee’s simultaneously.
Examination System is very useful for Teachers/Professors. As in the teaching profession, you are responsible for writing question papers. In the conventional method, you write the question paper on paper, keep question papers separate from answers and all this information you have to keep in a locker to avoid unauthorized access. Using the Examination System you can create a question paper and everything will be written to a single exam file in encrypted format. You can set the General and Administrator password to avoid unauthorized access to your question paper. Every time you start the examination, the program shuffles all the questions and selects them randomly from the database, which reduces the chances of memorizing the questions.
HEAP SORT ILLUSTRATED WITH HEAPIFY, BUILD HEAP FOR DYNAMIC ARRAYS.
Heap sort is a comparison-based sorting technique based on Binary Heap data structure. It is similar to the selection sort where we first find the minimum element and place the minimum element at the beginning. Repeat the same process for the remaining elements.
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...Dr.Costas Sachpazis
Terzaghi's soil bearing capacity theory, developed by Karl Terzaghi, is a fundamental principle in geotechnical engineering used to determine the bearing capacity of shallow foundations. This theory provides a method to calculate the ultimate bearing capacity of soil, which is the maximum load per unit area that the soil can support without undergoing shear failure. The Calculation HTML Code included.
KuberTENes Birthday Bash Guadalajara - K8sGPT first impressionsVictor Morales
K8sGPT is a tool that analyzes and diagnoses Kubernetes clusters. This presentation was used to share the requirements and dependencies to deploy K8sGPT in a local environment.
An Approach to Detecting Writing Styles Based on Clustering Techniquesambekarshweta25
An Approach to Detecting Writing Styles Based on Clustering Techniques
Authors:
-Devkinandan Jagtap
-Shweta Ambekar
-Harshit Singh
-Nakul Sharma (Assistant Professor)
Institution:
VIIT Pune, India
Abstract:
This paper proposes a system to differentiate between human-generated and AI-generated texts using stylometric analysis. The system analyzes text files and classifies writing styles by employing various clustering algorithms, such as k-means, k-means++, hierarchical, and DBSCAN. The effectiveness of these algorithms is measured using silhouette scores. The system successfully identifies distinct writing styles within documents, demonstrating its potential for plagiarism detection.
Introduction:
Stylometry, the study of linguistic and structural features in texts, is used for tasks like plagiarism detection, genre separation, and author verification. This paper leverages stylometric analysis to identify different writing styles and improve plagiarism detection methods.
Methodology:
The system includes data collection, preprocessing, feature extraction, dimensional reduction, machine learning models for clustering, and performance comparison using silhouette scores. Feature extraction focuses on lexical features, vocabulary richness, and readability scores. The study uses a small dataset of texts from various authors and employs algorithms like k-means, k-means++, hierarchical clustering, and DBSCAN for clustering.
Results:
Experiments show that the system effectively identifies writing styles, with silhouette scores indicating reasonable to strong clustering when k=2. As the number of clusters increases, the silhouette scores decrease, indicating a drop in accuracy. K-means and k-means++ perform similarly, while hierarchical clustering is less optimized.
Conclusion and Future Work:
The system works well for distinguishing writing styles with two clusters but becomes less accurate as the number of clusters increases. Future research could focus on adding more parameters and optimizing the methodology to improve accuracy with higher cluster values. This system can enhance existing plagiarism detection tools, especially in academic settings.
An Approach to Detecting Writing Styles Based on Clustering Techniques
An efficient and highly secure technique to encrypt
1. See discussions, stats, and author profiles for this publication at: https://www.researchgate.net/publication/334205288
An Efficient and Highly Secure Technique to Encrypt and Decrypt Color
Images
Article in Engineering, Technology and Applied Science Research · June 2019
CITATIONS
3
READS
67
3 authors:
Some of the authors of this publication are also working on these related projects:
Low cost Multilevel Modulation Formate for 100Gbps Transmission direct detection View project
A Comparison between Parallel and Segmentation Methods Used for Image Encryption-Decryption View project
Majed Dwairi
Al-Balqa Applied University
46 PUBLICATIONS 133 CITATIONS
SEE PROFILE
Amjad Hindi
Al-Balqa' Applied University
27 PUBLICATIONS 36 CITATIONS
SEE PROFILE
Ziad Alqadi
Al-Balqa' Applied University
155 PUBLICATIONS 1,142 CITATIONS
SEE PROFILE
All content following this page was uploaded by Ziad Alqadi on 03 July 2019.
The user has requested enhancement of the downloaded file.
2. Engineering, Technology & Applied Science Research Vol. 9, No. 3, 2019, 4165-4168 4165
www.etasr.com Al-Dwairi et al.: An Efficient and Highly Secure Technique to Encrypt and Decrypt Color Images
An Efficient and Highly Secure Technique to Encrypt
and Decrypt Color Images
Majed O. Al-Dwairi
Department of Communication
Technology Engineering, Faculty of
Engineering Technology, Al-Balqa'
Applied University, Amman, Jordan
majeddw@bau.edu.jo
Amjad Y. Hendi
Department of Communication
Technology Engineering, Faculty of
Engineering Technology, Al-Balqa'
Applied University, Amman, Jordan
amjad_svyaz@yahoo.com
Ziad A. AlQadi
Computer & Network Engineering
Department, Faculty of Engineering
Technology, Al-Balqa' Applied
University, Amman, Jordan
natalia_maw@yahoo.com
Abstract—Digital color images are considered as the most widely
used data. They are exchanged frequently on the internet and via
email, so an efficient and highly secure method of color image
encryption and decryption is needed. Different methods of
encryption-decryption are used, but most of them suffer from low
efficiency or low-security level or both. In this paper, an efficient
and highly secure method of encryption-decryption will be
proposed, tested, and implemented. The efficiency parameters
will be calculated and compared with other methods’ parameters
to prove the efficiency of the proposed method.
Keywords-encryption-decryption times; throughput; speedup;
MSE; PSNR
I. INTRODUCTION
Digital images are one of the most widely used data types,
and they are exchanged widely through e-mail and web
browsing. A digital image may be confidential or contain
highly confidential information [1]. In this case, it is necessary
to encrypt it in order to make it difficult to identify or the
information stored in it. The person authorized to view the
image can decrypt it and return it to the original form without
any errors. The digital image has a large size, so encoding it
may take a lot of time, which leads us to build an effective
method that reduces the encryption time as much as possible.
II. ENCRYPTION-DECRYPTION PARAMETERS
Regarding the effectiveness of the image encryption
method, the following parameters must be taken into account:
• Encryption time: the time needed to process the encryption
method in order to convert the original image to an
encrypted image.
• Decryption time: the time needed to process the decryption
method in order to convert the encrypted image to the
original image. Encryption and decryption times must be as
reduced as possible.
• Throughput: the number of bits encrypted or decrypted per
time unit. It is equal to the image size in bits divided by the
encryption or decryption time.
• Speedup: the proposed technique enhancement, which is
equal with the proposed technique throughput divided by
the throughput of another method.
• Block: the number of bytes to be encrypted/decrypted at the
same moment.
• Key size: the number of values (elements) for a secret key,
which must be equal with the block size.
• Hacking time: the time needed by an unauthorized person
to guess the original image. This time must be as large as
possible. This time depends on the length of the key used
for encryption-decryption.
• Mean square error (MSE) and peak signal-to-noise ratio
(PSNR): MSE is a measure of the quality of an estimator—
it is always non-negative, and values closer to zero are
better. But for measuring it between the original image and
the encrypted one, the value must be very large. PSNR is an
engineering term for the ratio between the maximum
possible power of a signal and the power of corrupting
noise that affects the fidelity of its representation. For ideal
encryption, the PSNR between the original image and the
encrypted image must be very low, and between the
original image and the decrypted one must be infinite (zero
errors). These parameters can be calculated using the
following formulas:
ܧܵܯ = ∑ ∑ ∑ ൫ܺሺ݅, ݆, ݇ሻ − ܻሺ݅, ݆, ݇ሻ൯
ଶ
(1)
d=max{Xi,j,k,Yi,j,k}, ܴܲܵܰ = 10݈݃ ቀ݀ଶ
ܧܵܯൗ ቁ (2)
where X and Y are color image matrices, r: rows, c: columns, p:
number of colors.
III. RELATED WORK
Some authors take data encryption standard (DES) [2], or
advanced encryption standard (AES) [3, 4] as bases for
encryption-decryption, but most of these works suffer from
high encryption-decryption time, which makes these methods
inefficient. Author in [5] suggested a method of encryption-
decryption by reshaping the 3D color matrix to a 2D matrix,
squaring the matrix, generating a secret key with size equal to
Corresponding author: Majed O. Al-Dwairi
3. Engineering, Technology & Applied Science Research Vol. 9, No. 3, 2019, 4165-4168 4166
www.etasr.com Al-Dwairi et al.: An Efficient and Highly Secure Technique to Encrypt and Decrypt Color Images
the image size, and applying matrix multiplication to get the
decrypted image. This method provides a good throughput, but
it is very difficult to remember the key, and thus the method
requires storing and transferring the key. In [6] an efficient
image encryption scheme using double logistic maps was
proposed, in which the image matrix was confused from row
and column. Confusion effect is carried out by the substitution
stage and Chen's system is employed to diffuse the gray value
distribution. In [7], a method of encryption-decryption was
proposed, this method was based on matrix reordering and it
has a medium throughput. In [8], a chaotic algorithm was
presented applying encryption-decryption by using power and
tangent functions instead of linear function. The process of
encryption is one-time-one-password system and is more
secure (but not enough) than the DES algorithm, also it has low
efficient parameters with big encryption-decryption time and
low throughput. In [9], an asymmetric image encryption-
decryption method was proposed, this method is based on
matrix transformation, but it has high encryption-decryption
time and thus low throughput. In [10] a method based on
Rubik's cube principle was proposed with a good security level,
but low throughput. In [11] a method of encryption-decryption
was presented, this method is based on using chaos-controlled
poker shuffle operation, both variants of this method (A-I and
A-II) have a poor throughput.
IV. PROPOSED METHOD
The proposed technique of color image encryption-
decryption requires the following operations (Figure 1):
• Dividing the original image matrix into equal size blocks
(in our testing experiment the block size was equal to 8
bytes).
• Selecting several secret keys (in our testing experiment we
selected 4 keys).
• Key size must equal block size.
• Key value must in the range from 0 to 255.
Fig. 1. Proposed encryptor-decryptor
The encryption phase can be implemented applying the
following steps:
• Get the original color image matrix.
• Reshape the color image matrix from 3D to 1D.
• Divide the 1D matrix into equal blocks with size equal to 8
bytes.
• Define 4 private keys with 8 elements each.
• Each data matrix block must be submitted to exclusive-OR
operation with key1, key2, key3, and key4 consecutively.
• The obtained blocks are the encrypted blocks.
The decryption phase can be implemented applying the
following steps:
• Get the encrypted color image matrix.
• Reshape the color image matrix from 3D to 1D.
• Divide the 1D matrix into equal blocks with size equal to 8
bytes.
• Use the defined 4 private keys with 8 elements each.
• Each data block be submitted to exclusive-OR with key4,
key3, key 2, and key1 consecutively.
• The obtained blocks are the decrypted blocks which must
be reshaped back to get the decrypted image.
The proposed algorithm provides a high level of security,
the number of combinations to guess the four keys is very high
and equal to 256଼
ൈ 256଼
ൈ 256଼
ൈ 256଼
= 256ଷଶ
making
the hacking process very difficult. Figure 2 shows an example
of the keys, while Figures 3-5 show the original, encrypted and
decrypted images obtained by applying the proposed method.
From Figures 4 and 5 we can see that the original and
decrypted images are the same.
Fig. 2. Keys example
Fig. 3. Original image and histograms
Fig. 4. Encrypted image and histograms
Original image
0 100 200
0
1
2
3
x 10
4 Red histogram
0 100 200
0
1
2
3
x 10
4 Green histogram
0 100 200
0
1
2
3
x 10
4 Blue histogram
Encrypted image
0 100 200
0
1
2
x 10
4 Red histogram
0 100 200
0
1
2
x 10
4 Green histogram
0 100 200
0
1
2
x 10
4 Blue histogram
4. Engineering, Technology & Applied Science Research Vol. 9, No. 3, 2019, 4165-4168 4167
www.etasr.com Al-Dwairi et al.: An Efficient and Highly Secure Technique to Encrypt and Decrypt Color Images
Fig. 5. Decrypted image and histograms
V. RESULTS AND DISCUSSION
The proposed method can be used to encrypt-decrypt color
images of any type or size. Several images were treated by the
proposed technique, and Table I shows the results of the
implementation. From Table I we can conclude the following:
• Calculated encryption/decryption times are significantly
small and grow linearly (as shown in Figure 6) when the
image size grows.
• The proposed technique is accurate by keeping the
decrypted image the same with the original image (zero
MSE and infinite PSNR).
• The proposed technique distorts the encrypted image by
maximizing MSE and minimizing PSNR between the
original image and the encrypted one.
• The throughput of the proposed technique is always
between 28 and 29 MBits per second, which is considered a
high-performance index.
TABLE I. CALCULATED PARAMETERS
Image
number
Size
(Mbits)
Encryption
time (s)
Decryption
time (s)
Throughput
(Mbps)
1 2.0672 0.0710 0.0710 29.1151
2 1.1587 0.0410 0.0410 28.2613
3 0.3750 0.0130 0.0130 28.8462
4 8.5876 0.2940 0.2940 29.2097
5 4.1199 0.1410 0.1410 29.2190
6 25.9100 0.8930 0.8930 29.0145
7 18 0.628000 0.628000 28.6624
8 7.0862 0.2470 0.2470 28.6890
9 3.2959 0.1150 0.1150 28.6600
10 1.1547 0.0390 0.0390 29.6085
To prove the correctness of the proposed technique, MSE
and PSNR were calculated (Table II). The proposed technique
was compared with other existing techniques and the results of
the comparison are shown in Table III. From these results we
can see that the proposed technique enhanced efficiency by
minimizing encryption-decryption times, and maximizing
throughput which speeds up the proposed technique. Note that
increasing the block size will increase the technique efficiency
by decreasing the encryption-decryption time and increasing
the throughput.
TABLE II. MSE AND PSNR CALCULATIONS
Image
number
Comparing encrypted
image with original
Comparing decrypted
image with original
MSE PSNR MSE PSNR
1 1.6997e+004 13.4173 0 Infinite
2 7.8742e+003 21.1118 0 Infinite
3 6.0695e+003 23.7150 0 Infinite
4 7.7992e+003 21.2075 0 Infinite
5 1.1871e+004 17.0068 0 Infinite
6 1.4770e+004 14.8217 0 Infinite
7 1.3579e+004 15.6623 0 Infinite
8 1.3214e+004 15.9352 0 Infinite
9 1.0662e+004 18.0805 0 Infinite
10 1.2664e+004 16.3601 0 Infinite
TABLE III. COMPARISON RESULTS
Method
Encryption
time (s)
Decryption
time (s)
Throughput
(Mbits)
Speedup of
the proposed
method
Order
Proposed 0.0513 0.0513 29.2398 1 1
[4] 0.06469 0.062727 23.1876 1.2610 2
[6] 0.23 0.23 6.5217 4.4835 4
[7] 0.5 0.5 3 9.7466 6
[8] 0.4 0.4 3.7500 7.7973 5
[9] 0.12 0.12 12.5000 2.3392 3
[10] v. A-I 0.56 0.56 2.6786 10.9161 7
[10] v. A-II 1.01 1.01 1.4852 19.6874 8
Image size=256×256×3×8=1572864bit=1.5000Mbits
Fig. 6. Relationship between image size and encryption time
The proposed technique was implemented using the
previous images with a block size equal to 16 pixels and with
one 16 element key, the results of the implementation are
shown in Tables IV-V.
TABLE IV. PARAMETERS FOR BLOCK SIZE =16, ONE KEY
Image
number
Size
(Mbits)
Encryption
time (s)
Decryption
time (s)
Throughput
(Mbps)
1 2.0672 0.0290 0.0290 71.2817
2 1.1587 0.0170 0.0170 68.1597
3 0.3750 0.0050 0.0050 75.0000
4 8.5876 0.1250 0.1250 68.7012
5 4.1199 0.0560 0.0560 73.5692
6 25.9100 0.3670 0.3670 70.5993
7 18 0.2540 0.2540 70.8661
8 7.0862 0.1010 0.1010 70.1602
9 3.2959 0.0470 0.0470 70.1255
10 1.1547 0.0160 0.0160 72.1707
Decrypted image
0 100 200
0
1
2
3
x 10
4 Red histogram
0 100 200
0
1
2
3
x 10
4 Green histogram
0 100 200
0
1
2
3
x 10
4 Blue histogram
5. Engineering, Technology & Applied Science Research Vol. 9, No. 3, 2019, 4165-4168 4168
www.etasr.com Al-Dwairi et al.: An Efficient and Highly Secure Technique to Encrypt and Decrypt Color Images
Here the technique efficiency was rapidly increased but
with some negative effects by increasing the PSNR between
the original and the encrypted image, which means that the
encrypted image moves toward the original image. However,
this level of PSNR is still acceptable. Table VI shows the
efficiency speedup of increased block size.
TABLE V. MSE AND PSNR FOR BLOCK SIZE =16 AND ONE KEY
Image
number
Comparing encrypted image
with original
Comparing decrypted
image with original
MSE PSNR MSE PSNR
1 9.1362e+003 19.6253 0 Infinite
2 7.4460e+003 21.6710 0 Infinite
3 7.3327e+003 21.8243 0 Infinite
4 7.5590e+003 21.5203 0 Infinite
5 8.6746e+003 20.1437 0 Infinite
6 8.5122e+003 20.3327 0 Infinite
7 8.7733e+003 20.0305 0 Infinite
8 8.1958e+003 20.7116 0 Infinite
9 7.7113e+003 21.3209 0 Infinite
10 7.3976e+003 21.7362 0 Infinite
TABLE VI. SPEEDUP WITH INCREASED BLOCK SIZE
Image
number
Throughput (Mbps)
Speed up
of (2)
Block size=8
Number of keys=4 (1)
Block size=16
Number of
keys=1 (2)
1 29.1151 71.2817 2.4483
2 28.2613 68.1597 2.4118
3 28.8462 75.0000 2.6000
4 29.2097 68.7012 2.3520
5 29.2190 73.5692 2.5179
6 29.0145 70.5993 2.4332
7 28.6624 70.8661 2.4724
8 28.6890 70.1602 2.4455
9 28.6600 70.1255 2.4468
10 29.6085 72.1707 2.4375
VI. CONCLUSIONS
An efficient and highly secure technique for color image
encryption-decryption was proposed. The proposed technique
was implemented and tested, and the experimental results
showed the following conclusions:
• The proposed technique is very efficient by increasing the
throughput and decreasing encryption-decryption times.
• The proposed technique is 100% accurate by achieving zero
MSE and infinite PSNR between the original image and the
decrypted one.
REFERENCES
[1] M. J. Aqel, Z. AlQadi, A. A. Abdullah, “RGB Color Image Encryption-
Decryption Using Image Segmentation and Matrix Multiplication”,
International Journal of Engineering and Technology, Vol. 7, No. 3.13,
pp. 104-107, 2018
[2] J. Thakur, N. Kumar, “DES, AES, and Blowfish: Symmetric Key
Cryptography Algorithms Simulation Based Performance Analysis”,
International Journal of Emerging Technology and Advanced
Engineering, Vol. 1, No. 2, pp. 6-12, 2011
[3] S. A. M. Rizvi, S. Z. Hussain, N. Wadhwa, “A Comparative Study of
Two Symmetric Encryption Algorithms across Different Platforms”,
International Conference on Security and Management, World Academy
of Science, Las Vegas, USA, July 18-21, 2011
[4] S. Wang, Y. Zheng, Z. Gao, “A New Image Scrambling Method through
Folding Transform”, IEEE International Conference on Computer
Application and System Modeling, Taiyuan, China, October 22-24, 2010
[5] J. N. Abdel-Jalil, “Performance analysis of color image
encryptiondecryption techniques”, International Journal of Advanced
Computer Technology, Vol. 5, No. 4, pp. 13-17, 2016
[6] G. Ye, “An Efficient Image Encryption Scheme based on Logistic
maps”, International Journal of Pure and Applied Mathematics, Vol. 55,
No. 1, pp. 37-47, 2009
[7] T. Sivakumar, R. Venkatesan, “A Novel Image Encryption Approach
using Matrix Reordering”, WSEAS Transactions on Computers, Vol. 12,
No. 11, pp. 407-418, 2013
[8] H. Gao, Y. Zhang, S. Liang, D. Li, “A New Chaotic Algorithm for
Image Encryption”, Chaos, Solitons & Fractals, Vol. 29, No. 2, pp. 393-
399, 2006
[9] G. Chen, Y. Mao, C. K. Chui, “A Symmetric Image Encryption Scheme
based on 3D Chaotic Cat Maps”, Chaos, Solitons & Fractals, Vol. 21,
No. 3, pp. 749–761, 2004
[10] K. Loukhaoukha, J. Y. Chouinard, A. Berdai, “A Secure Image
Encryption Algorithm Based on Rubik's Cube Principle”, Journal of
Electrical and Computer Engineering, Vol. 2012, Article ID 173931, pp.
pp. 1-13, 2012
[11] X. Wang, J. Zhang, “An Image Scrambling Encryption using Chaos-
controlled Poker Shuffle Operation”, IEEE International Symposium on
Biometrics and Security Technologies, Islamabad, Pakistan, April 23-24,
2008
AUTHORS PROFILE
Majed O. Al-Dwairi, PhD in Communication Systems. He
was born in 1968 in Jordan. He received his Diploma Degree
in 1994 and his PhD degree from Ukraine state Academy in
1998 in the field of Multichannel Communication. An
associate professor in the Department of Communication
Engineering Technology, Faculty of Engineering Technology,
Al-Balqa’ Applied University, Amman, Jordan. His research
interests include optical communication networks, digital communications,
signal and image processing, Antenna design, and microstrip patch antennas.
Amjad Y. Hendi, PhD in Radio and TV Systems. He
received his Diploma Degree in 1994 and PhD Degree from
the Ukraine state Academy in 1998 in the field of Radio &
TV systems. His research interests include digital
communications, signal and image processing, antenna
design, optimization techniques in antenna design, and
antenna measurement techniques and microstrip patch
antennas.
Ziad A. AlQadi, PhD in Computer Engineering. He was born
in 1955 in Jordan. He received his Diploma Degree in 1980
and PhD Degree from Ukraine in 1986 in the field of Computer
Engineering. Currently he is a Professor at the Computer
Engineering Department, Faculty of Engineering Technology,
Al-Balqa’ Applied University, Amman, Jordan.
View publication statsView publication stats