Search

At present, there is a growing emphasis on safeguarding image data, yet conventional encryption methods are full of numerous limitations. In order to tackle the limitations of conventional color image encryption methodologies, such as inefficiency and insufficient security, this paper designs an expedited encryption method for color images that uses DNA coding in conjunction with multiple chaotic systems. The encryption algorithm proposed in this paper is based on three-dimensional permutation, global scrambling, one-dimensional diffusion and DNA coding. First of all, the encryption algorithm uses three-dimensional permutation algorithms to scramble the image, which disrupts the high correlation among the image pixels. Second, the RSA algorithm and the SHA-256 hashing algorithm are utilized to derive the starting value necessary for the chaotic system to produce the key. Third, the image is encrypted by using global scrambling and one-dimensional diffusion. Finally, DNA coding rules are used to perform DNA computing. The experimental results indicate that the encryption scheme exhibits a relatively weak inter-pixel correlation, uniform histogram distribution, and an information entropy value approaching eight. This shows that the proposed algorithm is able to protect the image safely and efficiently. [ABSTRACT FROM AUTHOR]

In today's rapidly evolving digital landscape, secure data transmission and exchange are crucial for protecting sensitive information across personal, financial, and global infrastructures. Traditional cryptographic algorithms like RSA and AES face increasing challenges due to the rise of quantum computing and enhanced computational power, necessitating innovative approaches for data security. We explored a novel encryption scheme leveraging the quadratic chaotic map (QCM) integrated with the Fibonacci sequence, addressing key sensitivity, periodicity, and computational efficiency. By employing chaotic systems' inherent unpredictability and sensitivity to initial conditions, the proposed method generates highly secure and unpredictable ciphers suitable for text and image encryption. We incorporated a combined sequence from the Fibonacci sequence and QCM, providing enhanced complexity and security. Comprehensive experimental analyses, including noise and occlusion attack simulations, demonstrate the scheme's robustness, resilience, and practicality. The results indicated that the proposed encryption framework offers a secure, efficient, and adaptable solution for digital data protection against modern computational threats. [ABSTRACT FROM AUTHOR]

Social media blockchain is emerging as a promising solution to deal with privacy issues, by putting user privacy in edge nodes rather than centralized nodes. Under the protection of information encryption, only those who have cryptographic keys can get access to key information. This work aims at multimedia information in social media blockchain and utilizes the RSA encryption mechanism to construct the information encryption system. Due to the resilience of biometric features, the biometric cryptographic keys are not easy to be fabricated. Thus, this paper proposes a biometric keys-enhanced multimedia encryption algorithm for social media blockchain. First of all, the wiener filter is adopted to make some preprocessing operations to images, such as noise reduction. On this basis, the discrete wavelet transform is adopted to extract feature representation from images, and nonlinear approximation of contourlet transform is adopted to make feature fusion. Next, cryptographic keys can be generated from the fused biometric feature vectors to encrypt biometric data. Finally, some simulation experiments are conducted to evaluate performance of the proposal from three aspects: key generation time, security level and encryption-decryption time complexity. For key generation time, processing speed of the proposal is approximately 1–2 ms per sample. For security level, the proposal can reach an index value beyond 95% which is higher than comparison methods. For encryption-decryption time complexity, the proposal is about 30% lower than comparison methods. [ABSTRACT FROM AUTHOR]

In the rapid evolving digital landscape, the imperative to ensure data security has never been more crucial. This paper addresses the pressing challenges in data security by introducing a file encryption management system, leveraging a modified advanced encryption standard (AES) algorithm with reduced round iterations and bit permutation. This system aims to comprehensively secure various file types, providing a dependable solution for file exchange. Our findings reveal substantial improvements in both encryption and decryption processes using the reduced-round permutationbased AES (RRPBA). The adapted algorithm demonstrates a significant 38.8% acceleration in encryption time and a remarkable 44.86% improvement in decryption time, positioning it as a pivotal component for efficient file operations within the management system. Moreover, the throughput assessments showcase a remarkable 33.73% improvement in encryption and 23.72% in decryption, outperforming the original AES, emphasizing the algorithm's superior computational effectiveness, signaling positive implications for future high-performance applications. In conclusion, the study not only addresses critical security challenges but also presents a viable solution with tangible speed advantages for file encryption and decryption processes within digital file management systems. [ABSTRACT FROM AUTHOR]

In the present time of increasing digital communication, the images are widely used over the multimedia networks for sharing of information. At the same time to ensure the security of images during transmission of data becomes a great challenge for cryptographers. In this paper, a new multi-phases image encryption algorithm based on the RSA cryptosystem and modified random matrix affine cipher (MRMAC) is proposed. The Chen's hyperchaotic system and Arnold cat map are used to create more distraction from the relationship between the original image and ciphered image. The Chen's hyperchaotic system is used for diffusion, whereas the Arnold cat map is used for increasing the confusion among pixels. In this proposed algorithm the image ciphering is carried out in different phases. Firstly the given image is encrypted using RSA algorithm with large primes. Secondly, in modified RMAC, random blocks of random entries using Chen's hyperchaotic system are generated and are diffused with image pixels using bitwise XOR operation. Also, we create confusion of pixels within these diffused blocks, and confusion of blocks as well using parameters of MRMAC. The randomness in the algorithm is improved using MRMAC is advantage against differential attacks. Further, the Arnold cat map is used to enhance the level of confusion. Since, it is tremendously difficult to factorize the product of large prime numbers, therefore, the security of data in RSA algorithm increases tremendously. For the proper decryption of ciphered images, one must have exact values of keys and their correct order. It is impossible to guess the decrypted image even with a very small change in a single key. The results obtained in statistical and security analysis shows that the proposed algorithm has a huge key space, extreme security and key sensitivity, which proves that scheme is efficient and highly secure. [ABSTRACT FROM AUTHOR]

