The document proposes and evaluates a new digital image security scheme that uses Residue Number System (RNS) encoding/decoding and a modified Arnold transform algorithm. Key points:
- The encryption process encodes the plain image into residual images using RNS, then encrypts them by applying the modified Arnold transform multiple times.
- The decryption process decrypts the cipher image by applying the inverse Arnold transform, then decodes the residual images back into the plain image using RNS and the Chinese Remainder Theorem.
- Experimental results on images of different sizes show the scheme can encrypt/decrypt without information loss. Security analysis indicates resistance to statistical attacks like histograms and strong sensitivity to encryption keys.
A NEW ALGORITHM FOR DATA HIDING USING OPAP AND MULTIPLE KEYSEditor IJMTER
Steganography gained significance in the past few years due to the increasing need
for providing secrecy in an open environment like the internet. With almost anyone can
observe the communicated data all around, steganography attempts to hide the very existence
of the message and make communication undetectable. In this paper we propose a modern
technique with Integer Wavelet transform (IWT) and double key to accomplish high hiding
capability, high security and good visual quality. Here cover image is transformed in to
wavelet transform co-efficients and the coefficients are selected randomly by using Key-2 for
embedding the data. Key-1 is used to calculate the number of bits to be embedded in the
randomly selected coefficients. Finally the Optimum Pixel Adjustment Process(OPAP) is
applied to the stego image to reduce the data embedding error.
Chaotic Block Image Scheme using Large Key Space and Message Digest AlgorithmCSCJournals
In this paper, chaotic block image scheme using large key space and message digest algorithm. Cat map intended for confusion and 2D-Sine Tent Composite map (2D-STCM) key generator intended for diffusion. Confusion is implemented by 2D Cat map with arbitrary block size. In the first tendency, 2D cat map use for local shuffling of indexes inside blocks, while in the second tendency, 2D cat map used for global shuffling of whole image indexes. The designed algorithm executes two confusions and one diffusion in each iteration. To increase the security level, the message digestion algorithm is used as a fingerprint for the plain image that creates the initial value of the key. After that 2D-STCM generates a large key stream. Diffusion implementation takes place by XOR operation; between a key stream and confused image. Experimental results, show that security level increases due to integration of confusion and diffusion. On the other side large key space and the high sensitivity of secret keys have been given a guarantee for the performance of the security. Performance measures reach to the top value among those in the similar researches. To verify the obtained results, authors implemented inverse chaos. All the tests are processed by MATLAB 2015a.
A NEW ALGORITHM FOR DATA HIDING USING OPAP AND MULTIPLE KEYSEditor IJMTER
Steganography gained significance in the past few years due to the increasing need
for providing secrecy in an open environment like the internet. With almost anyone can
observe the communicated data all around, steganography attempts to hide the very existence
of the message and make communication undetectable. In this paper we propose a modern
technique with Integer Wavelet transform (IWT) and double key to accomplish high hiding
capability, high security and good visual quality. Here cover image is transformed in to
wavelet transform co-efficients and the coefficients are selected randomly by using Key-2 for
embedding the data. Key-1 is used to calculate the number of bits to be embedded in the
randomly selected coefficients. Finally the Optimum Pixel Adjustment Process(OPAP) is
applied to the stego image to reduce the data embedding error.
Chaotic Block Image Scheme using Large Key Space and Message Digest AlgorithmCSCJournals
In this paper, chaotic block image scheme using large key space and message digest algorithm. Cat map intended for confusion and 2D-Sine Tent Composite map (2D-STCM) key generator intended for diffusion. Confusion is implemented by 2D Cat map with arbitrary block size. In the first tendency, 2D cat map use for local shuffling of indexes inside blocks, while in the second tendency, 2D cat map used for global shuffling of whole image indexes. The designed algorithm executes two confusions and one diffusion in each iteration. To increase the security level, the message digestion algorithm is used as a fingerprint for the plain image that creates the initial value of the key. After that 2D-STCM generates a large key stream. Diffusion implementation takes place by XOR operation; between a key stream and confused image. Experimental results, show that security level increases due to integration of confusion and diffusion. On the other side large key space and the high sensitivity of secret keys have been given a guarantee for the performance of the security. Performance measures reach to the top value among those in the similar researches. To verify the obtained results, authors implemented inverse chaos. All the tests are processed by MATLAB 2015a.
A NOVEL IMAGE STEGANOGRAPHY APPROACH USING MULTI-LAYERS DCT FEATURES BASED ON...ijma
Steganography is the science of hidden data in the cover image without any updating of the cover image.
The recent research of the steganography is significantly used to hide large amount of information within
an image and/or audio files. This paper proposed a new novel approach for hiding the data of secret image
using Discrete Cosine Transform (DCT) features based on linear Support Vector Machine (SVM)
classifier. The DCT features are used to decrease the image redundant information. Moreover, DCT is
used to embed the secrete message based on the least significant bits of the RGB. Each bit in the cover
image is changed only to the extent that is not seen by the eyes of human. The SVM used as a classifier to
speed up the hiding process via the DCT features. The proposed method is implemented and the results
show significant improvements. In addition, the performance analysis is calculated based on the
parameters MSE, PSNR, NC, processing time, capacity, and robustness.
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.
A High Performance Modified SPIHT for Scalable Image CompressionCSCJournals
In this paper, we present a novel extension technique to the Set Partitioning in Hierarchical Trees (SPIHT) based image compression with spatial scalability. The present modification and the preprocessing techniques provide significantly better quality (both subjectively and objectively) reconstruction at the decoder with little additional computational complexity. There are two proposals for this paper. Firstly, we propose a pre-processing scheme, called Zero-Shifting, that brings the spatial values in signed integer range without changing the dynamic ranges, so that the transformed coefficient calculation becomes more consistent. For that reason, we have to modify the initialization step of the SPIHT algorithms. The experiments demonstrate a significant improvement in visual quality and faster encoding and decoding than the original one. Secondly, we incorporate the idea to facilitate resolution scalable decoding (not incorporated in original SPIHT) by rearranging the order of the encoded output bit stream. During the sorting pass of the SPIHT algorithm, we model the transformed coefficient based on the probability of significance, at a fixed threshold of the offspring. Calling it a fixed context model and generating a Huffman code for each context, we achieve comparable compression efficiency to that of arithmetic coder, but with much less computational complexity and processing time. As far as objective quality assessment of the reconstructed image is concerned, we have compared our results with popular Peak Signal to Noise Ratio (PSNR) and with Structural Similarity Index (SSIM). Both these metrics show that our proposed work is an improvement over the original one.
Design a New Image Encryption using Fuzzy Integral Permutation with Coupled C...IJORCS
This article introduces a novel image encryption algorithm based on DNA addition combining and coupled two-dimensional piecewise nonlinear chaotic map. This algorithm consists of two parts. In the first part of the algorithm, a DNA sequence matrix is obtained by encoding each color component, and is divided into some equal blocks and then the generated sequence of Sugeno integral fuzzy and the DNA sequence addition operation is used to add these blocks. Next, the DNA sequence matrix from the previous step is decoded and the complement operation to the result of the added matrix is performed by using Sugeno fuzzy integral. In the second part of the algorithm, the three modified color components are encrypted in a coupling fashion in such a way to strengthen the cryptosystem security. It is observed that the histogram, the correlation and avalanche criterion, can satisfy security and performance requirements (Avalanche criterion > 0.49916283). The experimental results obtained for the CVG-UGR image databases reveal the fact that the proposed algorithm is suitable for practical use to protect the security of digital image information over the Internet.
Steganography is the technique of hiding the fact that communication is taking place,
by hiding data in other data. Many different carrier file formats can be used, but digital images
are the most popular because of their frequency on the Internet. For hiding secret information in
images, there exist a large variety of steganographic techniques. Steganalysis, the detection of this
hidden information, is an inherently difficult problem.In this paper,I am going to cover different
steganographic techniques researched by different researchers.
Keywords — Cryptography, Steganography, LSB, Hash-LSB, RSA Encryption –Decryption
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
Ieee a secure algorithm for image based information hiding with one-dimension...Akash Rawat
ieee a secure algorithm for image based information hiding with one-dimensional chaotic systems.It used 1 dimensional chaotic system.ieee paper related for image encryption
Different Approach of VIDEO Compression Technique: A StudyEditor IJCATR
The main objective of video compression is to achieve video compression with less possible losses to reduce the
transmission bandwidth and storage memory. This paper discusses different approach of video compression for better transmission of
video frames for multimedia application. Video compression methods such as frame difference approach, PCA based method,
accordion function, fuzzy concept, and EZW and FSBM were analyzed in this paper. Those methods were compared for performance,
speed and accuracy and which method produces better visual quality.
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.
A NOVEL IMAGE STEGANOGRAPHY APPROACH USING MULTI-LAYERS DCT FEATURES BASED ON...ijma
Steganography is the science of hidden data in the cover image without any updating of the cover image.
The recent research of the steganography is significantly used to hide large amount of information within
an image and/or audio files. This paper proposed a new novel approach for hiding the data of secret image
using Discrete Cosine Transform (DCT) features based on linear Support Vector Machine (SVM)
classifier. The DCT features are used to decrease the image redundant information. Moreover, DCT is
used to embed the secrete message based on the least significant bits of the RGB. Each bit in the cover
image is changed only to the extent that is not seen by the eyes of human. The SVM used as a classifier to
speed up the hiding process via the DCT features. The proposed method is implemented and the results
show significant improvements. In addition, the performance analysis is calculated based on the
parameters MSE, PSNR, NC, processing time, capacity, and robustness.
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.
A High Performance Modified SPIHT for Scalable Image CompressionCSCJournals
In this paper, we present a novel extension technique to the Set Partitioning in Hierarchical Trees (SPIHT) based image compression with spatial scalability. The present modification and the preprocessing techniques provide significantly better quality (both subjectively and objectively) reconstruction at the decoder with little additional computational complexity. There are two proposals for this paper. Firstly, we propose a pre-processing scheme, called Zero-Shifting, that brings the spatial values in signed integer range without changing the dynamic ranges, so that the transformed coefficient calculation becomes more consistent. For that reason, we have to modify the initialization step of the SPIHT algorithms. The experiments demonstrate a significant improvement in visual quality and faster encoding and decoding than the original one. Secondly, we incorporate the idea to facilitate resolution scalable decoding (not incorporated in original SPIHT) by rearranging the order of the encoded output bit stream. During the sorting pass of the SPIHT algorithm, we model the transformed coefficient based on the probability of significance, at a fixed threshold of the offspring. Calling it a fixed context model and generating a Huffman code for each context, we achieve comparable compression efficiency to that of arithmetic coder, but with much less computational complexity and processing time. As far as objective quality assessment of the reconstructed image is concerned, we have compared our results with popular Peak Signal to Noise Ratio (PSNR) and with Structural Similarity Index (SSIM). Both these metrics show that our proposed work is an improvement over the original one.
Design a New Image Encryption using Fuzzy Integral Permutation with Coupled C...IJORCS
This article introduces a novel image encryption algorithm based on DNA addition combining and coupled two-dimensional piecewise nonlinear chaotic map. This algorithm consists of two parts. In the first part of the algorithm, a DNA sequence matrix is obtained by encoding each color component, and is divided into some equal blocks and then the generated sequence of Sugeno integral fuzzy and the DNA sequence addition operation is used to add these blocks. Next, the DNA sequence matrix from the previous step is decoded and the complement operation to the result of the added matrix is performed by using Sugeno fuzzy integral. In the second part of the algorithm, the three modified color components are encrypted in a coupling fashion in such a way to strengthen the cryptosystem security. It is observed that the histogram, the correlation and avalanche criterion, can satisfy security and performance requirements (Avalanche criterion > 0.49916283). The experimental results obtained for the CVG-UGR image databases reveal the fact that the proposed algorithm is suitable for practical use to protect the security of digital image information over the Internet.
Steganography is the technique of hiding the fact that communication is taking place,
by hiding data in other data. Many different carrier file formats can be used, but digital images
are the most popular because of their frequency on the Internet. For hiding secret information in
images, there exist a large variety of steganographic techniques. Steganalysis, the detection of this
hidden information, is an inherently difficult problem.In this paper,I am going to cover different
steganographic techniques researched by different researchers.
Keywords — Cryptography, Steganography, LSB, Hash-LSB, RSA Encryption –Decryption
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
Ieee a secure algorithm for image based information hiding with one-dimension...Akash Rawat
ieee a secure algorithm for image based information hiding with one-dimensional chaotic systems.It used 1 dimensional chaotic system.ieee paper related for image encryption
Different Approach of VIDEO Compression Technique: A StudyEditor IJCATR
The main objective of video compression is to achieve video compression with less possible losses to reduce the
transmission bandwidth and storage memory. This paper discusses different approach of video compression for better transmission of
video frames for multimedia application. Video compression methods such as frame difference approach, PCA based method,
accordion function, fuzzy concept, and EZW and FSBM were analyzed in this paper. Those methods were compared for performance,
speed and accuracy and which method produces better visual quality.
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.
COLOR IMAGE ENCRYPTION BASED ON MULTIPLE CHAOTIC SYSTEMSIJNSA Journal
This paper proposed a novel color image encryption scheme based on multiple chaotic systems. The ergodicity property of chaotic system is utilized to perform the permutation process; a substitution operation is applied to achieve the diffusion effect. In permutation stage, the 3D color plain-image matrix is converted to a 2D image matrix, then two generalized Arnold maps are employed to generate hybrid chaotic sequences which are dependent on the plain-image’s content. The generated chaotic sequences are then applied to perform the permutation process. The encryption’s key streams not only depend on the cipher keys but also depend on plain-image and therefore can resist chosen-plaintext attack as well as
known-plaintext attack. In the diffusion stage, four pseudo-random gray value sequences are generated by
another generalized Arnold map. The gray value sequences are applied to perform the diffusion process by bitxoring operation with the permuted image row-by-row or column-by-column to improve the encryption rate. The security and performance analysis have been performed, including key space analysis, histogram analysis, correlation analysis, information entropy analysis, key sensitivity analysis, differential analysis
etc. The experimental results show that the proposed image encryption scheme is highly secure thanks to its
large key space and efficient permutation-substitution operation, and therefore it is suitable for practical image and video encryption.
COLOR IMAGE ENCRYPTION BASED ON MULTIPLE CHAOTIC SYSTEMSIJNSA Journal
This paper proposed a novel color image encryption scheme based on multiple chaotic systems. The
ergodicity property of chaotic system is utilized to perform the permutation process; a substitution
operation is applied to achieve the diffusion effect. In permutation stage, the 3D color plain-image matrix
is converted to a 2D image matrix, then two generalized Arnold maps are employed to generate hybrid
chaotic sequences which are dependent on the plain-image’s content. The generated chaotic sequences are
then applied to perform the permutation process. The encryption’s key streams not only depend on the
cipher keys but also depend on plain-image and therefore can resist chosen-plaintext attack as well as
known-plaintext attack. In the diffusion stage, four pseudo-random gray value sequences are generated by
another generalized Arnold map. The gray value sequences are applied to perform the diffusion process by
bitxoring operation with the permuted image row-by-row or column-by-column to improve the encryption
rate. The security and performance analysis have been performed, including key space analysis, histogram
analysis, correlation analysis, information entropy analysis, key sensitivity analysis, differential analysis
etc. The experimental results show that the proposed image encryption scheme is highly secure thanks to its
large key space and efficient permutation-substitution operation, and therefore it is suitable for practical
image and video encryption
COLOR IMAGE ENCRYPTION BASED ON MULTIPLE CHAOTIC SYSTEMSIJNSA Journal
This paper proposed a novel color image encryption scheme based on multiple chaotic systems. The ergodicity property of chaotic system is utilized to perform the permutation process; a substitution
operation is applied to achieve the diffusion effect. In permutation stage, the 3D color plain-image matrix
is converted to a 2D image matrix, then two generalized Arnold maps are employed to generate hybrid chaotic sequences which are dependent on the plain-image’s content. The generated chaotic sequences are then applied to perform the permutation process. The encryption’s key streams not only depend on the
cipher keys but also depend on plain-image and therefore can resist chosen-plaintext attack as well as
known-plaintext attack. In the diffusion stage, four pseudo-random gray value sequences are generated by another generalized Arnold map. The gray value sequences are applied to perform the diffusion process by bitxoring operation with the permuted image row-by-row or column-by-column to improve the encryption rate. The security and performance analysis have been performed, including key space analysis, histogram analysis, correlation analysis, information entropy analysis, key sensitivity analysis, differential analysis etc. The experimental results show that the proposed image encryption scheme is highly secure thanks to its large key space and efficient permutation-substitution operation, and therefore it is suitable for practical image and video encryption.
Chaos Image Encryption using Pixel shuffling cscpconf
The advent of wireless communications, both inside and outside the home-office environment
has led to an increased demand for effective encryption systems. The beauty of encryption
technology comes out in more pronounced way when there is no absolute relation between
cipher and original data and it is possible to rebuild the original image in much easier way. As
chaotic systems are known to be more random and non-predictable, they can be made utilized in
achieving the encryption. The transposition technology of encryption systems requires scrambleness
behaviour in order to achieve the encryption of the data. This scrambleness behaviour can
be derived from the randomness property of chaos which can be better utilized in the techniques
like transposition system. In wireless communication systems, bandwidth utilization is an important
criterion. In order to use encryption system in wireless communication; key space plays an
important role for the efficient utilization of the bandwidth. In this paper we present a chaosbased
encryption algorithm for images. This algorithm is based on pixel scrambling where in the
randomness of the chaos is made utilized to scramble the position of the data. The position of the
data is scrambled in the order of randomness of the elements obtained from the chaotic map and
again rearranged back to their original position in decryption process. The same algoritm is
tested with two different maps and performance analysis is done to select best suited map for encription.
Comparative Performance of Image Scrambling in Transform Domain using Sinusoi...CSCJournals
With the rapid development of technology, and the popularization of internet, communication is been greatly promoted. The communication is not limited only to information but also includes multimedia information like digital Images. Therefore, the security of digital images has become a very important and practical issue, and appropriate security technology is used for those digital images containing confidential or private information especially. In this paper a novel approach of Image scrambling has been proposed which includes both spatial as well as Transform domain. Experimental results prove that correlation obtained in scrambled images is much lesser then the one obtained in transformed images.
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.
EFFICIENT SCRAMBLING-SUBSTITUTION IMAGE SECURITY SCHEME USING CHAOTIC ARNOLD-...IJCNCJournal
This paper introduces an efficient scrambling-substitution image security scheme using chaotic Arnold and
Logistic (Arnold-Logistic) maps in the discrete cosine transform (DCT). The Arnold map is employed as a
scrambling stage while the Logistic map is employed as a substitution stage. The hybrid Arnold-Logistic
mapping is performed in the DCT. The encipherment phase of the introduced DCT-based Arnold-Logistic
security scheme begins by applying the DCT to the plainimage and the resulted DCT coefficient of the
plainimage are scrambled for m iterations using the Arnold transformation. Then, the Arnold-based
transformed DCT coefficients are substituted for n iterations using the Logistic map and the inverse of
DCT (IDCT) is employed to produce the cipherimage. The decipherment phase of the introduced DCTbased Arnold-Logistic security scheme is the inverse of the encryption stage and begins by applying the
DCT to the cipherimage. The resulted DCT coefficient of the cipherimage is inversely substituted for n
iterations using the inverse Logistic map. Then, the inverse Logistic-based transformed DCT coefficients
are inversely scrambled for m iterations using the inverse Arnold map and the IDCT is employed to
produce the decrypted image. A series of test experiments are applied to investigate the introduced DCTbased Arnold-Logistic security scheme. The outcome results demonstrated the superiority of the introduced
DCT-based Arnold-Logistic security scheme from the security point of view.
Efficient Scrambling-Substitution Image Security Scheme using Chaotic Arnold-...IJCNCJournal
A distributed denial of service (DDoS) attack is one of the most common cyber threats to the Internet of Things (IoT). Several deep learning (DL) techniques have been utilized in intrusion detection systems to prevent DDoS attacks. However, their performance is greatly affected by a large class imbalance nature of the training datasets as well as the presence of redundant and irrelevant features in them. This study proposes RTL-DL, a new framework for an effective intrusion detection model based on the random oversampling technique and the Tomek-Links sampling technique (RTL), to minimize the effects of data imbalance in the CICIDS2017 dataset used to evaluate the proposed model. This study achieved 98.3% accuracy, 98.8% precision, 98.3% recall, 97.8% f-score, and 4.6% hamming loss. In comparison to current approaches, the suggested model has demonstrated promising results in identifying network threats in imbalanced data sets.
Image Steganography Using HBC and RDH TechniqueEditor IJCATR
There are algorithms in existence for hiding data within an image. The proposed scheme treats the image as a whole. Here
Integer Cosine Transform (ICT) and Integer Wavelet Transform (IWT) is combined for converting signal to frequency. Hide Behind
Corner (HBC) algorithm is used to place a key at corners of the image. All the corner keys are encrypted by generating Pseudo
Random Numbers. The Secret keys are used for corner parts. Then the hidden image is transmitted. The receiver should be aware of
the keys that are used at the corners while encrypting the image. Reverse Data Hiding (RDH) is used to get the original image and it
proceeds once when all the corners are unlocked with proper secret keys. With these methods the performance of the stegnographic
technique is improved in terms of PSNR value.
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.
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
Symmetric Image Encryption Algorithm Using 3D Rossler System........................................................1
Vishnu G. Kamat and Madhu Sharma
Node Monitoring with Fellowship Model against Black Hole Attacks in MANET.................................... 14
Rutuja Shah, M.Tech (I.T.-Networking), Lakshmi Rani, M.Tech (I.T.-Networking) and S. Sumathy, AP [SG]
Load Balancing using Peers in an E-Learning Environment ...................................................................... 22
Maria Dominic and Sagayaraj Francis
E-Transparency and Information Sharing in the Public Sector ................................................................ 30
Edison Lubua (PhD)
A Survey of Frequent Subgraphs and Subtree Mining Methods ............................................................. 39
Hamed Dinari and Hassan Naderi
A Model for Implementation of IT Service Management in Zimbabwean State Universities ................ 58
Munyaradzi Zhou, Caroline Ruvinga, Samuel Musungwini and Tinashe Gwendolyn Zhou
Present a Way to Find Frequent Tree Patterns using Inverted Index ..................................................... 66
Saeid Tajedi and Hasan Naderi
An Approach for Customer Satisfaction: Evaluation and Validation ....................................................... 79
Amina El Kebbaj and A. Namir
Spam Detection in Twitter – A Review...................................................................................................... 92
C. Divya Gowri and Professor V. Mohanraj
Encryption is used to securely transmit data in open networks. Each type of data has its own features. With the rapid growth of internet, security of digital images has become more and more important. Therefore different techniques should be used to protect confidential image data from unauthorized access. In this paper an encryption technique based on elliptic curves for securing images to transmit over public channels will be proposed. Encryption and decryption process are given in details with an example. The comparative study of the proposed scheme and the existing scheme is made. Our proposed algorithm is aimed at better encryption of all types of images even ones with uniform background and makes the image encryption scheme more secure. The output encrypted images reveal that the proposed method is robust.
Electrically small antennas: The art of miniaturizationEditor IJARCET
We are living in the technological era, were we preferred to have the portable devices rather than unmovable devices. We are isolating our self rom the wires and we are becoming the habitual of wireless world what makes the device portable? I guess physical dimensions (mechanical) of that particular device, but along with this the electrical dimension is of the device is also of great importance. Reducing the physical dimension of the antenna would result in the small antenna but not electrically small antenna. We have different definition for the electrically small antenna but the one which is most appropriate is, where k is the wave number and is equal to and a is the radius of the imaginary sphere circumscribing the maximum dimension of the antenna. As the present day electronic devices progress to diminish in size, technocrats have become increasingly concentrated on electrically small antenna (ESA) designs to reduce the size of the antenna in the overall electronics system. Researchers in many fields, including RF and Microwave, biomedical technology and national intelligence, can benefit from electrically small antennas as long as the performance of the designed ESA meets the system requirement.
PHP Frameworks: I want to break free (IPC Berlin 2024)Ralf Eggert
In this presentation, we examine the challenges and limitations of relying too heavily on PHP frameworks in web development. We discuss the history of PHP and its frameworks to understand how this dependence has evolved. The focus will be on providing concrete tips and strategies to reduce reliance on these frameworks, based on real-world examples and practical considerations. The goal is to equip developers with the skills and knowledge to create more flexible and future-proof web applications. We'll explore the importance of maintaining autonomy in a rapidly changing tech landscape and how to make informed decisions in PHP development.
This talk is aimed at encouraging a more independent approach to using PHP frameworks, moving towards a more flexible and future-proof approach to PHP development.
Key Trends Shaping the Future of Infrastructure.pdfCheryl Hung
Keynote at DIGIT West Expo, Glasgow on 29 May 2024.
Cheryl Hung, ochery.com
Sr Director, Infrastructure Ecosystem, Arm.
The key trends across hardware, cloud and open-source; exploring how these areas are likely to mature and develop over the short and long-term, and then considering how organisations can position themselves to adapt and thrive.
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.
Transcript: Selling digital books in 2024: Insights from industry leaders - T...BookNet Canada
The publishing industry has been selling digital audiobooks and ebooks for over a decade and has found its groove. What’s changed? What has stayed the same? Where do we go from here? Join a group of leading sales peers from across the industry for a conversation about the lessons learned since the popularization of digital books, best practices, digital book supply chain management, and more.
Link to video recording: https://bnctechforum.ca/sessions/selling-digital-books-in-2024-insights-from-industry-leaders/
Presented by BookNet Canada on May 28, 2024, with support from the Department of Canadian Heritage.
Let's dive deeper into the world of ODC! Ricardo Alves (OutSystems) will join us to tell all about the new Data Fabric. After that, Sezen de Bruijn (OutSystems) will get into the details on how to best design a sturdy architecture within ODC.
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...DanBrown980551
Do you want to learn how to model and simulate an electrical network from scratch in under an hour?
Then welcome to this PowSyBl workshop, hosted by Rte, the French Transmission System Operator (TSO)!
During the webinar, you will discover the PowSyBl ecosystem as well as handle and study an electrical network through an interactive Python notebook.
PowSyBl is an open source project hosted by LF Energy, which offers a comprehensive set of features for electrical grid modelling and simulation. Among other advanced features, PowSyBl provides:
- A fully editable and extendable library for grid component modelling;
- Visualization tools to display your network;
- Grid simulation tools, such as power flows, security analyses (with or without remedial actions) and sensitivity analyses;
The framework is mostly written in Java, with a Python binding so that Python developers can access PowSyBl functionalities as well.
What you will learn during the webinar:
- For beginners: discover PowSyBl's functionalities through a quick general presentation and the notebook, without needing any expert coding skills;
- For advanced developers: master the skills to efficiently apply PowSyBl functionalities to your real-world scenarios.
Search and Society: Reimagining Information Access for Radical FuturesBhaskar Mitra
The field of Information retrieval (IR) is currently undergoing a transformative shift, at least partly due to the emerging applications of generative AI to information access. In this talk, we will deliberate on the sociotechnical implications of generative AI for information access. We will argue that there is both a critical necessity and an exciting opportunity for the IR community to re-center our research agendas on societal needs while dismantling the artificial separation between the work on fairness, accountability, transparency, and ethics in IR and the rest of IR research. Instead of adopting a reactionary strategy of trying to mitigate potential social harms from emerging technologies, the community should aim to proactively set the research agenda for the kinds of systems we should build inspired by diverse explicitly stated sociotechnical imaginaries. The sociotechnical imaginaries that underpin the design and development of information access technologies needs to be explicitly articulated, and we need to develop theories of change in context of these diverse perspectives. Our guiding future imaginaries must be informed by other academic fields, such as democratic theory and critical theory, and should be co-developed with social science scholars, legal scholars, civil rights and social justice activists, and artists, among others.
"Impact of front-end architecture on development cost", Viktor TurskyiFwdays
I have heard many times that architecture is not important for the front-end. Also, many times I have seen how developers implement features on the front-end just following the standard rules for a framework and think that this is enough to successfully launch the project, and then the project fails. How to prevent this and what approach to choose? I have launched dozens of complex projects and during the talk we will analyze which approaches have worked for me and which have not.
State of ICS and IoT Cyber Threat Landscape Report 2024 previewPrayukth K V
The IoT and OT threat landscape report has been prepared by the Threat Research Team at Sectrio using data from Sectrio, cyber threat intelligence farming facilities spread across over 85 cities around the world. In addition, Sectrio also runs AI-based advanced threat and payload engagement facilities that serve as sinks to attract and engage sophisticated threat actors, and newer malware including new variants and latent threats that are at an earlier stage of development.
The latest edition of the OT/ICS and IoT security Threat Landscape Report 2024 also covers:
State of global ICS asset and network exposure
Sectoral targets and attacks as well as the cost of ransom
Global APT activity, AI usage, actor and tactic profiles, and implications
Rise in volumes of AI-powered cyberattacks
Major cyber events in 2024
Malware and malicious payload trends
Cyberattack types and targets
Vulnerability exploit attempts on CVEs
Attacks on counties – USA
Expansion of bot farms – how, where, and why
In-depth analysis of the cyber threat landscape across North America, South America, Europe, APAC, and the Middle East
Why are attacks on smart factories rising?
Cyber risk predictions
Axis of attacks – Europe
Systemic attacks in the Middle East
Download the full report from here:
https://sectrio.com/resources/ot-threat-landscape-reports/sectrio-releases-ot-ics-and-iot-security-threat-landscape-report-2024/
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
How world-class product teams are winning in the AI era by CEO and Founder, P...
Ijarcet vol-2-issue-7-2223-2229
1. ISSN: 2278 – 1323
International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
Volume 2, Issue 7, July 2013
2223
www.ijarcet.org
Abstract— Digital images have found usage in many
applications. These images may contain confidential
information and need to be protected when stored on memory
or transmitted over networks. Many techniques have been
proposed to deal with this security issues. In this paper, we
propose a new security enhancement scheme for digital
images. The scheme employs two methods: Residue Number
System (RNS) to Decimal (R/D) encoding and decoding
using the moduli set and a modified
Arnold transform algorithm. The encryption process uses
RNS to Decimal (D/R) converter (encoder) to decompose a
plain image into three residual images. The residual images
are fused together and encrypted using the modified Arnold
transform. In the decryption process, the modified Arnold
transform is used to decrypt the cipher image which is then
decomposed into three residual images. An R/D converter
(decoder) is then used to recover the plain image. The
proposed scheme is simulated on digital images of different
sizes using MATLAB. The obtained results show that the
scheme can effectively encrypt and decrypt images without
lost of any inherent information. The scheme also offers firm
resistance to statistical attacks such as histogram,
brute-force, correlation coefficient and key sensitivity. It can
be applied to anyshape of image and allow unlimited number
of iterations to be performed as opposed to best known state
of the art.
Index Terms—D/R encoder, R/D decoder, residual image,
Residue Number System, Arnold transform.
I. INTRODUCTION
The security of information and digital images has become a
major concern for the past few decades due to the rapid
advancement in internet and networking technologies.
Images have found usage in diverse areas such as medical,
military, science, engineering, art, entertainment,
advertising, and education. With the increasing use of digital
techniques for transmitting and storing images, the
fundamental issue of protecting the confidentiality, integrity
as well as the authenticity of images has become a major
concern. Over the years, various hidden and secret
communication techniques aimed at addressing this need,
have been proposed [1-15].
A lot of image scrambling techniques have been developed to
improve the security level of hidden information [1-15].
Image scrambling techniques scramble the pixel location of
digital images in such a manner that theybecome chaotic and
indistinguishable [11]. These techniques generally use
several keys for encryption and decryption and without the
correct keys and an appropriate method and attackers cannot
access the secret information even if they are able to sniff the
medium. Hence, the message remains highly secured against
unauthorised access [11].
The traditional Arnold cat map has been extensively refined
to strengthen its security [3], [11, [13]. However, these
techniques mainly apply only to square images and their
strength lie on periodicity. The techniques also merely
scramble the pixel position of the image.
Mohammad [12] proposed a block-based transformation
algorithm based on the combination of image transformation
and an encryption and decryption algorithm called Blowfish.
Katherine [5] used both the Arnold Cat Map to shuffle pixel
values and Chen’s chaotic map to change the grayscale
values of the pixels. Musheer et al. [13] proposed a new
image encryption algorithm based on three different chaotic
maps. In [13], the plain-image is first decomposed into 8x8
size blocks and then the block based shuffling of image is
carried out using 2D Cat map. Chattopadhyay et al. [3]
proposed a novel algorithm for encoding digital images by
using a circle map with 3 parameters. The algorithm [3]
showed an increase in security against cipher-text-only,
chosen-plaintext and chosen-cipher-text attacks. Minati [11]
proposed an image scrambling map based on Fibonacci and
Lucas series which can be used in various spatial domain
image processing techniques of data hiding and secret
communications.
In this paper we focus on the security mechanism of digital
image namely encryption and decryption using a modified
Arnold transform and Residue Number System (RNS). We
propose in here an image encryption and decryption
algorithm using the moduli set and
demonstrate that the algorithms successfully hide and
recover the plain image without lost of any inherent
information.
The rest of the paper is structured as follows: a brief
discussion of Arnold transform and RNS is presented in
Section 2. A detailed discussion of the proposed scheme is
covered in Section 3. Section 4 presents experimental results
and discussion on the scheme. Finally, Sections 5 and 6 look
at the concluding remarks and future works, respectively.
Enhancement of the Security of a Digital Image
using the Moduli Set
S. Alhassan, K.A. Gbolagade
2. ISSN: 2278 – 1323
International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
Volume 2, Issue 7, July 2013
2224
www.ijarcet.org
II. BACKGROUND INFORMATION
A. Arnold Transform
The Arnold transform is defined as the transformation [11]
such that;
(1)
where, and N is the size of
the digital image. (x’, y’) is the new position of the original
pixel position (x, y) of the N x N plain-image.
A new image is produced when all the points are
manipulated by Equation (1).
B. Residue Number System (RNS)
RNS comprises a set of moduli which are independent of
each other. An integer is represented by the residue of each of
the modulus and arithmetic operations are based on residues
individually. The advantage of using the RNS over the
conversional system includes “carry-free” operation, fault
tolerance, parallelism and modularity. These inherent
features make RNS to be widely used in Digital Signal
Processing (DSP) applications such as digital filtering,
convolution, fast Fourier transform and image processing
[18].
Let be a set of positive integers all
greater than 1. is called a modulus, and the n-tuple set
is called a moduli set. Consider an
integer number . For each of the modulus in
, we have ,
(which will be denoted as ). Thus the number in this
system is represented as ,
.
Given the moduli set , the number 150 can be
represented in RNS as
,
and
. Thus, the RNS
representation of 150 is thus: .
To avoid redundancy, the moduli set must be pairwise
relatively prime. Thus, for ,
where means the greatest common divisor
of .
Let , then the RNS representation is unique
for any integer . is called the dynamic
range [18], [19].
A Decimal to Residue (D/R) converter (encoder) is needed in
order to convert a decimal number to RNS representation.
C. RNS to Weighted Conversion
A Residue to Decimal (R/D) converter (decoder) is required
in other to convert from a RNS to decimal. The two method
used to convert RNS to weighted system are the Chinese
Remainder Theorem (CRT) and the Mixed Radix
Conversion (MRC). The CRT is employed in this research.
The CRT is defined as follows [19].
Given a moduli set
with for and dynamic
range , then by the CRT an integer whose
RNS representation is can be
converted from its residue form as
, (2)
where and is the multiplicative inverse of
with respect to .
A schematic diagram of the CRT is showed in Fig. 1.
Fig. 1. Schematic diagram of the CRT
For example, given the moduli set ,
, ,
Therefore by the CRT
Hence;
III. PROPOSED SCHEME
Encryption and decryption algorithms are formulated by
integrating a modified Arnold’s transform algorithm, and
the Chinese Remainder Theorem (CRT). The algorithms are
tested on both grayscale and true color images of varying
sizes through simulating with MATLAB.
3. ISSN: 2278 – 1323
International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
Volume 2, Issue 7, July 2013
2225
www.ijarcet.org
A. Encryption process
The encryption algorithm takes a plain image and transforms
it into a cipher image. The inputs to the algorithm are
(for moduli set), (a constant), (number
iterations) and (an plain image). The output of
this algorithm is an augmented cipher
image .
1) Pixel Encoding
The encoding process transforms an plain image
into an augmented encoded image by
using Equation (3).
2) Pixel Scrambling
The augmented image is then randomised by using the
modified Arnold transform presented in Equation (4) into
cipher image ;
(4)
where correspond
to the moduli set ,
and is vector refers to the size
of the image.
3) The Encryption Algorithm
The algorithm for the encryption process is as follows:
1) Input
2) Obtain the values of using
3) Using Equation (3), transform into the
augmented image .
4) For
Scramble into the cipher image using
Equation (4)
4) Save
A flow diagram of the encryption process is shown in Fig. 2.
Fig. 2. Flow diagram of the encryption process.
B. Decryption Process
The decryption process is a reverse of the encryption process.
It takes an cipher image and transforms it
into an plain image. This process has three stages;
anti-Arnold’s transform, decomposition process, and
decoding using CRT.
1) Pixel Scrambling
The pixels positions of the cipher image have to be
reorganised. This is achieved by applying Equation (4) in
reverse order. In doing this, the pixel values are returned to
their respective original positions to form the cipher
image .
2) Cipher Image Decomposition
The cipher image resulting from
scrambling process is decomposed into three cipher
images as follows in Equations (5),(6), and (7);
Let be decomposed cipher
images and the dimension of then,
(5)
(6)
(7)
In Equations (5), (6) and (7) respectively isolates three cipher
images corresponding to each of the three modulus
operations in Equation (3).
3) Pixel Decoding Using CRT
The three residual images obtained in the decomposition
process are then used to recover the pixels of the plain image.
In this regard, we implement Equation (2) using the pixels of
the decomposed images . Thus;
Given that are the residues of each original pixel
in with respect to then,
(8)
where and
, and
4) The Decryption Algorithm
The decryption algorithm is formulated as follows:
1) Input
2) Obtain using
3) For down to 1
Scramble into using Equation
4) Decompose into using
Equations (5), (6) and (7)
4) Using Equations (2) and (8) recover the
plain image from
6) Save
The complete decryption process is shown in Fig. 3.
Pixel
Encoding
Pixel
Scrambling
4. ISSN: 2278 – 1323
International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
Volume 2, Issue 7, July 2013
2226
www.ijarcet.org
Fig. 3. Flow diagram of the encryption process.
IV. EXPERIMENTAL RESULTS
In this section, a detail analysis of the proposed scheme has
been summarized. Simulations were conducted using
MALTAB. The analyses include visual testing, encoding
analysis and security analysis. Experimental results suggest
that the proposed scheme is more efficient than the proposal
in Minati, et al [11] in terms of encoding and security.
A. Visual Testing
Three images of varying size, both grayscale and colour were
used. Fig. 4 depicts test results for the images (lena (512 x
512), koala (448 x 336) and checkerboard (256 x 256)). The
visual test clearly shows the absence of similarities among
the pairs of images.
Fig. 4. Original and encrypted images
for .
Visual tests were also performed to check whether the
proposed scheme totally recovers plain images. Fig. 5 shows
the histograms of both original and decrypted images. It can
be seen from the similarities of both histograms that the
proposed scheme totally recovers plain images.
Fig. 5. Histograms of original and decrypted
images . (a) Original “lena”
histogram (upper left), (b) Decrypted “lena” histogram
(upper right), (c) Original “koala” histogram (middle left),
(d) Decrypted “koala” histogram (middle right) , (e) Original
“checkerboard” histogram (bottom left), (f) Decrypted
“checkerboard” histogram (bottom right).
B. Encoding Analysis
The pixel encoding during the encryption process achieves
two results. It reduces the pixel value and the size (in terms of
disk space) of the plain image but retains its physical. The
reduction in pixel value speeds up computation which is
useful during other image processing techniques. On the
other hand the reduction in size speeds up data transmission
across network since fewer bits are required to represent the
pixels. Table I compare the size of both plain and cipher
images when save in a JPEG format. It can be deduced from
the table that for the proposed system achieves a
reduction in size by up to 90%.
Table I. Disk sizes of plain and cipher images compared
Image Type Size(disk space)
Plain
image
Cipher
image
Compression
ratio
lena.jpg(512x512)grayscale 152 kb 26.7 kb 82.43%
Easy.bmp(640x480) colour 301 kb 31.7 kb 92.45%
pic.png(320x301) colour 163 kb 7.06 kb 95.66%
Pixel
Decoding
Pixel
Scrambling
5. ISSN: 2278 – 1323
International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
Volume 2, Issue 7, July 2013
2227
www.ijarcet.org
C. Security Analysis
In this subsection, we analyse the security and strength of our
encryption scheme. Areas assessed include histogram
analysis, keyspace, keysensitivityand correlation coefficient
analysis
1) Histogram Analysis
The histogram of an image refers to a histogram of the pixel
intensity value. It is a graph that shows the number of pixels
in an image at each different intensity value found in that
image. A cipher image is more secured against statistical
attack when its histogram conceals anyinformation about the
plain image and also completely defers from the histogram of
its plain image. Fig. 6 shows the histograms of a plain image
and its cipher image. It is very apparent from the figure that
the two histograms are completely different and thus the
histogram of the cipher image does not give any clue about
the plain image. This implies that the proposed system is
secure against histogram attack.
Fig. 6. Histograms of plain and encrypted “lena” images. (a)
Original image (upper left), (b) Encrypted image (upper
right), (c) Original histogram (bottom left), (d) Encrypted
histogram (bottom right).
2) Key Space Analysis
The brute-force attack is computationally infeasible for
cryptosystems with sufficiently large key space. The
proposed scheme uses a combination of three cipher
keys . The scheme achieves an efficient encoding
goal when . As and
a wide range of combination can be made.
However, we adapt a 56 bits key for as used in
Data Encryption Standard (DES). This gives us
possible
combination. Also, suppose an adversary try guessing a key
combination with a 1000 MIPS computer, then he/she
has . Clearly
this is a long enough time to resist brute-force attack.
3) Key Sensitivity Analysis
A good cryptosystem should be sensitive to the cipher key. A
slight change in the key value should lead to a significant
change in either plain image or cipher image. In this respect,
we present two results to illustrate the key sensitivity of the
proposed scheme. The first result shown in Fig. 5 shows that
the proposed scheme can successfullydecrypt images without
any loss of inherent information. On the other hand Fig. 7
shows decrypted images of Fig. 4 (b) with a different value of
one of the parameter while maintaining the other two. The
unsuccessful decrypted images attest to the fact that the
proposed scheme is sensitive to the cipher keys.
Fig. 7. Key sensitivity analysis (a) Decrypted image with
(b) Decrypted image with (c) Decrypted
image with
4) Correlation Coefficient Analysis
A digital image is meaningful to human vision if there is a
high correlation among adjacent pixels. Disturbing this
relationship will affect the visual identity of the image.
Among the requirements of an effective encryption scheme is
creating cipher images that have significantly low
correlation coefficient values. For this analysis, we computed
the correlation coefficients of randomly selected 1000 pairs
of two adjacent pixels (horizontal, vertical and diagonal) of
both plain and cipher images.
The correlation coefficient of pairs of adjacent pixels is as
follows [21]:
, (9)
with and
where represent grayscale value of adjacent pixels
in the image, and
,
,
6. ISSN: 2278 – 1323
International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
Volume 2, Issue 7, July 2013
2228
www.ijarcet.org
,
Applying Equation (9) on a 512 x 512 ‘lena.jpg’ grayscale
image gives the high correlation coefficient values of
0.97184002, 0.98309393, and 0.94877370, respectively for
horizontal, vertical and diagonal pairs of adjacent pixels.
Table II shows the corresponding correlation coefficient
values of cipher images generated for and
varying values of . The result shows that the cipher images
have weak correlation coefficient values (approximately
zero) among pairs of adjacent pixels.
Table II Correlation coefficients of adjacent pixels of a cipher
image
iteration Adjacent pixels
Horizontal Vertical Diagonal
1 0.02520737 0.06345870 0.03856429
2 0.03821026 0.01262754 0.04166987
3 0.02623524 0.00114685 -0.01844500
10 0.08843156 -0.01475551 0.01968406
15 -0.02460013 -0.02508439 0.01222209
V. CONCLUSION
In this paper, a new image encryption algorithm has been
presented. We hold the idea that the security of a
cryptosystem would be strengthened if pixel scrambling is
fused with encoding. Thus, the proposed scheme has two
major parts; pixel value encoding/decoding and pixel
scrambling. Experimental results reveal the following;
a) cipher images requires fewer number of bits to
represent pixels.
b) the scheme strongly resist to statistical attacks
(brute-force, correlation coefficient and histogram.
c) decryption does not depend on periodicity. Thus
the number of iterations to conduct is at the
discretion of the user.
d) the scheme is also highly sensitive to a small
change in any of the cipher keys.
The above mentioned points make our proposed scheme
outperform that proposed by Minati, et al [13].
VI. FUTURE WORK
Even though the proposed scheme is efficient in the areas
mentioned above, its drawback is the augmented cipher
image produced. Thus, cipher images require three times the
original memory allocation. A 512 x 512 plain image using
262144 bytes of memory allocation results in a 1536 x 512
(i.e. 512*3 x 512) cipher image using 786432 bytes.
Reducing the size of the cipher image without lost any
inherent information has been left as a subject of future
investigation.
REFERENCES
[1] A. Mitra, Y.V.R. Subba and S.R.M Prasanna, “A New
Image Encryption Approach using Combinational
Permutation Techniques”, International Journal of
Electrical and Computer Engineering 1:2 2006.
[2] B.A. Weyori, P.N. Amponsah and P.K. Yeboah,
“Modeling a Secured Digital Image Encryption Scheme
Using a Three Moduli Set”, Global Journal of Computer
Science and TechnologyInterdisciplinary, Vol. 12, Issue
10 Version 1.0, 2012
[3] D. Chattopadhyay, M.K. Mandal and D. Nandi,
“Symmetric key Chaotic Image Encryption using Circle
Map”, Indian Journal of Science and Technology, Vol.
4, No. 5, pp. 593-599 May, 2011.
[4] G. Peterson, “Arnold’s Cat Map”, 2003-04-10],
http://online.redwoods.cc.ca.us/instruct/darnold/m
aw/catmap.htm, 1997.
[5] K. Struss, ”A Chaotic Image Encryption”, In Spring,
Mathematics Senior Seminar, Vol. 4901, 2009.
[6] K. Shaw, “Arnold’s Cat Map”, March 2006.
[7] C. Kuo-Liang and C. Lung-Chun, “Large encrypting
binary images with higher security”, Pattern
Recognition Letters 19, No. 43, Section 4, pp. 461–468,
1998.
[8] S. Li-Ping, Q.G. Zheng, Hong-Jiang and H. Xing-Chen,
“2D Triangular Mappings and Their Applications in
Scrambling Rectangle Image”, Information Technology
Journal, 7: 40-47, 2008.
[9] Z. Linhua, L. Xiaofeng and W. Xuebing, “An image
encryption approach based on chaotic maps”, Chaos,
Solitons and Fractals 24 (2004), 759–765, 2005.
[10]S. Mazleena, I. Subariah and F.I. Ismail, “Image
Encryption Algorithm Based On Chaotic Mapping”,
Jurnal Teknologi, 39(D) Dis. 2003: 1–12, 2003.
[11]M. Minati, M. Priyadarsini, M.C. Adhikary. and K.
Sunit, “Image Encryption Using Fibonacci-Lucas
Transformation”, International Journal on
Cryptography and Information Security (IJCIS),Vol.2,
No.3, September 2012.
[12]A.B.Y. Mohammad and J. Aman, “Image Encryption
Using Block-Based Transformation Algorithm”,
IAENG International Journal of Computer Science,
35:1, IJCS_35_1_03, 2008.
[13]A. Musheer and A.M. Shamsher, “A New Algorithm of
Encryption and Decryption of Images Using Chaotic
Mapping”, International Journal on Computer Science
and Engineering, Vol.2 (1), 46-50, 2009.
[14]S. Al-Maadeed, A. Al-Ali and T. Addalla, “A New
Chaos-Based Image-Encrytion and Compression
Algorithm”. Journal of Electrical and Computer
Engineering, Vol. 2012, Article ID 179693, 11 pages,
2012.
[15] Y. Jie, “Algorithm of Image Information Hiding Based
on New Anti-Arnold Tranform and Blending in DCT”,
Department of Communication and Information
Engineering, Nanjing Institute of Technology, Nanjing,
China.
[16]S. Shekhar, H. Srivastava, and M.K. Dutta, “An
Efficient Adaptive Encryption Algorithm for Digital
Images”, International Journal of Computer and
Electrical Engineering, Vol. 4, No. 3, June 2012.
7. ISSN: 2278 – 1323
International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
Volume 2, Issue 7, July 2013
2229
www.ijarcet.org
[17]V.A.M. Pemmaraj, “RNS-To-Binary Converter for a
New Three-Moduli Set ”,
IEEE Transactions On Circuits And Systems—II:
Express Briefs, Vol. 54, No. 9, September 2007.
[18]K.A. Gbolagade and S.D. Cotofana,
“Residue-to-Decimal Converters for Moduli sets with
Common Factors”, IEEE, pp. 624-627, 2009
[19]Mi Lu, “Arithmetic and Logic in Computer Systems”,
John Wiley & Sons, Inc., Hoboken, New Jersey, 2004.
[20]A. Omondi and B. Premkumar, “Residue Number
Systems Theory and Implementation”, Imperial College
Press, 2007.
[21]K.S. Hung, “A Study on Efficient Chaotic Image
Encryption Schemes”, Rn Run Shaw Library, City
University of Hong Kong, 2007.
S. Alhassan, Department of Computer Science, Faculty of
Mathematical Sciences, University for Development Studies,
Navrongo, Ghana.
Professor K.A. Gbolagade, Department of Computer
Science, Faculty of Mathematical Sciences, University for
Development Studies, Navrongo, Ghana.