This document summarizes a novel scheme for compressed image authentication using least significant bit (LSB) watermarking and enhanced modified RC6 (EMRC6) encryption. The proposed method converts an input image to JPEG2000 format, encrypts a watermark image with EMRC6, and embeds the encrypted watermark in the compressed cover image using LSB watermarking. Test results show the watermarked image has high quality and the extracted watermark is secure. The proposed method achieves a higher PSNR than an existing method using LSB and modified RC6, increasing embedding volume and security for medical image authentication.
survey paper on object oriented cryptographic security for runtime entitiesINFOGAIN PUBLICATION
With the advent of complex systems the need for large data storage with less space utility & high performance have become the vital features. Another important concern of the data is the security which is assured via the cryptographic techniques implemented at all levels of data storage. In this survey paper we introduce the concept of security between two hierarchical data accesses and propose the concept of hierarchical cryptography between data of different classes of different hierarchies.
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.
Quantum Cryptography Approach for Resolving Cyber Threatsijtsrd
The research work focused on the future of the internet security transaction without allowing unauthorized user from accessing the secret document. The system was implemented with python flask framework been the lightest micro framework. The quantum key distribution generator model used is the BB84. Users can create account one the sender and other receiver then peered together in single communication channel. The sender attach file and send it in an encrypted manner to be received by receiver on presenting the same quantum key used for encrypting it. Once the eavesdropper click the link of the protocol, an alarm is raised and the system quantum key is change instantly and committed into the database. The other application is the Quantum Simulator, this application is used for generating a simulation for a quantum cryptography. Madubuezi Christian Okoronkwo | Onwuzo J. C | Gregory E. Anichebe "Quantum Cryptography Approach for Resolving Cyber Threats" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-5 | Issue-6 , October 2021, URL: https://www.ijtsrd.com/papers/ijtsrd46458.pdf Paper URL : https://www.ijtsrd.com/computer-science/artificial-intelligence/46458/quantum-cryptography-approach-for-resolving-cyber-threats/madubuezi-christian-okoronkwo
survey paper on object oriented cryptographic security for runtime entitiesINFOGAIN PUBLICATION
With the advent of complex systems the need for large data storage with less space utility & high performance have become the vital features. Another important concern of the data is the security which is assured via the cryptographic techniques implemented at all levels of data storage. In this survey paper we introduce the concept of security between two hierarchical data accesses and propose the concept of hierarchical cryptography between data of different classes of different hierarchies.
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.
Quantum Cryptography Approach for Resolving Cyber Threatsijtsrd
The research work focused on the future of the internet security transaction without allowing unauthorized user from accessing the secret document. The system was implemented with python flask framework been the lightest micro framework. The quantum key distribution generator model used is the BB84. Users can create account one the sender and other receiver then peered together in single communication channel. The sender attach file and send it in an encrypted manner to be received by receiver on presenting the same quantum key used for encrypting it. Once the eavesdropper click the link of the protocol, an alarm is raised and the system quantum key is change instantly and committed into the database. The other application is the Quantum Simulator, this application is used for generating a simulation for a quantum cryptography. Madubuezi Christian Okoronkwo | Onwuzo J. C | Gregory E. Anichebe "Quantum Cryptography Approach for Resolving Cyber Threats" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-5 | Issue-6 , October 2021, URL: https://www.ijtsrd.com/papers/ijtsrd46458.pdf Paper URL : https://www.ijtsrd.com/computer-science/artificial-intelligence/46458/quantum-cryptography-approach-for-resolving-cyber-threats/madubuezi-christian-okoronkwo
Ijri ece-01-01 joint data hiding and compression based on saliency and smvqIjripublishers Ijri
Global interconnect planning becomes a challenge as semiconductor technology continuously scales. Because of the increasing wire resistance and higher capacitive coupling in smaller features, the delay of global interconnects becomes large compared with the delay of a logic gate, introducing a huge performance gap that needs to be resolved A novel equalized global link architecture and driver– receiver co design flow are proposed for high-speed and low-energy on-chip communication by utilizing a continuous-time linear equalizer (CTLE). The proposed global link is analyzed using a linear system method, and the formula of CTLE eye opening is derived to provide high-level design guidelines and insights.
Compared with the separate driver–receiver design flow, over 50% energy reduction is observed.
A Survey on Different Data Hiding Techniques in Encrypted Imagesijsrd.com
In this paper, we are going to have survey on different data hiding techniques and our main focus is on†Reversible data hiding in encrypted imagesâ€Â. In recent year the security of the sensitive data has become of prime and supreme importance and concern. To protect this data or secret information from unauthorized person we use many data hiding techniques like stegnography, cryptography and RDH. In this paper we will discuss on one such data hiding technique called Reversible Data Hiding (RDH). In this instead of embedding data in encrypted images directly, some pixels are estimated before encryption so that additional data can be embedded in the estimating errors. Without the encryption key, one cannot get access to the original image. A RC4 algorithm is applied on the rest pixels of the image and a special encryption scheme is designed to encrypt the estimating errors.Our paper presents a survey on various data hiding techniques and their comparative analysis.
EVALUATING GALOIS COUNTER MODE IN LINK LAYER SECURITY ARCHITECTURE FOR WIRELE...IJNSA Journal
Due to the severe resource constraints in the Wireless Sensor Networks (WSNs), the security protocols therein, should be designed to optimize the performance maximally. On the other hand a block cipher and the mode of operation in which it operates, play a vital role in determining the overall efficiency of a security protocol. In addition, when an application demands confidentiality and message integrity, the overall efficiency of a security protocol can be improved by using the Authenticated Encryption (AE) block cipher mode of operation as compared to the conventional sequential encryption and authentication. Amongst the AE block cipher modes, the Galois Counter mode (GCM) is the latest recommended AE mode by the NIST. In this paper, we attempt at evaluating the performance of the GCM mode in the link layer security protocol for a WSN viz. TinySec and compare it with the default conventional block cipher modes of operation used therein. To the best of our knowledge ours is the first experimental evaluation of Galois Counter Mode with Advanced Encryption Standard Cipher at the link layer security architecture for WSNs.
Efficient two-stage cryptography scheme for secure distributed data storage i...IJECEIAES
Cloud computing environment requires secure access for data from the cloud server, small execution time, and low time complexity. Existing traditional cryptography algorithms are not suitable for cloud storage. In this paper, an efficient two-stage cryptography scheme is proposed to access and store data into cloud safely. It comprises both user authentication and encryption processes. First, a two-factor authentication scheme one-time password is proposed. It overcomes the weaknesses in the existing authentication schemes. The proposed authentication method does not require specific extra hardware or additional processing time to identity the user. Second, the plaintext is divided into two parts which are encrypted separately using a unique key for each. This division increases the security of the proposed scheme and in addition decreases the encryption time. The keys are generated using logistic chaos model theory. Chaos equation generates different values of keys which are very sensitive to initial condition and control parameter values entered by the user. This scheme achieves high-security level by introducing different security processes with different stages. The simulation results demonstrate that the proposed scheme reduces the size of the ciphertext and both encryption and decryption times than competing schemes without adding any complexity.
Cryptography is a process used for sending information in secret way. Goal of this process is to provide protection for information but in different way. In this paper our motive to represent a new method for protection that is generated by combination of RSA and 2 bit rotation mechanism of cryptography. There are many algorithms exist for this process. For cryptography there are algorithms like RSA, IDEA, AES, and DES but here we are using only one algorithm from these that is RSA which is enough to implement combined process using 2 bit rotation. The encrypted image is used as input for network for further implementation.RSA encrypt image with 1 bit rotation. In 1 bit rotation only 1 bit is shifted and at decrypt side shifted bit are reversed. But to make it more secure we are going to perform 2 bit rotation due to which it is more secure as compared to existing algorithm. After applying the 2 bit rotation we perform the permutation of that image that will give us encrypted image. Shivam Kumar | Dr. Ganesh D "Image Cryptography using RSA Algorithm" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-5 | Issue-4 , June 2021, URL: https://www.ijtsrd.compapers/ijtsrd42408.pdf Paper URL: https://www.ijtsrd.comcomputer-science/computer-security/42408/image-cryptography-using-rsa-algorithm/shivam-kumar
File Encryption and Hiding Application Based on AES and Append Insertion Steg...TELKOMNIKA JOURNAL
Steganography is a method of hiding secret message in other innocuous looking object so that
its presence is not revealed. In this paper, a message, which is a computer file of any type and size, is
hidden in a selected cover or carrier, which is a computer file of certain types. The steganography method
used in this paper is called append insertion steganography method. This method is chosen as an attempt
to remove the limitation of message format, which appears in many popular steganography methods. To
scramble the meaning of the hidden message, AES-256 (Rijndael algorithm) is used to encrypt the
message with a secret passphrase. A special block of bytes is used to identify and verify the original
message so it can be recovered while retaining its integrity. The C# programming language and .NET
Framework are chosen to implement the algorithm into a Windows application. In this paper, one cover file
contains exactly one message file. In the testing, five random files are used as secret message. Their
integrity is calculated using SHA-256 before hiding and after recovery. In the testing, they all retain their
integrity, proven by exact hash values. Thus, the application as the implementation of proposed algorithm
is proven feasible but only for personal use as some improvements still have to be implemented.
Security analysis of fbdk block cipher for digital imageseSAT Journals
Abstract Network security is one of the major concerns in the modern world. In this regard, a strong security technique is required to protect user data. Cryptography techniques plays an important role in secured transmission through encryption of data and thus ensuring integrity, authenticity, confidentiality of information. Several encryption algorithms have been proposed like AES (Advanced Encryption Standard), DES (Data Encryption Standard) and RSA. These provide very good encryption for text applications. However, these encryption schemes appear not to be ideal for image applications. Some algorithms like GKSBC and RC6 provide very good encryption for digital images. New techniques are emerging that are aimed at providing secured transmission of images over networks. The FBDK (Fixed Block with Dynamic Key Size) block cipher is a new cryptography technique designed using simple operations like XOR, substitutions, circular shifting. The FBDK algorithm is applicable for blocks of any size with key size being dynamic for each block. It does not involve any complex mathematical operations like modular exponentiation. It is a hybrid cryptography technique based on symmetric key and asymmetric key cryptosystems. This paper investigates the security of FBDK block cipher for digital images against brute-force attack, statistical analysis and Differential analysis attacks. In this paper, various security analysis tests has been discussed which are helpful in finding out whether the FBDK encryption algorithm can do secure encryption or not. Experimental results proves the security and efficiency of FBDK cipher for images against all aforementioned types of attacks which justifies its consideration for real time image applications. Keywords: Cryptography, Ciphers, Encryption, Security, and cryptanalysis.
A Joint Encryption/Watermarking Algorithm for Secure Image Transferijcnac
This paper presents a method combining encryption and watermarking for secure images transfer. The proposed solution gives access to the outcomes of the image integrity and of its origins as its attachment to one user even if the image is stored encrypted. This method is based on the combination of encryption algorithms public-private keys and secret keys, and watermarking. The algorithm for image encryption uses a secret key. We encrypt the secret key with an asymmetric algorithm. This encrypted secret key is then inserted into the encrypted image using watermark algorithm.
Ijri ece-01-01 joint data hiding and compression based on saliency and smvqIjripublishers Ijri
Global interconnect planning becomes a challenge as semiconductor technology continuously scales. Because of the increasing wire resistance and higher capacitive coupling in smaller features, the delay of global interconnects becomes large compared with the delay of a logic gate, introducing a huge performance gap that needs to be resolved A novel equalized global link architecture and driver– receiver co design flow are proposed for high-speed and low-energy on-chip communication by utilizing a continuous-time linear equalizer (CTLE). The proposed global link is analyzed using a linear system method, and the formula of CTLE eye opening is derived to provide high-level design guidelines and insights.
Compared with the separate driver–receiver design flow, over 50% energy reduction is observed.
A Survey on Different Data Hiding Techniques in Encrypted Imagesijsrd.com
In this paper, we are going to have survey on different data hiding techniques and our main focus is on†Reversible data hiding in encrypted imagesâ€Â. In recent year the security of the sensitive data has become of prime and supreme importance and concern. To protect this data or secret information from unauthorized person we use many data hiding techniques like stegnography, cryptography and RDH. In this paper we will discuss on one such data hiding technique called Reversible Data Hiding (RDH). In this instead of embedding data in encrypted images directly, some pixels are estimated before encryption so that additional data can be embedded in the estimating errors. Without the encryption key, one cannot get access to the original image. A RC4 algorithm is applied on the rest pixels of the image and a special encryption scheme is designed to encrypt the estimating errors.Our paper presents a survey on various data hiding techniques and their comparative analysis.
EVALUATING GALOIS COUNTER MODE IN LINK LAYER SECURITY ARCHITECTURE FOR WIRELE...IJNSA Journal
Due to the severe resource constraints in the Wireless Sensor Networks (WSNs), the security protocols therein, should be designed to optimize the performance maximally. On the other hand a block cipher and the mode of operation in which it operates, play a vital role in determining the overall efficiency of a security protocol. In addition, when an application demands confidentiality and message integrity, the overall efficiency of a security protocol can be improved by using the Authenticated Encryption (AE) block cipher mode of operation as compared to the conventional sequential encryption and authentication. Amongst the AE block cipher modes, the Galois Counter mode (GCM) is the latest recommended AE mode by the NIST. In this paper, we attempt at evaluating the performance of the GCM mode in the link layer security protocol for a WSN viz. TinySec and compare it with the default conventional block cipher modes of operation used therein. To the best of our knowledge ours is the first experimental evaluation of Galois Counter Mode with Advanced Encryption Standard Cipher at the link layer security architecture for WSNs.
Efficient two-stage cryptography scheme for secure distributed data storage i...IJECEIAES
Cloud computing environment requires secure access for data from the cloud server, small execution time, and low time complexity. Existing traditional cryptography algorithms are not suitable for cloud storage. In this paper, an efficient two-stage cryptography scheme is proposed to access and store data into cloud safely. It comprises both user authentication and encryption processes. First, a two-factor authentication scheme one-time password is proposed. It overcomes the weaknesses in the existing authentication schemes. The proposed authentication method does not require specific extra hardware or additional processing time to identity the user. Second, the plaintext is divided into two parts which are encrypted separately using a unique key for each. This division increases the security of the proposed scheme and in addition decreases the encryption time. The keys are generated using logistic chaos model theory. Chaos equation generates different values of keys which are very sensitive to initial condition and control parameter values entered by the user. This scheme achieves high-security level by introducing different security processes with different stages. The simulation results demonstrate that the proposed scheme reduces the size of the ciphertext and both encryption and decryption times than competing schemes without adding any complexity.
Cryptography is a process used for sending information in secret way. Goal of this process is to provide protection for information but in different way. In this paper our motive to represent a new method for protection that is generated by combination of RSA and 2 bit rotation mechanism of cryptography. There are many algorithms exist for this process. For cryptography there are algorithms like RSA, IDEA, AES, and DES but here we are using only one algorithm from these that is RSA which is enough to implement combined process using 2 bit rotation. The encrypted image is used as input for network for further implementation.RSA encrypt image with 1 bit rotation. In 1 bit rotation only 1 bit is shifted and at decrypt side shifted bit are reversed. But to make it more secure we are going to perform 2 bit rotation due to which it is more secure as compared to existing algorithm. After applying the 2 bit rotation we perform the permutation of that image that will give us encrypted image. Shivam Kumar | Dr. Ganesh D "Image Cryptography using RSA Algorithm" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-5 | Issue-4 , June 2021, URL: https://www.ijtsrd.compapers/ijtsrd42408.pdf Paper URL: https://www.ijtsrd.comcomputer-science/computer-security/42408/image-cryptography-using-rsa-algorithm/shivam-kumar
File Encryption and Hiding Application Based on AES and Append Insertion Steg...TELKOMNIKA JOURNAL
Steganography is a method of hiding secret message in other innocuous looking object so that
its presence is not revealed. In this paper, a message, which is a computer file of any type and size, is
hidden in a selected cover or carrier, which is a computer file of certain types. The steganography method
used in this paper is called append insertion steganography method. This method is chosen as an attempt
to remove the limitation of message format, which appears in many popular steganography methods. To
scramble the meaning of the hidden message, AES-256 (Rijndael algorithm) is used to encrypt the
message with a secret passphrase. A special block of bytes is used to identify and verify the original
message so it can be recovered while retaining its integrity. The C# programming language and .NET
Framework are chosen to implement the algorithm into a Windows application. In this paper, one cover file
contains exactly one message file. In the testing, five random files are used as secret message. Their
integrity is calculated using SHA-256 before hiding and after recovery. In the testing, they all retain their
integrity, proven by exact hash values. Thus, the application as the implementation of proposed algorithm
is proven feasible but only for personal use as some improvements still have to be implemented.
Security analysis of fbdk block cipher for digital imageseSAT Journals
Abstract Network security is one of the major concerns in the modern world. In this regard, a strong security technique is required to protect user data. Cryptography techniques plays an important role in secured transmission through encryption of data and thus ensuring integrity, authenticity, confidentiality of information. Several encryption algorithms have been proposed like AES (Advanced Encryption Standard), DES (Data Encryption Standard) and RSA. These provide very good encryption for text applications. However, these encryption schemes appear not to be ideal for image applications. Some algorithms like GKSBC and RC6 provide very good encryption for digital images. New techniques are emerging that are aimed at providing secured transmission of images over networks. The FBDK (Fixed Block with Dynamic Key Size) block cipher is a new cryptography technique designed using simple operations like XOR, substitutions, circular shifting. The FBDK algorithm is applicable for blocks of any size with key size being dynamic for each block. It does not involve any complex mathematical operations like modular exponentiation. It is a hybrid cryptography technique based on symmetric key and asymmetric key cryptosystems. This paper investigates the security of FBDK block cipher for digital images against brute-force attack, statistical analysis and Differential analysis attacks. In this paper, various security analysis tests has been discussed which are helpful in finding out whether the FBDK encryption algorithm can do secure encryption or not. Experimental results proves the security and efficiency of FBDK cipher for images against all aforementioned types of attacks which justifies its consideration for real time image applications. Keywords: Cryptography, Ciphers, Encryption, Security, and cryptanalysis.
A Joint Encryption/Watermarking Algorithm for Secure Image Transferijcnac
This paper presents a method combining encryption and watermarking for secure images transfer. The proposed solution gives access to the outcomes of the image integrity and of its origins as its attachment to one user even if the image is stored encrypted. This method is based on the combination of encryption algorithms public-private keys and secret keys, and watermarking. The algorithm for image encryption uses a secret key. We encrypt the secret key with an asymmetric algorithm. This encrypted secret key is then inserted into the encrypted image using watermark algorithm.
The different use and negative effects of computers in education.
P.S. Guys kindly click like if the article is helpful and IF you're going to download the slides/presentation.Thank you.
Design and Implementation of Lifting Based Wavelet and Adaptive LSB Steganogr...Dr. Amarjeet Singh
Image steganography is an art of hiding images
secretly within another image. There are several ways of
performing image steganography; one among them is the
spatial approach. The most popular spatial domain approach
of image steganography is the Least Significant Bit (LSB)
method, which hides the secret image pixel information in the
LSB of the cover image pixel information. In this paper a
LSB based steganography approach is used to design
hardware architecture for the Image steganography. The
Discrete Wavelet Transform (DWT) is used here to transform
the cover image into higher and lower wavelet coefficients
and use these coefficients in hiding the secret image. the
design also includes encryption of secret image data, to
provide a higher level of security to the secret image. The
steganography system involving the stegno module and a
decode module is designed here. The design was simulated,
synthesized and implemented on Artix -7 FPGA. The
operation hiding and retrieving images was successfully
verified through simulations.
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.
Design and Implementation of Data Hiding Technique by Using MPEG Video with C...Editor IJMTER
This paper proposes a technique on data hiding approaches using compressed MPEG video files.
This approach hides the message bits by modulating the quantization scale of constant bit rate MPEG
videos. Payload is calculated for each macroblock and proposes to achieve one message bit per
macroblock. Macroblock level feature variables are calculated.To find the association between
macroblock level feature variables and value of a hidden message bit, a Second Order Multivariate
regression model is used. To achieve the very high prediction accuracy, the regression model is used by
the decoder. To decode the message, a feature variable of MBs from the encoded bit stream are computed
by the decoder and expands them to the second order and uses the model weights to predict the message
bits. This solution provides very high precision accuracy in predicting the message bits . The proposed
technique is analyzed in term of quality distortion, excessive bit rate, message pay load and message
extraction accuracy. The proposed solution is better in terms of message payload while causing the less
distortion and reduced compression overheads compare to the previous works.
Data Hiding Using Green Channel as Pixel Value IndicatorCSCJournals
Steganography is an art of hiding the existence of data that is it hides the secret message in the digital cover medium. This paper introduces an improved algorithm that uses pixel value indicator technique for the concealment of the secret message in most significant bits (MSBs) of the cover image. Here, Green channel serves as a pixel value indicator for hiding the secret message in 5th and 6th bits of Blue channel or Red channel of RGB cover image. If Green channel has even number of 1's, Blue channel is used for embedding the secret message otherwise Red channel is used for the embedding process. The experimental results of the proposed method are obtained using MATLAB R2017a. The experimental results obtained show that the stego-image formed is of great quality having high PSNR value and it provides good security and in distinguishability.
A secure image steganography based on burrows wheeler transform and dynamic b...IJECEIAES
In modern public communication networks, digital data is massively transmitted through the internet with a high risk of data piracy. Steganography is a technique used to transmit data without arousing suspicion of secret data existence. In this paper, a color image steganography technique is proposed in spatial domain. The cover image is segmented into non-overlapping blocks which are scattered among image size window using Burrows Wheeler transform before embedding. Secret data is embedded in each block according to its sequence in the Burrows Wheeler transform output. The hiding method is an operation of an exclusive-or between a virtual bit which is generated from the most significant bit and the least significant bits of the cover pixel. Results of the algorithm are analyzed according to its degradation of the output image and embedding capacity. The results are also compared with other existing methods.
Honest Reviews of Tim Han LMA Course Program.pptxtimhan337
Personal development courses are widely available today, with each one promising life-changing outcomes. Tim Han’s Life Mastery Achievers (LMA) Course has drawn a lot of interest. In addition to offering my frank assessment of Success Insider’s LMA Course, this piece examines the course’s effects via a variety of Tim Han LMA course reviews and Success Insider comments.
June 3, 2024 Anti-Semitism Letter Sent to MIT President Kornbluth and MIT Cor...Levi Shapiro
Letter from the Congress of the United States regarding Anti-Semitism sent June 3rd to MIT President Sally Kornbluth, MIT Corp Chair, Mark Gorenberg
Dear Dr. Kornbluth and Mr. Gorenberg,
The US House of Representatives is deeply concerned by ongoing and pervasive acts of antisemitic
harassment and intimidation at the Massachusetts Institute of Technology (MIT). Failing to act decisively to ensure a safe learning environment for all students would be a grave dereliction of your responsibilities as President of MIT and Chair of the MIT Corporation.
This Congress will not stand idly by and allow an environment hostile to Jewish students to persist. The House believes that your institution is in violation of Title VI of the Civil Rights Act, and the inability or
unwillingness to rectify this violation through action requires accountability.
Postsecondary education is a unique opportunity for students to learn and have their ideas and beliefs challenged. However, universities receiving hundreds of millions of federal funds annually have denied
students that opportunity and have been hijacked to become venues for the promotion of terrorism, antisemitic harassment and intimidation, unlawful encampments, and in some cases, assaults and riots.
The House of Representatives will not countenance the use of federal funds to indoctrinate students into hateful, antisemitic, anti-American supporters of terrorism. Investigations into campus antisemitism by the Committee on Education and the Workforce and the Committee on Ways and Means have been expanded into a Congress-wide probe across all relevant jurisdictions to address this national crisis. The undersigned Committees will conduct oversight into the use of federal funds at MIT and its learning environment under authorities granted to each Committee.
• The Committee on Education and the Workforce has been investigating your institution since December 7, 2023. The Committee has broad jurisdiction over postsecondary education, including its compliance with Title VI of the Civil Rights Act, campus safety concerns over disruptions to the learning environment, and the awarding of federal student aid under the Higher Education Act.
• The Committee on Oversight and Accountability is investigating the sources of funding and other support flowing to groups espousing pro-Hamas propaganda and engaged in antisemitic harassment and intimidation of students. The Committee on Oversight and Accountability is the principal oversight committee of the US House of Representatives and has broad authority to investigate “any matter” at “any time” under House Rule X.
• The Committee on Ways and Means has been investigating several universities since November 15, 2023, when the Committee held a hearing entitled From Ivory Towers to Dark Corners: Investigating the Nexus Between Antisemitism, Tax-Exempt Universities, and Terror Financing. The Committee followed the hearing with letters to those institutions on January 10, 202
A Strategic Approach: GenAI in EducationPeter Windle
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
Embracing GenAI - A Strategic ImperativePeter Windle
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
How to Make a Field invisible in Odoo 17Celine George
It is possible to hide or invisible some fields in odoo. Commonly using “invisible” attribute in the field definition to invisible the fields. This slide will show how to make a field invisible in odoo 17.
2. S. J. J. Mary et al.
1723
becomes intense. Digital Asset and Right Management Systems (DARMS) is intended to be used with data that
are either encrypted or compressed. Encryption schemes are used to provide security to digital data like text,
image, audio, video, etc. Encryption is a process in which the input is combined with a key to produce an output
that is not in the human readable form. Similarly watermarking methods are used to minimize forgery in the
digital data that is being stored in a computer or being transferred over the network.
The method of embedding an image inside the cover image for the purpose of security is called watermarking.
Larobina explained various medical image formats that can be used for watermarking [1]. As compressed im-
ages are mainly used as input in digital watermarking algorithms, Rabbani described a lossless image compres-
sion format for storing images of any type that occupies less storage space in [2]. To overcome the weaknesses
of digital signature for content authentication, many researchers proposed watermarking techniques for digital
data authentication. In digital signature, content modification or data tampering can be found out. But the loca-
tion where such alteration has been found could not be identified [3]-[6].
In addition to watermarking techniques, encryption schemes increase the reliability and security of digital
content. Depending on the technology used, cryptographic methods are difficult to detect. The usage of an addi-
tional key makes it more robust. Watermarking is said to be a form of communication, since the basic task of
watermarking is the reliable embedding and detection of digital content. Secure delivery of content is a major
task of cryptography in addition to providing reliability. The decrypted form of the content has no protection in
cryptography, but it is complimented by watermarking techniques by embedding the watermark inside the digi-
tal content. Thus the “analog hole” created by encryption schemes can be sealed by watermarking techniques
[7]-[10].
Lot of researchers combined watermarking schemes with encryption algorithms to increase the security of the
digital content. RSA, Paillier, Goldwasser-Micali, Elgamelare asymmetric encryption schemes with homomor-
phic property and they have their downsides. There is loss of compression efficiency in the output cipher text if
the message size is small and compression loss is reduced, but the payload capacity decreases if the message
size is large in the above said schemes [11]-[14].
The downsides of those are overcome by RC4 symmetric stream cipher scheme with homomorphic property
which was proposed by Subramanyam et al. [15]. The chances of data trade-off attacks which are based on the
key scheduling algorithm are caused by low sampling resistance in RC4 [16]. The symmetric block cipher RC5
which is more secure and robust than RC4 due to its increased number of rounds to work with the watermarking
schemes used in [15] was proposed by Gayathri I.K. [17]. With less than 18 rounds RC5-64 algorithm (64-bit
blocks) is prone to differential attack, when the chosen plain text is 244
[17]. RC6 is being used instead of RC5
due to its increased use of registers which was proposed by Kukoo Anna Mathew [18].
Elashry in [19] proposed a method in which LSB is integrated with RC6 to provide security with good image
quality. But RC6 undergoes differential linear attack, statistical attack and X2
attack [20]-[22]. Later to over-
come the disadvantages of RC6 an Enhanced version of RC6 (ERC6) is used. It has 8 working registers and it
acts on 256-bits input/output blocks.ERC6 encrypts at about 17.3 MB/sec making it about 1.7 times faster than
RC6. But it is prone to X2
attack up to 44 rounds [23].
So in order to overcome the drawbacks of ERC6 a modified version of RC6 (MRC6) is being found with bet-
ter performance. It uses sixteen working registers instead of four registers in RC6. MRC6 achieves greater secu-
rity at fewer rounds thus increasing the throughput with minimum encryption/decryption time [24]. But the En-
hanced Modified Version of RC6 (EMRC6) has 32 working registers instead of sixteen in MRC6, and integer
multiplication is used as an extra primitive operation which intensifies the diffusion obtained per round thus at-
taining high security and maximum throughput in less number of rounds [25].
LSB technique is used where the embedding process is simple. It is one in which the image pixels of the cover
image are replaced by the bits from the secret message. Embedding can be done in any of the eight bits in a bit
plane. Bamatraf proposed a LSB technique where the hiding of data is done in the third and fourth LSB of the
cover image [26].
Singh et al. proposed a watermarking method using replacement of second LSB with inverse of LSB which is
a powerful method for image authentication and copyright protection [27]. Puneet analysed various image wa-
termarking using LSB algorithms and the results show that the hiding of the secret data in the first bit is without
noticeable distortion on it [28].
The current work is intended to convert the input into JPEG2000 format and encrypt the watermark with LSB
watermarking scheme and then watermarking the encrypted watermark with EMRC6 encryption scheme so as to
3. S. J. J. Mary et al.
1724
provide content authentication.
Figure 1 shows the basic model for content authentication, in which the cover image is a color image and the
watermark image is the one that has to be embedded in to the cover/input image. The watermark image in en-
crypted using any encryption scheme and the output encrypted watermark is then watermarked using any spatial
or frequency domain watermarking algorithm producing the final watermarked output.
2. Proposed System
The proposed system is aimed at combining LSB watermarking method with Enhanced Modified Version of
RC6 (EMRC6) encryption scheme to provide content authentication for compressed images. The cover image “I”
may be of any image type and is given as input to the JPEG2000 encoder. The JPEG2000 encoder processes the
input image by undergoing five stages by dividing the image into rectangular tile that does not overlap and then
it undergoes discrete wavelet transformation (DWT) and is quantized and is further divided into different bit
planes.
This is then block coded with optimized truncation which results in stream of compressed byte which is
packed into different wavelet packets. This JPEG2000 encoded output is represented as “Ij”.
The watermark image represented as “Wm” is encrypted using Enhanced Modified Version of RC6 (EMRC6).
The encryption process takes the input watermark and is converted into stream of bits. This is encrypted using
the key “K” which is generated from the key of “b” bytes supplied by the user. The encryption process has a
round function which has 16 rotations per round. The input stream undergoes 18 such rounds to produce the
output ciper “Ew”. The Encoded cover image “Ij” and the output cipher “Ew” are given as input to the LSB wa-
termarking scheme
The LSB embedding scheme replaces few characteristics of the last bit of each pixel of the cover image “Ij”
with few information from the watermark image “Wm”. A pseudo Random Number generator (PRNG) that pro-
duces a seed value is used with the LSB embedding in order to overcome the attacks on LSB embedding since
LSB is a fragile scheme. Thus the output of the embedding process is the watermarked image “We” which is
highly secure and has good image quality. The Peak signal to noise ratio (PSNR) value is high and the Mean
Square Error (MSE) value is low when compared to the previous method where LSB technique is integrated
with MRC6. This method increases embedding volume and make the watermark more secure thus providing
content authentication for compressed medical images. Figure 2 shows the embedding of the watermark in the
encrypted image.
Figure 1. Basic model for content authentication.
Figure 2. Embedding of watermark.
4. S. J. J. Mary et al.
1725
2.1. JPEG2000 Encoder
In the Proposed algorithm the input is any image and this image is converted into JPEG 2000 compressed code
image using JPEG 2000 encoder by undergoing five steps. First the image is split into non overlapping tiles
which are unsigned values and is reduced by a constant value. Then Discrete wavelet Transformation (DWT) is
done followed by quantization and further the co-efficient are split into different bit-planes using embedded
block coding with optimized truncation (EBCOT) coding method. As a final step compressed stream are packed
into different wavelet packages [29].
2.2. Enhanced Modified Rivest Cipher 6 (EMRC6)
EMRC6 (32/18/16) has 32 registers each with ‘w’ bit words, whereas the working registers is less in numbers in
the previous version of RC6. EMRC6 has an integer multiplication as an extra basic operation which increases
the diffusion attained per round. This provides high security, increase in number of rounds and greater through-
put. It can process 1024 bits as a single block per round. The EMRC6 algorithm has three basic modules.
1) EMRC6 key expansion.
2) EMRC6 encryption.
3) EMRC6 decryption.
2.2.1. EMRC6 Key Expansion
The key expansion algorithm of EMRC6 is almost similar to the one in the previous version of RC6. But the main
difference in EMRC6 is, more number of words are extracted from the key supplied by the user. The key of length
“b” bytes where 0 ≤ b ≤ 255 is supplied by the user. To this user defined key, enough zeroes are added to make the
length of the key equal to non-zero integral values and stored in [ ] [ ] [ ]U 0 ,U 1 , ,U b 1− . These user supplied “b”
bytes of keys is stored in another array “V” in the little endian format as [ ] [ ] [ ]V 0 ,V 1 , ,V c 1− . The values
from “V” table is expanded and stored in a table [ ] [ ] [ ]T 0 ,T 1 , ,T 16r 31+ , thus producing 16r + 32 sub keys.
The left barrel shifter shifts the sub keys by three positions and the resultant is stored again in “T” table. The
below algorithm shows the key expansion algorithm of EMRC6.
The two values Pw and Qw are called magic constants and is defined as
( )( )e 2 2w
wP odd= − and (1)
( )( )Ø 1 2 .w
wQ odd= − (2)
where
e = 2.7182818 and Ø = 1.618033 is called the golden constant.
2.2.2. EMRC6 Encryption Algorithm
EMRC6 encryption module convert the input into the cipher output using the generated sub key. It uses 32
working registers ( [ ] [ ] [ ]R 0 ,R 1 , ,R 31 ) to store the initial input and the final output. The steps involved in
Input: An array V[0,1,2,…,c-1] that contains ‘b’ bytes of user supplied key converted to ‘c’ words and ‘r’ number of rounds.
Output: An array S[0,1,2,…,16r+31] that has w-bit round keys
Procedure:
T[0] = Pw // Pw value is defined in equation (1).
For i = 1 to 16r+31 do
T[i] = T[i-1] + Qw // Qw value is defined in equation (2).
R1 = R2 = i = j = 0
z= 3 * Max (c, 16r+32)
for y = l to z do
{
R1 = T[i] = (T[i] + R1 + R2) <<< 3
R2 = V[j] = (V[j] + R1+ R2) <<< (Rl+R2)
i = (i + 1) Mod(16r+31)
j = (j + l) Mod c
}
5. S. J. J. Mary et al.
1726
EMRC6 encryption is
• Addition (+)
• Bitwise EX-OR operation
• Left rotation, a <<< b.
• Integer Multiplication modulo 2n
(*).
The 32 working registers contain the initial input for the encryption process represented as R[ ]. The first byte
of the input is stored in the LSB of first register i.e., R[0] and the last byte is stored in the MSB of the last regis-
ter. For example, the assignment from right to left is parallel as (R1, R2, R3, R4) = (R2, R3, R4, R1).
2.2.3. EMRC6 Decryption Algorithm
The EMRC6 decryption process reproduces the original content from the cipher using the sub key. This is the
inverse operation of EMRC6 encryption. The following algorithm represents the EMRC6 decryption process.
Various steps involved in decryption process are
Input: Array R [0,1,2,…, 31] has the plaintext in it ,‘r’ number of rounds and ‘w’ bit round keys from T[0,1,2,…, 16r + 31].
Output: cipher text in register, R[0,1,…,31]
Procedure:
R2 = R2 + T[0], R4 = R4 + T[1], R6 = R6 + T[2], R8 = R8 + T[3],
R10 = R10 + T[4], R12 = R12 + T[5], R14 = R14 + T[6], R16 = R16 + T[7],
R18 = R18 + T[8], R20 = R20 + T[9], R22 = R22 + T[10], R24 = R24 + T[11],
R26 = R26 + T[12], R28 = R28 + T[13], R30 = R30 + T[14], R32 = R32 + T[15],
For i = 1 to r do
{
k1 = (R2 * (2R2 + 1)) <<< log w
l1 = (R4 * (2R4 + 1)) <<< log w
m1 = (R6 * (2R6 + 1)) <<< log w
n1 = (R8 * (2R8 + 1)) <<< log w
t1 = (R10 * (2R10 + 1)) <<< log w
u1 = (R12 * (2R12 + 1)) <<< log w
v1 = (R14 * (2R14 + 1)) <<< log w
z1 = (R16 * (2R16 + 1)) <<< log w
k = (R18 * (2R18 + 1)) <<< log w
l = (R20 * (2R20 + 1)) <<< log w
m = (R22 * (2R22 + 1)) <<< log w
n = (R24 * (2R24 + 1)) <<< log w
t = (R26 * (2R26 + 1)) <<< log w
u = (R28 * (2R28 + 1)) <<< log w
v = (R30 * (2R30 + 1)) <<< log w
z = (R32* (2R32 + 1)) <<< log w
R1 = ((R1⊕ k1) <<< l1) + T[16i]
R3 = ((R3 ⊕ l1 ) <<< k1) + T[16i + 1]
R5 = ((R5 ⊕ m1) <<< n1) + T[16i + 2]
R7 = ((R7 ⊕ n1) <<< m1) + T[16i + 3]
R9 = ((R9 ⊕ t1 ) <<< u1 ) + T[16i + 4]
R11 = ((R11 ⊕ u1) <<< t1) + T[16i + 5]
R13 = ((R13 ⊕ v1) <<< z1) + T[16i + 6]
R15 = ((R15 ⊕ z1) <<< v1) + T[16i + 7]
R17 = ((R17 ⊕ k) <<< l) + T[16i + 8]
R19 = ((R19 ⊕ l ) <<< k ) + T[16i + 9]
R21 = ((R21 ⊕ m) <<< n) + T[16i + 10]
R23 = ((R23 ⊕ n) <<< m) + T[16i + 11]
R25 = ((R25 ⊕ t ) <<< u) + T[16i + 12]
R27 = ((R27 ⊕ u ) <<< t) + T[16i + 13]
R29 = ((R29 ⊕ v) <<< z) + T[16i + 14]
R31 = ((R31 ⊕ z) <<< v) + T[16i + 15]
(R1, R2, ..., R31, R32) = (R2, R3, …, R32, R1)
}
R1 = R1 + T[16r + 16], R3 = R3 + T[16r + 17], R5 = R1 + T[16r + 18], R7 = R3 + T[16r + 19],
R9 = R1 + T[16r + 20], R11 = R3 + T[16r + 21], R13 = R1 + T[16r + 22], R15 = R3 + T[16r + 23],
R17 = R1 + T[16r + 24], R19 = R3 + T[16r + 25], R21 = R1 + T[16r + 26], R23 = R3 + T[16r + 27],
R25 = R1 + T[16r + 28], R27 = R3 + T[16r + 29], R29= R1 + T[16r + 30], R31 = R3 + T[16r + 31],
6. S. J. J. Mary et al.
1727
• Integer subtraction (−)
• Bit wise EX-OR
• Integer multiplication
• Right shift, a >>> b.
2.3. LSB Watermarking
Least significant Bit (LSB) technique is based on exchanging few characteristics of each pixel’s last bit with
some of the information from the input image. The embedding can be done in any of the bit plane, but LSB em-
bedding focuses on embedding in the least significant bit of each pixel. This bit plane is chosen in order to re-
duce the difference in colors in the watermarked image. Basically LSB embedding scheme is fragile and hence it
can be easily broken. But it is being widely used because of its simplicity. This overcomes cropping attack but
undergoes a number of attacks if all the LSB is changed to one. For example, Let “01110100” be the bits to be
embedded into the least significant bit (LSB) of the input image values. The watermarked output obtained using
LSB technique for the given sample input is shown in Table 1.
Input: Array R[0, 1, 2, …, 31] has the plaintext in it ,‘r’ number of rounds and ‘w’ bit round keys from T[0, 1, 2, …, 16r + 31].
Output: plaintext stored in register, R[0, 1, …, 31]
Procedure:
R31 = R31 − T[16r + 31], R29 = R29 − T[16r + 30], R27 = R27 − T[16r + 29], R25 = R25 − T[16r + 28],
R24 = R24 − T[16r + 27], R23 = R23 − T[16r + 26], R19 = R19 − T[16r + 25], R17 = R17 − T[16r + 24],
R15 = R15 − T[16r + 23], R13 = R13 − T[16r + 22], R11 = R11 − T[16r + 21], R9 = R9 − T[16r + 20],
R7 = R7 − T[16r + 19], R5 = R5 − T[16r + 18], R3 = R3 − T[16r + 17], R1 = R1 − T[16r + 16],
{ For i = r down to 1 do
{
(R1, R2, …, R31, R32) = (R32, R1, …., R31)
z = (R32 * (R32 + 1)) <<< log w
v = (R30 * (2R30 + 1)) <<< log w
u = (R28 * (2R28 + 1)) <<< log w
t = (R26 * (2R26 + 1)) <<< log w
n = (R24 * (2R24 + 1)) <<< log w
m = (R22 * (2R22 + 1)) <<< log w
l = (R20 * (2R20 + 1)) <<< log w
k = (R18 * (2R18 + 1)) <<< log w
z1 = (R16 * (2R16 + 1)) <<< log w
v1 = (R14 * (2R14 + 1)) <<< log w
u1 = (R12 * (2R12 + 1)) <<< log w
t1 = (R10 * (2R10 + 1)) <<< log w
n1 = (R8 * (2R8 + 1)) <<< log w
m1 = (R6 * (2R6 + 1)) <<< log w
l1 = (R4 * (2R4 + 1)) <<< log w
k1 = (R2 * (2R2 + 1)) <<< log w
R31 = ((R31) − T[16i + 15] >>> z) ⊕ v
R29 = ((R29) − T[16i + 14] >>> v) ⊕ z
R27 = ((R27) − T[16i + 13] >>> u) ⊕ t
R25 = ((R25) − T[16i + 12] >>>t) ⊕ u
R23 = ((R23) − T[16i + 11] >>>n) ⊕ m
R21 = ((R21) − T[16i + 10] >>>m) ⊕ n
R19 = ((R19) − T[16i + 9] >>>l) ⊕ k
R17 = ((R17) − T[16i + 8] >>> k) ⊕ l
R15 = ((R15) − T[16i + 7] >>> z1) ⊕ v1
R13 = ((R13) − T[16i + 6] >>> v1) ⊕ z1
R11 = ((R11) − T[16i + 5] <<< u1) ⊕ t1
R9 = ((R9) − T[16i + 4] <<< t1) ⊕ u1
R7 = ((R7) − T[16i + 3] <<< n1) ⊕ m1
R5 = ((R5) − T[16i + 2] <<< m1) ⊕ n1
R3 = ((R3) − T[16i + 1] <<< l1) ⊕ k1
R1 = ((R1) − T[16i] <<< k1) ⊕ l1
}
R32 = R32 − T[15], R30 = R30 − T[14], R28 = R28 − T[13], R26 = R26 − T[12],
R24 = R24 − T[11], R22 = R22 − T[10], R20 = R20 − T[9], R18 = R18 − T[8],
R16 = R16 − T[7], R14 = R14 − T[6], R12 = R12 − T[5], R10=R10− T[4]
R8 = R8 − T[3], R6=R6− T[2], R4 = R4 − T[1], R2=R2− T[0]
7. S. J. J. Mary et al.
1728
2.3.1. LSB Embedding Algorithm
The steps in LSB embedding algorithm is listed below
• “Ew” is read and is stored as matrix element “Ew[][]”.
• “Ij” is normalized and rounded off to the adjacent integer with a bit precision of eight.
• Determine the size of “Ew” and “Ij”.
• Expand “Ew[][]” such that the size of watermark is same as that of “Ij”. The Components in “Ew[][]” are in-
dividual bits that represent pixel values of the “Ew”.
• “Ij” is split into pixel and stored in “Ij[][]”.
• LSB of each element from “Ij[][]” is replaced by the matching elements from “Ew[][]”.
• The resultant matrix is converted into the watermarked image.
2.3.2. LSB Extraction Algorithm
The steps in LSB extraction process is listed below
• “We” is read and the pixel values are stored in “We[][]”.
• Find the size of “We”.
• An expansion matrix is formed by extracting the LSB of each pixels from “We[][]”.
• The bits per pixel of “We” are determined and the bits are clustered based on it. The expansion matrix con-
sists of repeated pattern of bits at constant intervals.
• Thus multiple watermarks are recovered inside the expansion matrix.
3. Analyzing and Evaluating the Performance
3.1. Analyzing EMRC6 Encryption
EMRC6 is better than any other version of RC6 due to its increased complexity, security and throughput. The
EMRC6 encryption is three times faster than RC6 and the throughput is high when compared to its predecessor
MRC6. Table 2 shows the comparison between various parameters of EMRC6 and the parameters of other ver-
sion of RC6.
Table 1. Watermarked image values.
Input Watermark Watermarked Output
00011100 0 00011100
11110010 1 11110011
01011000 1 01011001
10011010 1 10011011
00100111 0 00100110
11101000 1 11101001
11001000 0 11001000
00110101 0 00110100
Table 2. Comparisons of RC6 versions.
Parameters RC6 ERC6 MRC6 EMRC6
w/r/b 32/20/16 32/16/16 32/16/16 32/18/16
Working Registers 4 8 16 32
Block size (bits) 128 256 512 1024
No. of rounds 20 16 16 18
Rotations per round 2 4 8 16
Encryption time
(sec. for 4 MB)
0.281 0.251 0.201 0.171
Throughput (Mb/s) 10.8 17.3 19.5 34.13
Sub-keys 2r + 4 4r + 8 8r + 16 16r + 32
Speed 1 unit 1.7 times faster than RC6 Twice faster than RC6 Thrice faster than RC6
Attack Linear, differential, chi-squared attack chi-squared attack chi-squared attack No attack
8. S. J. J. Mary et al.
1729
3.2. Security Issues
The diffusion per round in achieved by the use of multiplication which provides high security in lesser number
of rounds. Because of sixteen rotations per round the complexity of the algorithm is increased which proportion-
ally increases the security. It is robust against differential linear attack, statistical attack and chi-square attack
due to its increased no of rotations per round [25].
Figure 3 shows that the encryption time is increased with increase in the size of the data block. But when
compared with the previous version of RC6 it has got better encryption time. Figure 4 shows the throughput
Figure 3. Consequence of encryption time over varied data size.
Figure 4. Consequence of number of rounds on throughput.
9. S. J. J. Mary et al.
1730
decreases with increased number of rounds which gives the conclusion that the security is high with more num-
ber of rounds since security and throughput are inversely proportional.
3.3. Correlation Coefficient
Correlation Coefficient is the value between pixels in the same place in the input image and watermarked image.
Correlation Coefficient is used to measure the image quality between the pixels in the original image and wa-
termarked cipher image at a particular location.
Coefficient Correlation ( ),I Cγ is found using Equation (3).The Expectation and variant value to be substi-
tuted in Equation (3) is found using Equation (4) and Equation (5).
( )( ) ( )( )( )
( ) ( )
m m w w
IC
m w
E W E W E E E
D W D E
γ
− −
= (3)
( ) ( )( )
2
1
1
i
N
m m mi
D W W E W
n =
= −∑ (4)
( ) ( )1
1
i
N
m mi
E W W
n =
= ∑ (5)
where,
( )mE W & ( )wE E are Expectation of pixel from mW and wE
( )mD W & ( )wD E are Variants of pixel from mW and wE .
Table 3 shows the correlation coefficient of three sample images for the existing method and the proposed
method which concludes that the correlation coefficient is low for the proposed method is low when compared
with other encryption scheme.
3.4. Analysis of LSB Embedding Efficiency
The image quality of the output watermarked cipher image “We” is found using the PSNR and MSE calculation.
Equation (6) depicts the PSNR calculation and Equation (7) calculates the MSE value.
2
10
255
PSNR 10log
MSE
=
(6)
( ) ( )( )
21 1
0 0
1
MSE , ,
m n
j ex y
I x y W x y
mn
− −
= =
= −∑ ∑ (7)
where
m is the row values of the images.
n is the column values of the images.
x, y is the pixel values of the images.
The PSNR value from Table 4 predicts that the PSNR value of the sample images is high when compared
with the previous method and hence the quality of the watermarked cipher image is of good quality for the pro-
posed method. Table 5 includes the output of each level and the overall output, for the test images.
Table 3. Comparison of correlation coefficient.
Image Nike Lenna Girls
Correlation coefficient of Existing Method 0.0001749 0.0033 0.00016
Correlation coefficient of Proposed Method 0.00016 0.0021 0.00002
Table 4. PSNR of the watermarked encrypted Image.
IMAGE Nike.png Lenna.bmp Girls.jpg
PSNR of Existing Method 41.82 42.31 45.06
PSNR of Proposed Method 43.6 44.1 47.2
10. S. J. J. Mary et al.
1731
Table 5. Overall output for test data.
Image
Watermark
Encrypted watermark
Watermarked cipher output
Size of the Original Image 45 Kb 657 Kb 68 Kb
Size of the Watermark Image 6 Kb 18 Kb 10 Kb
PSNR of Watermarked cipher
image (Proposed System)
43.6 44.1 47.2
PSNR of Watermarked cipher
image (existing System)
41.82 42.31 45.06
Correlation coefficient of encrypted
watermark (Proposed System)
0.00016 0.0021 0.00002
Correlation coefficient of encrypted
watermark (existing System)
0.0001749 0.0033 0.00016
4. Conclusions
The combination of EMRC6 (Enhanced modified version of RC6) Scheme with LSB (Lest Significant bit) is a
proper method for medical image authentication. The input image is converted into JPEG2000 image to make
encryption and embedding scheme simple. EMRC6 provides high security since it withstands almost all attacks
which was imposed on previous RC6 version. The security level of watermark is increased by this encryption
and the watermark embedding capacity also improved. Even though LSB is a fragile watermark scheme, it is
best suited for content authentication. But the watermark is encrypted to make the watermark robust. So that ex-
traction of the watermark is difficult. The encryption speed of EMRC6 is high and the throughput is high when
compared with its predecessor. The correlation coefficient is very low proving that the image quality is good.
After embedding the PSNR value is high and MSE value is low when compared with other algorithm.
The upcoming work is to provide copyright production using a frequency domain algorithm and EMRC6 en-
cryption scheme.
References
[1] Larobina, M. and Murino, L. (2014) Medical Image File Formats. Journal of Digital Imaging, 27, 200-206.
11. S. J. J. Mary et al.
1732
[2] Rabbani, M. and Joshi, R. (2002) An Overview of the JPEG 2000 Still Image Compression Standard. Signal Process-
ing: Image Communication, 17, 3-48. http://dx.doi.org/10.1016/S0923-5965(01)00024-8
[3] Wang, M.S. and Chen, W.C. (2007) A Majority-Voting Based Watermarking Scheme for Colour Image Tamper De-
tection and Recovery. Computer Standards & Interfaces, 29, 561-570. http://dx.doi.org/10.1016/j.csi.2006.11.009
[4] Eggers, J.J. and Girod, B. (2001) Blind Watermarking Applied to Image Authentication. Proceedings of IEEE Interna-
tional Conference on Acoustics, Speech, and Signal Processing, 3, 1977-1980.
http://dx.doi.org/10.1109/icassp.2001.941335
[5] Lin, E.T., Podilchuk, C.I. and Delp, E.J. (2000) Detection of Image Alterations Using Semi-Fragile Watermarks. In:
Electronic Imaging, International Society for Optics and Photonics, 152-163. http://dx.doi.org/10.1117/12.384969
[6] Kundur, D. and Hatzinakos, D. (1999) Digital Watermarking for Telltale Tamper Proofing and Authentication. In:
Proceedings of the IEEE, 87, 1167-1180. http://dx.doi.org/10.1109/5.771070
[7] Nadeem, A. and Javed, M.Y. (2006) A Performance Comparison of Data Encryption Algorithms. International Con-
ference on Information and Communication Technologies, 27-28 August 2005, 84-89.
[8] Cox, I.J., Doërr, G. and Furon, T. (2006) Watermarking Is Not Cryptography. In: Shi, Y. and Jeon, B., Eds., Digital
Watermarking, Vol. 4283, Springer Berlin/Heidelberg, 1-15. http://dx.doi.org/10.1007/11922841_1
[9] Farah, T., Hermassi, H., Rhoouma, R. and Belghith, S. (2013) Watermarking and Encryption Scheme to Secure Mul-
timedia Information. World Congress on Computer and Information Technology (WCCIT), Sousse, 22-24 June 2013,
1-5. http://dx.doi.org/10.1109/wccit.2013.6618760
[10] Bouslimi, D., Coatrieux, G. and Roux, Ch. (2011) A Joint Watermarking/Encryption Algorithm for Verifying Medical
Image Integrity and Authenticity in Both Encrypted and Spatial Domains. Annual International Conference of the
IEEE Engineering in Medicine and Biology Society, Boston, 30 August 2011-3 September 2011, 8066-8069.
http://dx.doi.org/10.1109/iembs.2011.6091989
[11] ElGamal, T. (1985) A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. IEEE Trans-
actions on Information Theory, 31, 469-472. http://dx.doi.org/10.1109/TIT.1985.1057074
[12] Rivest, R., Shamir, A. and Adleman, L. (1978) A Method for Obtaining Digital Signatures and Public-Key Cryptosys-
tems. Commun. ACM, 21, 120-126. http://dx.doi.org/10.1145/359340.359342
[13] Paillier, P. (1999) Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. Lecture Notes in
Computer Science, 1592, 223-238. http://dx.doi.org/10.1007/3-540-48910-x_16
[14] Goldwasser, S. and Micali, S. (1984) Probabilistic Encryption. Journal of Computer and System Sciences, 28, 270-299.
http://dx.doi.org/10.1016/0022-0000(84)90070-9
[15] Subramanyam, A.V., Emmanuel, S. and Kankanhalli, M.S. (2010) Compressed Encrypted Domain JPEG2000 Image
Watermarking. IEEE International Conference on Multimedia and Expo (ICME), Suntec City, 19-23 July 2010,
1315-1320. http://dx.doi.org/10.1109/icme.2010.5583571
[16] Fluhrer, S., Mantin, I. and Shamir, A. (2001) Weaknesses in the Key Scheduling Algorithm of RC4. In: Vaudenay, S.
and Youssef, A.M., Eds., Selected Areas in Cryptography, Springer, Berlin, 1-24.
[17] Gayathri, I.K. (2013) Digital Watermarking Using RC5 Encryption on JPEG2000 Images. International Journal of
Engineering Research & Technology, 2, 1439-1445.
[18] Mathew, K.A. (2013) Watermarking of JPEG2000 Compressed Images with Improved Encryption. International
Journal of Computer Applications Technology and Research, 2, 245-249.
[19] Elashry, F., Allah, O.S.F., Abbas, A.M., El-Rabaie, S. and El-Samie, F.E.A. (2009) Homomorphic Image Encryption.
Journal of Electronic Imaging, 18, 033002. http://dx.doi.org/10.1117/1.3167847
[20] Borst, J., Preneel, B., Vandewalle, J. and Leuven, K.U. (1999) Linear Cryptanalysis of RC5 and RC6. In: Knudsen, L.,
Ed., Fast Software Encryption, Lecture Notes in Computer Science, Springer-Verlag, Berlin, 16-30.
[21] Gilbert, H., Handschuh, H., Joux, A. and Vaudenay, S. (2000) A Statistical Attack on RC6. In: Goos, G., Hartmanis, J.,
van Leeuwen, J. and Schneier, B., Eds., Fast Software Encryption, Springer-Verlag, Berlin, 64-74.
[22] Miyaji, A. and Takano, T. (2007) Evaluation of the Security of RC6 against the x2-Attack. IEICE Transactions on
Fundamentals of Electronics Communications and Computer Sciences, E90-A, 22-28.
[23] Ragab, A.H.M., Ismail, N.A. and Faragallah, O.S. (2001) Enhancement and Implementation of RC6 Block Cipher for
Data Security. Electronic Engineering Bulletin, No. 21, 133-137.
[24] El-Fishawy, N., Danaf, T. and Zaid, O. (2004) A Modification of RC6TM
Block Cipher Algorithm for Data Security
(MRC6). International Conference on Electrical, Electronic and Computer Engineering, Cairo, 5-7 September 2004,
222-226. http://dx.doi.org/10.1109/iceec.2004.1374428
[25] Khanapur, N.H. and Patro, A. (2015) Design and Implementation of Enhanced Version of MRC6 Algorithm for Data
Security. International Journal of Advanced Computer Research (IJACR), 5, 225-232.
12. S. J. J. Mary et al.
1733
[26] Bamatraf, A., Ibrahim, R. and Salleh, M.N.B.M. (2010) Digital Watermarking Algorithm Using LSB. 2010 Interna-
tional Conference on Computer Applications and Industrial Electronics (ICCAIE), Kuala Lumpur, 5-8 December 2010,
155-159. http://dx.doi.org/10.1109/iccaie.2010.5735066
[27] Singh, A., Jain, S. and Jain, A. (2013) Digital Watermarking Method using Replacement of Second Least Significant
Bit (LSB) with Inverse of LSB. International Journal of Emerging Technology and Advanced Engineering, 3, 121-124.
[28] Kr Sharma, P. and Rajni (2012) Analysis of Image Watermarking Using Least Significant Bit Algorithm. International
Journal of Information Sciences and Techniques (IJIST), 2, 95-101.
[29] Wu, H. and Ma, D. (2004) Efficient and Secure Encryption Schemes for JPEG 2000. IEEE International Conference
on Acoustics, Speech and Signal Processing, 5, 869-872.
Submit your manuscript at: http://papersubmission.scirp.org/