We introduce a novel image encryption and decryption algorithm for multiple images incorporating multiple parameter fractional discrete cosine transform (MPFrDCT), 3D Arnold transform and RSA cryptosystem. Before encryption, the images are changed into their indexed formats by removing their color maps. The indexed formats of the images are taken as the red, green and blue channel of an RGB image. Firstly, the RGB image is taken as the input of 3D Arnold transform. The 3D Arnold transform not only dislocates the pixel positions, but also changes the pixel values. Mathematically, the 3D map performs both permutation as well as substitution. The distorted image is now encrypted using RSA cryptosystem which is a public key cryptosystem. The RSA cryptosystem makes the image secure in public domain as the hard problem is the factorization of large primes which is unbreakable. Lastly, the domain of the encrypted image is changed to frequency domain using MPFrDCT. If the secret keys are known to an unauthorized person, the encryption algorithm is still secure as the security of the presented cryptosystem depends upon the secret keys and the arrangements of the secret keys. The proposed image encryption algorithm is storage efficient. The statistical and simulation analysis are conducted to evaluate the robustness of the presented encryption and decryption processes. [ABSTRACT FROM AUTHOR]

With the rapid evolution of telecommunication technologies, new means to share patients' medical images have consistently developed, leading to changes in their protection strategies. Consequently, researchers are paying attention to increasing security and privacy of sensitive medical images. However, brute-force, geometric and non-geometric attacks and unlawful manipulation have occurred in recent years. This paper attempts to propose a robust and hybrid encryption approach using improved Vigenere cipher and RSA that helps enhance security and integrity in medical images and protect sensitive data. The medical images come from different modalities such as X-ray, CT and MRI. The traditional public and private keys for the RSA algorithm is enhanced by adding a second key to the medical image. The second key and RSA keys are used to encode and decode the image which makes the decryption process considerably more difficult with correct key combinations. By incorporating the second key, the proposed approach addresses the challenges related to confidentiality and security in medical image transmission. Therefore, the proposed approach shows promising results in enhancing security and providing good performance of image encryption/decryption processes. [ABSTRACT FROM AUTHOR]

With the development of quantum communication technology, Shor's algorithm is expected to crack RSA encryption. Quantum communication will change the method of classical encryption in the future. We propose a quantum image encryption method via reversible quantum logic gates computing as quantum computing is reversible. An entangled pair of qubits are used for data transmission. The plaintext image is encrypted into an encrypted image via the quantum gate by using superdense coding to encrypt and transmit the operating quantum gate. The encrypted image is decoded by reversible computing, which is expected to provide a way for quantum image encryption. [ABSTRACT FROM AUTHOR]

This investigation delineates an innovative approach to fortify the secure key exchange process by integrating the robustness of the RSA algorithm with the unpredictability of a chaotic system, thereby advancing the security framework for color image encryption. Within this scheme, encryption keys are derived from a chaotic system, the initial conditions of which are dynamically modulated by the delta feature extracted from the source image. Such a design ensures that the system's behavior inherently adapts to the input image. The initial values and parameters governing the five-dimensional chaotic system are securely transmitted from sender to recipient via the RSA algorithm. Subsequently, diffusion and confusion processes are orchestrated through the application of two uniquely computed key matrices, which operate on the image at the column and row levels, respectively. This mechanism is instrumental in altering pixel values throughout the image. Performance evaluation of the proposed algorithm is quantified by several metrics: a high Number of Pixels Change Rate (NPCR) value of 99.621% illustrates its efficacy in pixel value modification, while a Peak Signal-to-Noise Ratio (PSNR) value of 8.898 implies the retention of image quality post-encryption. Furthermore, an Unified Average Changing Intensity (UACI) value of 33.823% signifies the algorithm's proficiency in introducing substantial variations in pixel intensities. The results corroborate the algorithm's competency in encrypting color images, underpinning its utility in diverse applications that necessitate stringent data and image protection measures against unauthorized access. [ABSTRACT FROM AUTHOR]

Protecting digital data, especially digital images, from unauthorized access and malicious activities is crucial in today's digital era. This paper introduces a novel approach to enhance image encryption by combining the strengths of the RSA algorithm, homomorphic encryption, and chaotic maps, specifically the sine and logistic map, alongside the self-similar properties of the fractal Sierpinski triangle. The proposed fractal-based hybrid cryptosystem leverages Paillier encryption for maintaining security and privacy, while the chaotic maps introduce randomness, periodicity, and robustness. Simultaneously, the fractal Sierpinski triangle generates intricate shapes at different scales, resulting in a substantially expanded key space and heightened sensitivity through randomly selected initial points. The secret keys derived from the chaotic maps and Sierpinski triangle are employed for image encryption. The proposed scheme offers simplicity, efficiency, and robust security, effectively safeguarding against statistical, differential, and brute-force attacks. Through comprehensive experimental evaluations, we demonstrate the superior performance of the proposed scheme compared to existing methods in terms of both security and efficiency. This paper makes a significant contribution to the field of digital image encryption, paving the way for further exploration and optimization in the future. [ABSTRACT FROM AUTHOR]

Wireless sensor networks (WSNs) have up until now faced many challenges because of their open, wide-ranging, and resource-limited nature, including security, efficiency, and energy consumption. In the military system, it is essential to provide high-level security to the significant data over wireless network which is proved to be unreliable public communications. To solve the above problem, high level of security with minimum complexity should be applied to be adequate to limited capabilities of transmission system. This paper presents a new algorithm named (SRS) for encrypting transmitted military images to keep them from getting hacked or broken by WSN. The SRS algorithm is designed to be lightweight, fast, and secure, taking into consideration the limited capabilities of the transmission system. It is implemented as a public key cryptosystem specifically designed for image encryption. The algorithm consists of two parts: encryption and decryption. The proposed system suggested some equations and calculations that are applied to the plain and coded images after being transmitted over the WSN. The results of testing the simulation model demonstrate the effectiveness of the system by evaluation using various metrics such as Signal-to-Noise Ratio (SNR), Mean Squared Error (MSE), and Peak Signal-to-Noise Ratio (PSNR). Overall, the paper presents a new encryption algorithm, SRS, specifically designed for securing military images transmitted over wireless sensor networks. The algorithm aims to provide a balance between security, efficiency, and energy consumption, considering the resource-limited nature of WSNs. The simulation results indicate the improvement of the proposed system by 13 %, 10 %, and 55 % in packet delivery ratio (PDR), throughput, and dropping ratio, respectively, and it shows that the suggested SRS method increased execution time by 67 % compared to RSA based algorithm [ABSTRACT FROM AUTHOR]

Steganography is the practice of hiding data, such as images, videos, or text, within a cover image without it being detectable by the human eye. Several factors, such as the capacity, security, and robustness of the technique, are essential when transferring information using this method. In this study, we propose a new approach to image steganography that improves the Least Significant Bit (LSB) technique by utilizing images of 24 bits in each pixel. Improving the capacity and security of LSB-based steganography requires a combination of techniques, such as indirect embedding, embedding in multiple channels, and applying cryptographic and compression techniques. This approach conducts by encrypting each compressed secret message bit with the most significant bit of the red channel and then saving the output bit (hidden bit) in the least significant bit of the (green/blue) channel according to the row value (odd/ even). To further security, the suggested approach uses multi-level encryption; employs RSA to encrypt the secret message before applying the Huffman compression and encrypting the hidden bit by (XOR/XNOR) in the embedding method based on the row value of the pixel. Meanwhile, it is planned to use the Huffman coding technique to shorten the length of the encrypted message that will be inserted in the cover image. For the color photos in this work, the standard images were acquired from a standard dataset (USC-SIPI). The suggested approach performs better when measured in terms of mean square error (MSE), peak signalto- noise ratio (PSNR), and comparison to findings from related prior efforts. [ABSTRACT FROM AUTHOR]

Cloud file sharing (CFS) has become one of the important tools for enterprises to reduce technology operating costs and improve their competitiveness. Due to the untrustworthy cloud service provider, access control and security issues for sensitive data have been key problems to be addressed. Current solutions to these issues are largely related to the traditional public key cryptography, access control encryption or attribute-based encryption based on the bilinear mapping. The rapid technological advances in quantum algorithms and quantum computers make us consider the transition from the tradtional cryptographic primitives to the post-quantum counterparts. In response to these problems, we propose a lattice-based Ciphertext-Policy Attribute-Based Encryption(CP-ABE) scheme, which is designed based on the ring learing with error problem, so it is more efficient than that designed based on the learing with error problem. In our scheme, the indirect revocation and binary tree-based data structure are introduced to achieve efficient user revocation and dynamic management of user groups. At the same time, in order to further improve the efficiency of the scheme and realize file sharing across enterprises, the scheme also allows multiple authorities to jointly set up system parameters and manage distribute keys. Furthermore, by re-randomizing the user's private key and update key, we achieve decryption key exposure resistance(DKER) in the scheme. We provide a formal security model and a series of security experiments, which show that our scheme is secure under chosen-plaintext attacks. Experimental simulations and evaluation analyses demonstrate the high efficiency and practicality of our scheme. [ABSTRACT FROM AUTHOR]

• The effect of synchronisation on the master-slave NNs with time delay is examined. • The NN's chaotic attractor is reconstructed using the fractal interpolation. • Reconstructed chaotic sequence is applied in image encryption. • Image encryption is carried out using RSA algorithm. • Various statistical measures are used to verify the efficacy. This paper examines synchronization of delayed chaotic neural networks with impulsive control, event-triggered impulsive control, and event-triggered delayed impulsive control. Lyapunov-based event-triggered mechanism is constructed to derive few sufficient conditions in terms of Linear Matrix Inequalities (LMIs). The feedback and event-triggered gain matrices are evaluated with the help of numerical packages. The fractal interpolation functions are employed to reconstruct the chaotic sequence of the neural networks since the chaotic attractor has self-similar properties and coincides with the fractal functions. In this study, a linear fractal interpolation is used to reconstruct both the master-slave chaotic attractor and the encrypted chaotic attractor, with optimized scaling factors. Finally, an application of the image encryption algorithm is given in terms of RSA public-key cryptosystems, permutation, and finite field diffusion for the chaotic sequence generated by fractal interpolation functions. [ABSTRACT FROM AUTHOR]

Abstract Background The Internet of things (IoT) is the network of different objects or “things” containing sensors, software, and other technologies used to exchange data between devices and systems over the cloud. Such systems and networks should be provided with a proper cryptographic methodology to block unauthorized data transmission access. This issue is considered an essential challenge of resources that are shared on the data communication network, that is its security. So, in this study, a cryptosystem is proposed to maintain the security level of such systems with a new idea depending on DNA cryptography and DNA mixing. Results In this study, the proposed cryptosystem is based on the RSA algorithm and DNA cryptography concepts with a novel idea for mixing DNA strands obtained from encoding medical image and report to enhance the security level through the IoT networks. This system achieved a proper result in reconstructing images with high quality. The similarity between the original data and the restored one reached 92% through 18 s. Conclusions Such a proposed cryptosystem provided the feasibility of data security in network security, especially for E-health care through IoT system to help medical teamwork in handling medical data between hospitals safely. The result showed that RSA is a fast, efficient algorithm that can be utilized safely in cryptography schemes.

Exploring high‐safety but convenient encryption and decryption technologies to combat threats of information leakage is urgently needed but remains a great challenge. Here, a synergistically time‐ and temperature‐resolved information coding/decoding solution based on functional photonic inks is demonstrated. Encrypted messages can be stored into multiple channels with dynamic‐color patterns, and information decryption is only enabled at appointed temperature and time points. Notably, the ink can be easily processed into quick‐response codes and multipixel plates. With high transparency and responsive color variations controlled by ink compositions and ambient temperatures, advanced 3D stacking multichannel coding and Morse coding techniques can be applied for multi‐information storage, complex anticounterfeiting, and information interference. This study paves an avenue for the design and development of dynamic photonic inks and complex encryption technologies for high‐end anticounterfeiting applications. [ABSTRACT FROM AUTHOR]

The billions of bits of information are transferred each second through the internet every day. The information may be text, image, audio or video etc, accordingly, we need some protection mechanism while sharing confidential data. Generally, RSA algorithm is used for encrypting the Secret images. However, the security provided by Elliptic Curve Cryptography (ECC) is higher with lower sized key than the RSA algorithm. So, this article proposes an extended Elliptic Curve encryption approach for encrypting the secret images. In this system, the secret image is partitioned into three color image planes such as Red, Green and Blue. By applying Radix-64 encoding and Mapping table, these planes are converted into elliptic curve points and then these points are encrypted using ECC algorithm. Again, these points are applied to the Radix-64 decoding and the mapping table to get ciphered-image. At last, the key parameters such as a, b, p and Generator point (G) are embedded in the last four pixel positions of the ciphered-image. In order to get the original secret image, the recipient must extract these key parameters from the encrypted image and then apply the remaining processes to the encrypted image in the opposite order. Experimental results tested using MATLAB R2021b and it shows that the NPCR and UACI values are 99.54% and 28.73 % and better quality feature is attained since the entropy value is almost closer to eight. So, the proposed image encryption has robust capacity to fight against the differential attack. [ABSTRACT FROM AUTHOR]

Various security threats are encountered when keys are transmitted in public channels. In this paper, we propose an image encryption algorithm based on complex network scrambling and multi-directional diffusion. Combining the idea of public key cryptography, the RSA algorithm is used to encrypt the key related to plaintext. The algorithm consists of three stages: key generation stage, complex network scrambling stage, and multi-directional diffusion stage. Firstly, during the key generation phase, SHA-512 and the original image are used to generate plaintext-related information, which is then converted to plaintext-related key through transformation mapping. Secondly, in the complex network scrambling stage, the chaotic random matrix establishes the node relationships in the complex network, which is then used to construct an image model based on the complex network, and then combines pixel-level and block-level methods to scramble images. Finally, in the multi-directional diffusion stage, the multi-directional diffusion method is used to perform forward diffusion, middle spiral diffusion, and backward diffusion on the image in turn to obtain the final ciphertext image. The experimental results show that our encryption algorithm has a large keyspace, the encrypted image has strong randomness and robustness, and can effectively resist brute force attack, statistical attack, and differential attack. [ABSTRACT FROM AUTHOR]

Background: The Internet of things (IoT) is the network of different objects or "things" containing sensors, software, and other technologies used to exchange data between devices and systems over the cloud. Such systems and networks should be provided with a proper cryptographic methodology to block unauthorized data transmission access. This issue is considered an essential challenge of resources that are shared on the data communication network, that is its security. So, in this study, a cryptosystem is proposed to maintain the security level of such systems with a new idea depending on DNA cryptography and DNA mixing. Results: In this study, the proposed cryptosystem is based on the RSA algorithm and DNA cryptography concepts with a novel idea for mixing DNA strands obtained from encoding medical image and report to enhance the security level through the IoT networks. This system achieved a proper result in reconstructing images with high quality. The similarity between the original data and the restored one reached 92% through 18 s. Conclusions: Such a proposed cryptosystem provided the feasibility of data security in network security, especially for E-health care through IoT system to help medical teamwork in handling medical data between hospitals safely. The result showed that RSA is a fast, efficient algorithm that can be utilized safely in cryptography schemes. [ABSTRACT FROM AUTHOR]

Chaos-based cryptosystems have been an active area of research in recent years. Although these algorithms are not standardized like AES, DES, RSA, etc., chaos-based cryptosystems like Chebyshev polynomials can provide additional security when used with standard public key cryptosystems like RSA and El-gamal. Standard encryption algorithms such as AES have always been the primary choice, but when it comes to image or video encryption, many researchers recommend chaos-based encryption techniques due to their computational efficiency. This paper presents a survey on the most up-to-date chaos-based image encryption techniques and classifies them into spatial, temporal and spatiotemporal domains for better understanding. The significant improvements in the field of image encryption are discussed. In addition, comparative analysis is performed to validate the evaluation matrices for quantifying the encryption algorithms' security and performance in recent papers. [ABSTRACT FROM AUTHOR]

The advancements made in Internet of Things (IoT) is projected to alter the functioning of healthcare industry in addition to increased penetration of different applications. However, data security and private are challenging tasks to accomplish in IoT and necessary measures to be taken to ensure secure operation. With this background, the current paper proposes a novel lightweight cryptography method for enhance the security in IoT. The proposed encryption algorithm is a blend of Cross Correlation Coefficient (CCC) and Black Widow Optimization (BWO) algorithm. In the presented encryption technique, CCC operation is utilized to optimize the encryption process of cryptography method. The projected encryption algorithm works in line with encryption and decryption processes. Optimal key selection is performed with the help of Artificial Intelligence (AI) tool named BWO algorithm. With the combination of AI technique and CCC operation, optimal security operation is improved in IoT. Using different sets of images collected from databases, the projected technique was validated in MATLAB on the basis of few performance metrics such as encryption time, decryption time, Peak Signal to Noise Ratio (PSNR), CC, Error, encryption time and decryption time. The results were compared with existing methods such as Elliptical Curve cryptography (ECC) andRivest-Shamir-Adleman (RSA) and the supremacy of the projected method is established. [ABSTRACT FROM AUTHOR]

Surgical training provides a solution for the trainee surgeons living remotely and needs to improve their surgical skills learned from the experts around the globe. One of the main challenges in implementing an effective tele-training system is security vulnerabilities during data transmission. The current security solutions come at a price in terms of efficiency and performance. This research aims to enhance security during video transmission over the Internet with decreased processing time. y: The proposed system consists of a hybrid encryption model with 2D discrete wavelet transform level 1 steganography technique, which enhances security during data transmission by encrypting the data first and then hiding it in the cover image. This creates a ciphered image that is difficult to crack for the attackers. Advanced Encryption Standard (AES) and (Rivest-Shamir-Adleman) RSA algorithms are used for the encryption process. It modifies and improves the key generation part of the encryption algorithm to achieve higher security. The hybrid encryption algorithm with the modified and improved key generation enhances security by improving the entropy by 29% over the current best solution. Additionally, the average processing time of the encryption and decryption process has been reduced by 33% compared to the state of the art solution. The processing time for the encryption process has been reduced by 2.55 ~ 2.92 ms, and for the decryption process, 2.45 ~ 2.55 ms. The entropy is increased by 8.174 (average) for the proposed system against 6.895 for the existing best solution. The proposed approach is mainly focused on providing improved security to the video data transmission over the Internet by modifying and improving the key generation step. Finally, this study proposes a solution for brute-force attacks in RSA during a real-time transmission. [ABSTRACT FROM AUTHOR]

In order to solve the practical problem that the security of computer network information cannot be guaranteed, which seriously affects the network performance, the author proposes a public key data encryption system based on PKI. The system proposed by the author is based on the public key cryptographic algorithm RSA, including implementation of data encryption and digital signature and key distribution, an improved RSA algorithm is proposed for the slow speed of RSA. The result obtained is as follows: after reasonable selection of parameters and the use of optimized algorithms (also known as combined algorithms), the RSA algorithm is about 1.0% to 2% more efficient than the traditional algorithm, to a certain extent, the operation efficiency of the RSA algorithm is improved, and the purpose of improving the RSA algorithm is achieved. It is proved that the public key data encryption system is of great significance for modern computer network information encryption and maintaining a green and secure network environment. [ABSTRACT FROM AUTHOR]

Currently, medical images represent basis of clinical diagnosis and source of telehealth and teleconsultation processes. Exchange of these images can be subject to several challenges, such as transmission bandwidth scarcity, time delivery, fraud, tampering, modifying, privacy, and more. This paper will introduce an algorithm consisting of a combination of compression and encryption techniques to meet such challenges in medical images field. First, compression is done by applying the Adaptive Arithmetic Coding (AAC) technique and controllable frequency quantization process in Discrete Wavelet Transform. After that, encryption process is applied using RSA and SHA-256 algorithms to encrypt the compressed file and to create digital signature. Performance analysis has shown that the algorithm can produce high compression ratio with good image quality, whereas range of PSNR near 45 dB and SIM is 0.88 as average values. For the security analysis, we have adopted data encryption and digital signature to guarantee the main data security services including integrity, authentication, and confidentiality, making the algorithm secure against passive or active attacks. [ABSTRACT FROM AUTHOR]

Aiming at the problems of low precision, long detection time and poor detection effect in current cross domain information sharing key security detection methods, a cross domain information sharing key security detection method based on PKG trust gateway is proposed. By analyzing bilinear pairing based on elliptic curve and identity based encryption scheme, according to the independent system parameters of PKG management platform, cross domain authentication access mechanism is proposed. PKG of different trust domains is used as the trust gateway for cross domain authentication. The key escrow problem of PKG of different trust domains is solved through key sharing, and the communication key agreement mechanism is established to mutually authenticate the user nodes in the trust domains with different system parameters. The formal description of the rule detection of cryptographic functions, parameters and other information, supported by the dynamic binary analysis platform pin, dynamically records the encryption and decryption process information during the operation of the program, and realizes cross domain information sharing key security detection through the design of correlation vulnerability detection algorithm. The experimental results show that the cross-domain information shared key security detection effect of the proposed method is better, which can effectively improve the detection accuracy and shorten the detection time. [ABSTRACT FROM AUTHOR]

A highly secure communication method is essential for end users for the exchange of information which is not interpreted by an intruder. Cryptography plays a crucial role in the current and upcoming digital worlds, for secure data transmission in wired and wireless networks. Asymmetric and symmetric cryptographic algorithms encrypt data against vulnerable attacks and transfer to authenticated users. Steganography is a method for providing secure information with the help of a carrier file (text, video, audio, image, etc.). This paper proposes Deoxyribonucleic Acid (DNA)-based asymmetric algorithm which is used to encrypt the patient's secret information and its performance is compared with ElGamal, RSA and Diffie–Hellman (DH) cryptographic algorithms. The proposed asymmetric algorithm is applied to image steganography which is used for encrypting and concealing the patient's secret information in a cover image. The proposed method consumes less hardware resources with improved latency. Dynamic Partial Reconfiguration (DPR) allows to transform a selective area rather than complete shutdown of the entire system during bitstream configuration. Cryptosystem with DPR is designed, synthesized in Xilinx Vivado and simulated in Vivado simulator. The design is targeted at Basys3, Nexys4 DDR and Zync-7000 all-programmable SOC (AP SoC) architectures and programmed with secure partial bit files to avoid vulnerable attacks in the channel. [ABSTRACT FROM AUTHOR]

This paper proposes an asymmetric encryption scheme for color images by introducing a new efficient triple-layered encryption scheme based on the RSA cryptosystem along with a chaotic map in the discrete Hartley domain. The present approach encrypts the image independently using the RSA cryptosystem and afterward transforms them into discrete Hartley domains to diffuse the image pixels. Further, the pixel positions are dislocated by applying a non-linear chaotic map to provide a complex structure of the scheme. The hardness of prime factorization of integers is intricacy in the RSA algorithm. The massive pixel confusion by a non-linear Hénon map gives rise to an efficient and robust system. Simulation results with performance analysis and the detailed comparison with extant systems assure robustness, validity, and security of the proposed scheme against various cryptanalytic attacks. [ABSTRACT FROM AUTHOR]

The previous encryption methods of hospital financial data have the problem of overburden. Therefore, a research study on hybrid encryption of hospital financial data based on Noekeon algorithm is proposed. From the basic principles of the Noekeon algorithm and the application and implementation of the Noekeon algorithm, a hybrid encryption scheme for hospital financial data based on the Noekeon algorithm is designed. In order to improve the security of the encryption system, the RSA algorithm is used to encrypt the encrypted content twice. The hybrid algorithm realizes the hybrid encryption of the hospital's financial data. Finally, a hybrid encryption system for hospital financial data based on Noekeon algorithm is designed. Experimental results show that this method has a higher success rate and better comprehensive performance. It not only improves the encryption efficiency of hospital financial data but also enhances the security of hospital financial data, which has greater application value. [ABSTRACT FROM AUTHOR]

Hill Cipher is a reimbursement coding system that converts specific textual content codes into numbers and does no longer exchange the location of fixed symbols. The symbol modifications simplest in step with the English letter table inclusive of (26) characters handiest. An encoded Hill Cipher algorithm was used that multiplication the square matrix of the apparent text with a non-public key and then combined it with the Triple Pass Protocol method used to repeat the encryption three times without relying on a personal key. Also, you could decode the code and go back it to the express textual content. The cause of mixing algorithms is to cozy the message without any key change among the sender and the recipient. [ABSTRACT FROM AUTHOR]

Purpose: The privacy of the information is a major challenge in the communication process. In the present modern generation, the cryptography plays a vital role in providing security for data, such as text, images and video while transmitting from source to destination through internet or intranet. The Rivest-Shamir-Adleman (RSA) is an asymmetric key cryptographic system, where the security of the method works on the strength of the key. Design/methodology/approach: In an asymmetric key crypto system, a pair of keys is generated one public key for encryption and one private key for decryption. The major challenge of implementing the RSA is the power function which becomes tedious and time consuming as the exponential value increases. The Chinese remainder theorem proves to be the best for data encryption when it comes to execution time of the algorithm. The proposed novel RSA algorithm with lookup table (LUT) is an extension to the Chinese remainder algorithm, which works better for image and video in terms of time complexity. Findings: This paper presents a LUT approach for implementing the RSA with a minimal processing time. The proposed algorithm was compared with the standard algorithms like, Chinese remainder theorem, binary approach and squared multiplication approach. As the size of the exponent value increases, the proposed method shows better performance compared to other standard methods. Originality/value: This paper presents a LUT approach for implementing the RSA with a minimal processing time. The proposed algorithm was compared with the standard algorithms like, Chinese remainder theorem, binary approach and squared multiplication approach. As the size of the exponent value increases, the proposed method shows better performance compared to other standard methods. [ABSTRACT FROM AUTHOR]

Image watermarking technology plays a key role in the protection of intellectual property rights. In addition to digital watermarking, optical watermarking has also been widely considered. A watermarking scheme based on Gerchberg–Saxton (GS) algorithm and integer wavelet transform (IWT) is proposed for image encryption. The scheme uses the unique phase reconstruction characteristics of GS algorithm, which makes it able to deal with a variety of complex local attacks in the process of protection and effectively restore the original image information. The obfuscation of position and numerical value information is realized by means of variable step Joseph space scrambling and pixel value bit processing. The carrier image is decomposed into subbands with different frequencies using IWT, all the information of the secret image is embedded bit by bit, which realizes the hiding of the image information. In addition, the SHA-256 function, the RSA algorithm, and the hyperchaotic system are combined to generate the cipher stream. The experimental results show that the algorithm has good imperceptibility and security, as well as strong robustness to cutting and salt and pepper noise attacks, and can restore the image quality well. [ABSTRACT FROM AUTHOR]

This research proposes a new image encryption scheme based on Lorenz hyperchaotic system and Rivest–Shamir–Adleman (RSA) algorithm. Firstly, the initial values of the Lorenz hyperchaotic system are generated by RSA algorithm, and the key stream is produced iteratively. In order to change the position and gray value of the pixel, the image data are hidden by additive mode diffusion. Secondly, the diffusion image matrix is reshaped into a one-dimensional image matrix, which is confused without repetition to hide the image data again. Then, the finite field diffusion algorithm is executed to realize the third hiding of the image information. In order to diffuse the pixel information into the entire cipher image, the additive mode diffusion algorithm needs to be looped twice. Finally, the cipher image can be obtained. The experimental results prove that the image encryption scheme proposed in this research is effective and has strong antiattack and key sensitivity. Moreover, the security of this encryption scheme relies on the RSA algorithm, which has high security. [ABSTRACT FROM AUTHOR]

This paper introduces an efficient and scalable cloud-based privacy preserving model using a new optimal cryptography scheme for anomaly detection in large-scale sensor data. Our proposed privacy preserving model has maintained a better tradeoff between reliability and scalability of the cloud computing resources by means of detecting anomalies from the encrypted data. Conventional data analysis methods have used complex and large numerical computations for the anomaly detection. Also, a single key used by the symmetric key cryptographic scheme to encrypt and decrypt the data has faced large computational complexity because the multiple users can access the original data simultaneously using this single shared secret key. Hence, a classical public key encryption technique called RSA is adopted to perform encryption and decryption of secure data using different key pairs. Furthermore, the random generation of public keys in RSA is controlled in the proposed cloud-based privacy preserving model through optimizing a public key using a new hybrid local pollination-based grey wolf optimizer (LPGWO) algorithm. For ease of convenience, a single private server handling the organization data within a collaborative public cloud data center when requiring the decryption of secure sensor data are allowed to decrypt the optimal secure data using LPGWO-based RSA optimal cryptographic scheme. The data encrypted using an optimal cryptographic scheme are then encouraged to perform data clustering computations in collaborative public servers of cloud platform using Neutrosophic c-Means Clustering (NCM) algorithm. Hence, this NCM algorithm mainly focuses for data partitioning and classification of anomalies. Experimental validation was conducted using four datasets obtained from Intel laboratory having publicly available sensor data. The experimental outcomes have proved the efficiency of the proposed framework in providing data privacy with high anomaly detection accuracy. [ABSTRACT FROM AUTHOR]

Leakage-resilient encryption is a powerful tool to protect data confidentiality against side channel attacks. In this work, we introduce a new and strong leakage setting to counter backdoor (or Trojan horse) plus covert channel attack, by relaxing the restrictions on leakage. We allow bounded leakage at anytime and anywhere and over anything. Our leakage threshold (e.g., 10,000 bits) could be much larger than typical secret key (e.g., AES key or RSA private key) size. Under such a strong leakage setting, we propose an efficient encryption scheme which is semantic secure in standard setting (i.e., without leakage) and can tolerate strong continuous leakage.We manage to construct such a secure scheme under strong leakage setting, by hiding partial (e.g., 1 % ) ciphertext as secure as we hide the secret key using a small amount of more secure hardware resource, so that it is almost equally difficult for any adversary to steal information regarding this well-protected partial ciphertext or the secret key. We remark that the size of such well-protected small portion of ciphertext is chosen to be much larger than the leakage threshold. We provide concrete and practical examples of such more secure hardware resource for data communication and data storage. Furthermore, we also introduce a new notion of computational entropy, as a sort of computational version of Kolmogorov complexity. Our quantitative analysis shows that, hiding partial ciphertext is a powerful countermeasure, which enables us to achieve higher security level than existing approaches in case of backdoor plus covert channel attacks. We also show the relationship between our new notion of computational entropy and existing relevant concepts, including Shannon entropy, Yao entropy, Hill entropy, all-or-nothing Transform, and exposure-resilient function. This new computation entropy formulation may have independent interests. [ABSTRACT FROM AUTHOR]

Series of public key encryption (PKE) schemes have been proposed for remote sensing image encryption; however, most of these schemes are not secure against quantum attacks in the new era of quantum computing. In this paper, we present an improved anti-quantum MST3 PKE scheme for remote sensing images. Using the MST3 cryptosystem, the proposed scheme can effectively resist the current quantum attacks. Moreover, with the help of a collision-resistant hash function, the proposed method achieves a nonmalleable property with respect to possible malleable attacks. Compared with the previous MST series encryption schemes, our scheme has a slightly higher efficiency. [ABSTRACT FROM AUTHOR]

A visually meaningful image encryption scheme with an asymmetric structure based on the discrete wavelet transform (DWT) and Schur decomposition is proposed in this study. First, the RSA algorithm is used to generate the initial values for the chaotic system to produce the random sequence. Then, both scrambling and diffusion operations are performed on the plain image to obtain the preencrypted image. Moreover, the Schur decomposition is applied on the preencrypted plain image to obtain the upper triangular and orthogonal matrices. Second, the cover image is scrambled followed by a DWT operation. Four subbands are then formed, namely, LL, HL, LH, and HH. Finally, the former upper triangular matrix and orthogonal matrix are embedded into subbands LH and HH produced by the cover image. After the application of the inverse DWT and inverse scrambling operation, the final visually meaningful cover image embedded with a secret plain image can be obtained. No one can identify any useful information about the plain image from the final embedded cover image, nor can anybody know that there is any hidden secret image. Experimental simulations show that the normalized correlation values between the original cover image and the final visually meaningful cover image are approximately 0.9997. Therefore, the proposed encryption scheme is imperceptible for secret image communications. [ABSTRACT FROM AUTHOR]

This paper describes a new opto-hybrid technique of two-stage encryption for the secure transmission and reception of sensitive information contained in the form of images and data. An advanced encryption–decryption technique based on optical scanning holography (optical scanning cryptography) and Fibonacci–Lucas transformation is proposed. The first stage of this hybrid system includes a point spread function engineered optical scanning cryptographic system. A new key based on fused biometric array is used in this stage. A digital encryption strategy follows this stage. This hybrid encryption scheme can be used for the secure transfer and storage of medical images in the Internet, especially in cloud-based services. The quantitative analysis is performed using different figure of merits. The quantitative investigations have been conducted through computer simulations. The parameters analyzed for establishing the performance characteristics of this system are Structural Similarity Index, Correlation Coefficient, Maximum Absolute Deviation, etc. This system shows a remarkable performance improvement during encryption. The method can be explicitly used in the radiograph image transfer over the Internet for telemedicine applications. [ABSTRACT FROM AUTHOR]

Herein, an asymmetric image encryption algorithm based on RSA cryptosystem and a fractional-order chaotic system is proposed. Its security depends on RSA algorithm. First, a pair of public and private keys is generated by RSA algorithm. Subsequently, a random message shown as plaintext key information is encrypted by the public key and RSA to achieve ciphertext key information. Next, a new transformation map is established to generate the initial key according to the ciphertext key information. Subsequently, the initial key is substituted into a fractional hyperchaotic system equation to calculate the keystream. Finally, permutation and diffusion operations are employed to encrypt a plain image to obtain the final cipher image. In the proposed algorithm, different keys for encryption and decryption are designed under an asymmetric architecture. The RSA algorithm and fractional chaotic system are combined to encrypt images; in particular, a fast algorithm for computing power multiplication is employed, which significantly improves the encryption effect and enhances the security. Simulation results show that the proposed algorithm is effective and applicable to image protection. [ABSTRACT FROM AUTHOR]

With the development of technology and cloud computing, many users use cloud computing to manage civil or military services and projects in a cloud network, saving both their common data as well as sensitive or personal information remotely. Being multi- accessible and relatively low in cost, it is regarded as a flexible process wherein the user can increase or reduce these factors according to their needs, such as the memory, communication speed, expansion, and others. Unfortunately, the security of the cloud and the preservation of confidential information still remain a major concern for users of this service, especially for enterprises that need confidentiality in the use of technology. Therefore, this work comes to play an integral role in the increase of the security of the cloud in a technical, practical and modern way, using mixed encryption, information hiding, and information processing remotely. In this work, the RSA and RGBA images are used to encrypt and hide information in Amazon Web Services (AWS), enabling the act of cloud computing remotely between the main site (admin) and the clients. The results show a good performance in terms of time, entropy, MSE and PSNR for the evaluation process. [ABSTRACT FROM AUTHOR]

Cryptography is one of the paramount and most vital data treatment processes, it allows us to be secure in our electronic transactions. The process of cryptography protects our valuable data such as private account numbers and transaction amounts, electronic signatures replace handwritten signatures or credit card authorizations, and public-key encryption provides confidentiality. The objective of data encryption is to keep digital data confidentiality save as it is stored on computer systems and transferred using the internet or other computer networks. In this paper we will focus in enhancing security level of the encryption-decryption process by introducing a novel method, which uses any digital color image to encode-decode secret message, the using of a special key to encrypt-decrypt the encoded-decoded message, the color image will be known only by the transmitter and receiver to keep the process of data treatment confidential, the obtained experimental results by the proposed method will be analyzed to prove the enhancement in process efficiency and confidentiality. [ABSTRACT FROM AUTHOR]

In medical field, securing every patient's record is main concern, ascribed to many fraudulent cases occurring in the health sector. The data of every individual must be engraved and sent into end-user without any issues. Mainly in the healthcare industry, where thoughts are often focused on saving someone's life and rightly so, but securing access to interfaces and computer systems that store private data like medical records is also an essential factor to consider. Data security is a corresponding action between controlling access to information while allowing free and easy access to those who need that information. Still few problems are focused by the physician in the health sector. Patient's data should be kept securely in medical provider servers so that physicians can provide proper treatments. To ensure secure storage and access management, we propose a novel hybrid lightweight encryption using swarm optimization algorithm (HLE–SO).The proposed HLE–SO technique merge Paillier encryption and KATAN algorithm, which provides the lightweight features. Generally, the lightweight encryption algorithms are affected by the key space. We introduce the swarm optimization algorithm to optimize the key space by changing the number of iteration round. Our main goal is to encrypt the medical data (EEG signal) and send to end user by utilizing proposed HLE–SO method. Finally, the implementation is done with MATLAB tool with different EEG signal data set. The simulation results of proposed HLE–SO technique is compared with the existing state-of-art techniques in terms of different performance metrics are MSE, PSNR, SSIM, PRD, encryption time and decryption time. [ABSTRACT FROM AUTHOR]

RSA is one among the most popular public key cryptographic algorithm for security systems. It is explored in the results that RSA is prone to factorization problem, since it is sharing common modulus and public key exponent. In this paper the concept of fake modulus and generalized Pell's equation is used for enhancing the security of RSA. Using generalized Pell's equation it is explored that public key exponent depends on several parameters, hence obtaining private key parameter itself is a big challenge. Fake modulus concept eliminates the distribution of common modulus, by replacing it with a prime integer, which will reduce the problem of factorization. It also emphasizes the algebraic cryptanalysis methods by exploring Fermat's factorization, Wiener's attack, and Trial and division attacks. [ABSTRACT FROM AUTHOR]