Search

With increasing data transmission and the escalating risks of data theft, the demand for fast and robust encryption algorithms has intensified. The Rivest Shamir Adleman (RSA) algorithm is a widely used asymmetric cryptographic solution for secure data communication. However, the computational resources required for encryption and decryption processes can become significant, particularly as the volume of data increases. This research paper proposes a dynamic approach to enhance the RSA algorithm tailored explicitly for large-scale data encryption and decryption. The proposed method involves storing the encrypted value of repeated elements, aiming to optimize performance. To evaluate the efficacy of this approach, extensive experiments were conducted on various datasets comprising paragraphs of different sizes. The experiments involved encrypting and decrypting paragraphs containing 10, 50, 100, 200, 500, 1000, and 10,000 words. Comparative analyses were performed against existing RSA, El Gamal, and AES algorithms. Results indicate that the proposed dynamic RSA approach consistently outperforms traditional RSA in terms of encryption time, decryption time, and total execution time across all tested paragraph sizes. The regression analysis revealed stark differences between the two approaches. The regression line for traditional RSA exhibited a significantly steeper slope 1.75 and a substantially higher intercept 1001.42 compared to the proposed dynamic RSA approach, which demonstrated a lower slope 0.0113 and a much smaller intercept 28.58. These findings underscore the superior scalability and efficiency of the proposed dynamic RSA approach over traditional RSA, particularly in handling larger volumes of data while maintaining lower computational overheads. [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]

The connected digital environment generates massive amounts of data that must be protected from unauthorized disclosure. Technological advancements and the creative techniques attackers use can exacerbate data security breaches. Security protocols and cryptographic algorithms are the two components of information security, the last being information security's basis and fundamental technology. The cryptographic conception will improve and assure security while also protecting network resources that are exchanged. The goal of this study is to demonstrate the few encryption algorithms that are used to encrypt data on an unsecured network. This research presents a new hybrid encryption strategy for encrypting data. MRDAES encrypts data using Rivest, Shamir, Adleman (RSA), Diffie Hellman (DH), and the Advanced Encryption System. The data will be encoded in two stages: the first by producing the encoded data using the XOR function, and the second by using AES to encode data and obtain the final result to be shared with intended reception with high-security complexity compared to other methods in terms of performance and avalanche effect. The proposed study examines the three most widely used cryptographic symmetric and asymmetric algorithms, RSA, Diffie-Hellman, and AES, and how they operate and impact security and complexity when integrated into a unified hybrid (MRDAES) computation with the proper adjustments. The study also presents an approach for increasing data security while minimizing the number of mathematical equations and obtaining high-security complexity while slightly increasing execution time with chosen large random prime numbers. The results indicate that the new hybrid technique (MRDAES) has more efficient performance and avalanche effect inputs with a minor increase in execution time. The proposed approach MRDAES produced more advanced complexity than classical RSA existing methods and others. According to avalanche effect data, the proposed technique provides better results with a higher percentage than existing algorithms on modified RSA Random Bit Insertion Algorithm (RBMRSA) and classical Rivest, Shamir, and Adleman (RSA). The proposed approach enhances the avalanche effect by 88% compared to 48% achieved by an RBMRSA, with a 40% increase and 87.80% compared to RSA. [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]

Due to its very desirable properties, Chebyshev polynomials are often used in the design of public key cryptographic systems. This paper discretizes the Chebyshev mapping, generalizes the properties of Chebyshev polynomials, and proposes an improved public key encryption algorithm based on Chebyshev chaotic mapping and RSA, i.e., C R P K C − K i . This algorithm introduces alternative multiplication coefficients K i , the selection of which is determined by the size of T r T d x m o d   N = T d T r x m o d   N , and the specific value selection rules are shared secrets among participants, overcoming the shortcomings of previous schemes. In the key generation and encryption/decryption stages, more complex intermediate processes are used to achieve higher algorithm complexity, making the algorithm more robust against ordinary attacks. The algorithm is also compared with other RSA-based algorithms to demonstrate its effectiveness in terms of performance and security. [ABSTRACT FROM AUTHOR]

A cyber-physical system (CPS) is a combination of physical components with computational elements to interact with the physical world. The integration of these two systems has led to an increase in security concerns. Traditional encryption algorithms designed for general-purpose computing environments may not adequately address the distinct challenges of CPS, such as limited processing power, delay, and resource-constrained hardware. Therefore, there is a pressing need to develop an encryption algorithm that is optimized for CPS security without compromising the critical real-time aspects of these systems. This research has designed a modified encryption technique named the advanced encryption standard in galois counter mode with nonce and rivest-shamir-adleman algorithm (AESGNRSA). A smart medical system is designed to monitor the health of remotely located patients. The AESGNRSA algorithm is applied to the three servers of this system. The data of 1.5 lakh patients is fed to this system to verify the effectiveness of the AESGNRSA algorithm. The performance parameters like encryption and decryption time, encryption and decryption throughput, and encrypted file size are calculated for the AESGNRSA algorithm. The comparative analysis proved that AESGNRSA has the highest performance as compared to other algorithms and it can protect CPS against many cyber-attacks. [ABSTRACT FROM AUTHOR]

Secure transmission of images over wireless communications systems can be done using RSA, the most known and efficient cryptographic algorithm, and OFDMA, the most preferred signal processing choice in wireless communications. This paper aims to investigate the performance of OFDMA system for wireless transmission of RSA-based encrypted images. In fact, the performance of OFDMA systems; based on different signal processing techniques, such as, discrete sine transforms (DST) and discrete cosine transforms (DCT), as well as the conventional discrete Fourier transforms (DFT) are tested for wireless transmission of gray-scale images with/without RSA encryption. The progress of transmitting the image is carried by firstly, encrypting the image with RSA algorithm. Then, the encrypted image is modulated with DFT-based, DCT-based, and DST-based OFDMA systems. After that, the modulated images are transmitted over a wireless multipath fading channel. The reverse operations will be carried at the receiver, in addition to the frequency domain equalization to overcome the channel effect. Exhaustive numbers of scenarios are performed for study and investigation of the performance of the different OFDMA systems in terms of PSNR and MSE, with different subcarriers mapping and modulation techniques, is done. Results indicate that the ability of different OFDMA systems for wireless secure transmission of images. However, the DCT-OFDMA system showed superiority over the DST-OFDMA and the conventional DFT-OFDMA systems. [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]

RSA is a well-known cryptosystem in Modern Cryptography and its efficiency is based on the hardness of the Integer Factorization problem. The algorithm is shown to be vulnerable to several attacks in a number of special scenarios with assumptions. In this paper, the strength of RSA is investigated if the primes in the modulus are close and the same modulus is used for two instances. The attack is highly efficient compared to other known attacks which are only concentrated on either closeness of the primes or the same modulus used for two or more instances. This attack examines the closeness of the primes chosen whenever the RSA system is used for two instances with the same modulus. The LLL algorithm is used to obtain the bound, and the bound is highly efficient compared to other known attacks. [ABSTRACT FROM AUTHOR]

The modern world is rapidly changing towards a novel era of technology, where not only human beings but devices are also being connected to each other with the inherent ability of communication advancements. With the evolution of social media and Internet-based applications, a large amount of information flows through communication channels and discloses numerous vulnerabilities. Cisco Inc. forecasted that approximately 50 billion devices will be linked through the Internet by 2021 termed as the Internet of Things (IoT) across the world. Typically, IoT devices are designed to collect and share sensitive information which opens a new kind of challenge in the area of security and privacy. These devices are inefficient to perform present security-based algorithms such as RSA due to the limited number of resources associated with it. This paper presents an RSA algorithm based Efficient Improved Digital Signature Algorithm (RSAEDSA) for the IoT environment. The proposed algorithm is designed to provide a secure and efficient communication mechanism for IoT-connected devices. Meanwhile, it also addresses the limitations of traditional RSA algorithms in terms of resource usage, parameter optimization, etc. The analysis of the proposed RSAEDSA algorithm shows its effectiveness which highlights the improvements in the security measures and quality of service (QoS) in the IoT environment. The simulated results show the performance superiority of RSAEDSA over the traditional methods with respect to the QoS parameters. [ABSTRACT FROM AUTHOR]

This article proposes a new method to inject backdoors in RSA (the public-key cryptosystem invented by Rivest, Shamir, and Adleman) and other cryptographic primitives based on the integer factorization problem for balanced semi-primes. The method relies on mathematical congruences among the factors of the semi-primes based on a large prime number, which acts as a "designer key" or "escrow key". In particular, two different backdoors are proposed, one targeting a single semi-prime and the other one a pair of semi-primes. This article also describes the results of tests performed on a SageMath implementation of the backdoors. [ABSTRACT FROM AUTHOR]

Electronic commerce(E-commerce) transactions require secure communication to protect sensitive information such as credit card numbers, personal identification, and financial data from unauthorized access and fraud. Encryption using public key cryptography is essential to ensure secure electronic commerce transactions. RSA and Rabin cryptosystem algorithms are widely used public key cryptography techniques, and their security is based on the assumption that it is computationally infeasible to factorize the product of two large prime numbers into its constituent primes. However, existing variants of RSA and Rabin cryptosystems suffer from issues like high computational complexity, low speed, and vulnerability to factorization attacks. To overcome the issue, this article proposes a new method that introduces the concept of fake-modulus during encryption. The proposed method aims to increase the security of the Rabin cryptosystem by introducing a fake-modulus during encryption, which is used to confuse attackers who attempt to factorize the public key. The fake-modulus is added to the original modulus during encryption, and the attacker is unable to distinguish between the two. As a result, the attacker is unable to factorize the public key and cannot access the sensitive information transmitted during electronic commerce transactions. The proposed method's performance is evaluated using qualitative and quantitative measures. Qualitative measures such as visual analysis and histogram analysis are used to evaluate the proposed system's quality. To quantify the performance of the proposed method, the entropy of a number of occurrences for the pixels of cipher text and differential analysis of plaintext and cipher text is used. When the proposed method's complexity is compared to a recent variant of the Rabin cryptosystem, it can be seen that it is more complex to break the proposed method—represented as O (ɲ ×   τ)   which is higher than Rabin-P ( O (ɲ)) algorithms. [ABSTRACT FROM AUTHOR]

In this paper, we propose a new scheme based on ephemeral elliptic curves over a finite ring with an RSA modulus. The new scheme is a variant of both the RSA and the KMOV cryptosystems and can be used for both signature and encryption. We study the security of the new scheme and show that it is immune to factorization attacks, discrete-logarithm-problem attacks, sum-of-two-squares attacks, sum-of-four-squares attacks, isomorphism attacks, and homomorphism attacks. Moreover, we show that the private exponents can be much smaller than the ordinary exponents in RSA and KMOV, which makes the decryption phase in the new scheme more efficient. [ABSTRACT FROM AUTHOR]

Recently, researchers have started to be interested in population-based swarm-based algorithms in optimization due to their simple structure, high optimization performance, and ease of adaptation. Although swarm-based algorithms solve continuous optimization problems, they can also be used to solve binary optimization problems. In continuous optimization, the search space variables try to approach the optimal value, while in discrete optimization, the search space variables are fixed and expressed with real values. In binary optimization, the decision variables take values of 0 and 1 and are basically in the discrete optimization class. In this paper, the proposed Rat Swarm Algorithm (RSA) to solve continuous optimization problems is examined. RSA is an algorithm based on swarm intelligence. RSA was developed by imitating the chasing and attacking behaviors of rats. In this study, the original RSA was updated again to solve binary optimization problems and Binary RSA (BinRSA) was proposed. In BinRSA, four U-shaped and four T-shaped transfer functions are used while converting the continuous search field values to binary values. Thus, eight variants of BinRSA were obtained. These are named as BinRSA1, BinRSA2, BinRSA3, BinRSA4, BinRSA5, BinRSA6, BinRSA7 and BinRSA8. Among these variants, the most successful variant of BinRSA was determined as BinRSA6. Then the BinRSA6 variant was developed by adding crossover and mutation operators and was named GBinRSA. GBinRSA's performance has been tested in knapsack problems. In addition, the success of GBinRSA was compared with different heuristic algorithms selected from the literature. According to the results obtained, it has been seen that the solution quality of the proposed algorithm is effective and comparable. The results showed that GBinRSA is a preferred heuristic for binary optimization problems. [ABSTRACT FROM AUTHOR]

IoT devices typically encompass objects or devices equipped with software and internet connectivity, allowing them to collect data. They have limited processing power, memory, and storage. These limitations can make it difficult to secure these devices, as traditional security measures may not be practical. Implementing security for IoT devices can be challenging due to these characteristics, but several steps can be taken to mitigate these challenges. Elliptic Curve Cryptography (ECC) can secure resource constrained IoT devices by providing a more efficient method of encryption and authentication than traditional methods such as RSA. In this paper, we analyzed the lightweight cryptographic algorithm ECC for securing resource-constrained devices such as IoT and evaluated its performance compared to the RSA cryptosystem. The analysis result indicates that ECC is considered to provide stronger security than RSA for the same key length. The CoAP protocol is applied to devices with limited resources, and an examination of its impact is conducted, considering three key performance metrics: CPU usage, bandwidth efficiency, and message communication latency. [ABSTRACT FROM AUTHOR]

At a time when communication network technology is developing rapidly, the security of the Internet has aroused widespread concern in the academic community. In particular, electronic payment, which has been booming in recent years, has great security risks and people are prone to information leakage and property loss in the process of payment. In order to solve these problems, this study adopts the AES to encrypt the information in the payment process, introduces the RSA Public Key System (RSA) and the SM4 packet cipher algorithm for comparison, and analyses their encryption (decryption) speed, decryption (decryption) speed and encryption speed respectively. (decryption) speed, as well as PR curve, Loss function and sensitivity. The results show that the AES algorithm has a faster encryption (decryption) speed compared to the other two algorithms. In the PR curve, the AES algorithm has an AP value of 0.9988, which is significantly higher than the other two algorithms, and has a better balance between accuracy and recall, and better performance. In the sensitivity analysis, the AES algorithm can have the highest sensitivity of 97.88%. This is significantly higher than the 93.47% and 96.59% of the other two algorithms. Moreover, as shown by the Loss function of the AES algorithm, it converges faster and the Liss value varies between 0.1 and 0.9. In summary, the AES algorithm has a faster encryption speed and is better in terms of accuracy, convergence speed and security factor in all aspects. This also demonstrates the feasibility and effectiveness of this algorithm for information security protection in electronic payment processes. [ABSTRACT FROM AUTHOR]

The objective of this paper is to present a novel application of 2-cyclic refined integers to build a novel crypto scheme for the encryption and decryption of data and information based on the algebraic properties of 2-cyclic refined integers combined with RSA algorithm, where an improved version of RSA crypto-scheme will be established and applied to the security of information and data. On the other hand, we illustrate some examples and figures to show the validity and complexity of the algorithm. [ABSTRACT FROM AUTHOR]

Secure and reliable exchange of information between devices is crucial for any network in the current digital world. This information is maintained on storage devices, routing devices, and communication over the cloud. Cryptographic techniques are used to ensure the secure transmission of data, ensuring the user's privacy by storing and transmitting data in a particular format. Using encryption, only the intended user possessing the key can access the information. During data or essential transmission, the channel should be secured by using robust encryption techniques. Homomorphic Encryption (HE) techniques have been used in the past for this purpose. However, one of the flaws of the conventional HE is seen either in its slow transmission or fast key decryption. Thus, this paper proposes an optimized Homomorphic Encryption Chinese Remainder Theorem with a Rivest-Shamir-Adleman (HE-CRT-RSA) algorithm to overcome this challenge. The proposed Technique, HE-CRT-RSA, utilizes multiple keys for efficient communication and security. In addition, the performance of the HE-CRT-RSA algorithm was evaluated in comparison with the classical RSA algorithm. The result of the proposed algorithm shows performance improvement with reduced decryption time. It is observed that the proposed HE-CRT-RSA is 3–4% faster than the classical Rivest-Shamir-Adleman (RSA). The result also suggests that HE-CRT-RSA effectively enhances security issues of the cloud and helps to decrease the involvement of intruders or any third party during communication or inside the data/server centers. [ABSTRACT FROM AUTHOR]

To address a business need, most organizations allow employees to use their own devices to enhance productivity and job satisfaction. For this purpose, the Bring Your Own Device (BYOD) policy provides controllable access for employees to organize data through their personal devices. Although the BYOD practice implies plenty of advantages, this also opens the door to a variety of security risks. This study investigates these security risks and proposes a complementary encryption approach with a digital signature that uses symmetric and asymmetric algorithms, depending on the organization's digital certificate, to secure sensitive information stored in employees' devices within the framework of BYOD policies. The method uses Advanced Encryption System (AES), Blowfish, RSA and ElGamal with a digital signature to achieve strong encryption and address critical security considerations such as user authentication, confidentiality and data integrity. The proposed encryption approach offers a robust and effective cryptographic solution for securing sensitive information in organizational settings that involve BYOD policies. The study includes experimental results demonstrating the proposed approach's efficiency and performance, with reasonable encryption and decryption times for different key and file sizes. The results of the study revealed that AES and Blowfish have the best execution time. AES has a good balance of security and performance. RSA performs better than ElGamal in encryption and signature verification, while RSA is slower than ElGamal in decryption. The study also provides a comparative analysis with previous studies of the four encryption algorithms, highlighting the strengths and weaknesses of each approach. [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]

Copyright of Techno.com is the property of Universitas Dian Nuswantoro, Fakultas Ilmu Komputer and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Different encryption methods that emerged with the development of cryptology have different advantages and disadvantages in terms of speed and security level. The importance of cryptography in this position is to reveal the advantages of encryption techniques by using them at the right time. In other words, the time of use and their management are as important as the strength of encryption algorithms. In this part hybrid encryption schemes come into play. Hybrid encryption schemes provide safer and faster data transmission by using the advantages of different encryption schemes on appropriate time. In this study, the reasons for the emergence of hybrid encryption schemes will be examined and the new hybrid encryption scheme will be mentioned. The new hybrid architecture consists of the implementation of the new encryption scheme and RSA, which is one of the asymmetric encryption schemes. [ABSTRACT FROM AUTHOR]

This article is made with the purpose to present a hybrid encryption prototype implemented over a grid network, with the intention to demonstrate the security level that is possible to achieve with this way of encryption by means of a messaging application; which will be target to analysis with and without the libraries implementation generated in order to compare the results obtained once it is running, likewise there will perform an analysis process over the prototype proposed for verifying possible points of failures. The prototype was developed based on an architecture capable to share resources and functionalities in order to provide the ability to operate with any system that require the use of them, therefore, the messaging application itself is only a test object that give us information about the capacity of the cypher prototype, and aims to provide a confidence level for its implementation in other communication systems. [ABSTRACT FROM AUTHOR]

Mobile Ad-Hoc Networks (MANETs) are recognised as a key emerging technology for use whenever cellular communications are either infeasible, inefficient, or cost-ineffective. MANETS are composed of nodes that are arranged in a self-organizing manner, without a central device like a switch or router. The nodes communicate with each other over wireless links and cooperate in a distributed fashion. Smartphones are the most ideal network nodes in many scenarios where traditional networks are unavailable, but building a secure network with them is not easy. This paper extensively uses the existing possibilities to build a secure MANET. The designed MANET has been built on an NS3 simulator, with the base protocol being Ad-hoc On-demand Distance Vector (AODV) and message encryption is done by using RSA Algorithm. The Secure AODV protocol extension is implemented using the RSA extension. [ABSTRACT FROM AUTHOR]

Copyright of InfoM is the property of Belgrade University, Faculty of Organizational Science and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

One of the critical goals of advanced cryptography is to protect data privacy. Although protecting sensitive data has always been essential, it has become much more due to the widespread use of cloud services. Conventional encryption schemes have one drawback: data must be decrypted before processing. Best practices have long recommended that data must be secured at rest and in motion when using public cloud services, i.e., we need encryption at the storage as well as at processing levels. Homomorphic encryption is an advanced cryptographic approach in which the processing of encrypted data is possible. In this paper, we have presented the insights required for understanding homomorphic encryption approaches. We examined and compared two partial homomorphic techniques, RSA and Pallier algorithm based on efficiency, base method, and homomorphic property. [ABSTRACT FROM AUTHOR]

Encryption of data is translating data to another shape or symbol which enables people only with an access to the secret key or a password that can read it. The data which are encrypted are generally referred to as cipher text, while data which are unencrypted are known plain text. Entropy can be used as a measure which gives the number of bits that are needed for coding the data of an image. As the values of pixel within an image are dispensed through further gray-levels, the entropy increases. The aim of this research is to compare between CAST-128 with proposed adaptive key and RSA encryption methods for video frames to determine the more accurate method with highest entropy. The first method is achieved by applying the "CAST-128" and the second is achieved by applying the "RSA ". CAST-128 utilizes a pair of sub-keys for each round as a quantum of five bits that was utilized as a key of rotation for each round and a quantum of 32 (bits) was utilized as a key of masking into a round. The proposed adaptive 128-bits key can be extracted from the main diagonal of each frame before encryption. RSA is a public-key cryptographic technique which can be known as (asymmetric) cryptography. An asymmetry of a key depends on factoring a product of two big prime values. A comparison was applied on several videos and the results showed that CAST-128 method proved the highest degree of entropy even if the frames have lots of distorted data or unclear image pixels. For example, the entropy value of a sample of a girl video is 2581.921 when using CAST-128, while it is 2271.329 when using the RSA; also the entropy value of a sample of a scooter video is 2569.814 when using the CAST-128, while it is 2282.844 when using RSA. [ABSTRACT FROM AUTHOR]

Cryptographic algorithms (RSA, DSA, and ECC) use modular exponentiation as part of the principal operation. However, Non-profiled Side Channel Attacks such as Simple Power Analysis and Differential Power Analysis compromise cryptographic algorithms that use such operation. In this work, we present a modification of a modular exponentiation algorithm implemented in programmable devices, such as the Field Programmable Gate Array, for which we use Virtex-6 and Artix-7 evaluation boards. It is shown that this proposal is not vulnerable to the attacks mentioned previously. Further, a comparison was made with other related works, which use the same family of FPGAs. These comparisons show that this proposal not only defeats physical attack but also reduces the number of resources. For instance, the present work reduces the Look-Up Tables by 3550 and the number of Flip-Flops was decreased by 62,583 compared with other works. Besides, the number of memory blocks used is zero in the present work, in contrast with others that use a large number of blocks. Finally, the clock cycles (latency) are compared in different programmable devices to perform operations. [ABSTRACT FROM AUTHOR]

Security has always been an important aspect of wireless communications. Aiming at further improve the security of wireless communication and how to prevent eavesdropping, this paper proposes a constellation encryption design based on chaotic sequence and the RSA algorithm. The core idea of this method is to effectively combine both chaotic sequences and RSA, and then to generate large number of encrypted sequences with high security. The specific method is to first use the asymmetric RSA algorithm to transmit the system parameters, then to use the initial value sensitivity of the chaotic sequence to generate the secret sequence, and finally to use the secret sequence to encrypt the original sequence. Simulations show that the proposed algorithm further improves the security of satellite communications without increasing the complexity of the original system. [ABSTRACT FROM AUTHOR]

The RSA cryptosystem comprises of two important features that are needed for encryption process known as the public parameter e and the modulus N. In 1999, a cryptanalysis on RSA which was described by Boneh and Durfee focused on the key equation e d - k ϕ (N) = 1 and e of the same magnitude to N. Their method was applicable for the case of d < N 0.292 via Coppersmith's technique. In 2012, Kumar et al. presented an improved Boneh-Durfee attack using the same equation which is valid for any e with arbitrary size. In this paper, we present an exponential increment of the two former attacks using the variant equation e a - ϕ (N) b = c . The new attack breaks the RSA system when a and |c| are suitably small integers. Moreover, the new attack shows that the Boneh-Durfee attack and the attack of Kumar et al. can be derived using a single attack. We also showed that our bound manage to improve the bounds of Ariffin et al. and Bunder and Tonien. [ABSTRACT FROM AUTHOR]

Computers and the internet are the two main communication tools used today to link the entire world together as one virtual space. So we can easily exchange lots of information within seconds of time, but the confidential data that needs to be transferred should be kept confidential. Thus, in order to aid this, we have proposed a new encryption technique by combining Image steganography (LSB) with the cryptographic RSA algorithm for providing more security to our data as well as imperceptibility. The expected outcome would be a properly secure combination of encryption models that uses steganography to hide the message content in a cover image, and also encrypts the message using the cryptographic algorithm, as an additional security layer, in case the content was retrieved from the cover image. [ABSTRACT FROM AUTHOR]

The multi-cloud-based resource allocation is based on multiple constraints and multiple configurations that may vary based on customer requirements and cloud service providers' schemes. Here, security is a serious concern that can be ensured by an authentication scheme based on the Self-Adaptive Flower Pollination based RSA (SA-FPRSA) scheme to ensure data integrity. The SA-FPRSA plays an initial role in ensuring security by enabling authenticated data availability. On the other hand, the resource allocation to the Virtual Machine (VM) is a challenging task due to overwhelmed data in a VM that may face unnecessary energy consumption and time complexity issues. Therefore, the proposed model has introduced a Self-adaptive Heap-based optimizer (HBO) for Multi-Cloud based resource allocation. The performance of the models is evaluated. The proposed model attained an Efficiency of 99.09% and Security of 98.72%. Thus, from the results, the recommended model is proven to be better than the existing models. [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]

A vehicular Ad hoc NETwork -VANET has been emerged as a novel application for revolutionizing the driving experience and optimizing the traffic flow control networks. The development of high efficiency and optimized routing protocols for VANET remains a challenging task because of characteristics like rapid topology changes, large scale sizes and frequent link disconnections. Hence investigation of security and privacy problems is required to be emphasized. This paper presents a robust and novel method for improving the security in VANET environment and to evaluate the performance of the proposed ODMRP (On Demand Multi Cast Routing Protocol). Hence the study utilized RSA (Rivest-Shamir-Adleman) based key generation integrated with the asymmetric key generation with AES (Advanced Encryption Standard) algorithm.This proposed trust based integrated algorithm for key generation introduces a novel roadside unit message to the base station that enables Road side units- RSU responsible for the verification of the authentication of the encrypted messages received from the vehicles as well as for the notification of the results to the vehicles. The performance analysis represented that the proposed ODMRP with the use of RSA and AES algorithm possess a better adaptation capacity to VANET network in accordance to packet delivery ratio and throughput. The results obtained from the study have been compared with the existing system and proved to be more efficient. [ABSTRACT FROM AUTHOR]

Security plays a major role in an individual's life to win this world with highly secure and authentic lifestyle with the digital equipment's. The paper proposed an encryption based secure face detection and recognition model which can be implemented in daily life to generate a more robust and efficient security bubble around the world. The most crucial problem encountered during face recognition is due to the variation in face direction of an individual, the model solves the mentioned pose variation problem. The proposed model takes the help of face recognition library to recognize the face and use HOG (Histogram of Oriented Gradients) & SVM for checking the face authentication by performing an image match, the model also applies the concept of HOG to generate the encoded features from the image. The system is divided into two modules first is to detect a face and then match the detected face from the authentic persons dataset available. The system uses the concept of OpenCV library for giving a support system for the real time image. For data encryption, proposed model used the concept of DES3 and RSA algorithm. The proposed model gets 83.33% accuracy while tested for three different image types and states that the RSA algorithm performs encryption in less computational time. [ABSTRACT FROM AUTHOR]

Copyright of Przegląd Elektrotechniczny is the property of Przeglad Elektrotechniczny and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

This paper investigates a novel RSA-like cryptosystem proposed by Murru-Saettone. This cryptosystem is constructed from a cubic field connected to the cubic Pell equation and Redei rational functions. The scheme is claimed to be secure against the Wiener-type attack. However, in this paper, we show a Wiener-type attack that can recover the secret key from the continued fraction constructed from public information. [ABSTRACT FROM AUTHOR]

Cryptography is a science that studies methods so that data or messages remain safe when sent, from the sender to the recipient without experiencing interference from unauthorized parties. The cryptographic system used is a combination of symmetrical cryptographic algorithms, and asymmetric cryptographic algorithms also called hybrid cryptosystems. This research work tries to explore the need of integration of different encryption algorithms and enhance the strength of encryption and complexity. This work observes that integrity check algorithm can also be used to generate key of asymmetric key cryptography and they can help to enhance power of confidentiality. In this paper, we present a new hybrid by using Blowfish, RC6 and RSA algorithms. Within this, the data is encrypted through symmetric algorithm using RC6 and blowfish algorithm and key is encrypted using an asymmetric algorithm called RSA. The complete solution was implemented using Java technology and it was evaluated based on computation time. [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]

Internet of things (IoT) is one of the main application scenarios of 5th generation mobile networks (5G). Along with the rapid development of 5G, IoT terminal devices will create big data. Generally, IoT terminal devices are lightweight user equipments, for example, wearable devices. In order to take use of these lightweight terminal devices, it is a feasible way to outsource these created big data to the public cloud. When these data are out of the client's control, it is of crucial importance to ensure the remote data integrity. To solve the weaknesses of the existing remote data integrity checking schemes, we propose the concept of blockchain-based remote data integrity checking (RDIC) scheme for big data. The new concept makes use of blockchain technique which greatly improves the efficiency and security of RDIC. First, the system model and security definition are given for the proposed RDIC scheme by using blockchain. Then, by using efficient modular arithmetic, RSA digital signature, blockchain, etc , we construct a lightweight blockchain-based RDIC scheme. Finally, we analyze its security and performance. The detailed analysis shows that our scheme is provably secure and lightweight. • The concept of blockchain-based RDIC for IoT in 5G Networks. • The first concrete scheme for the model. • Detailed performance analysis and experimental results. [ABSTRACT FROM AUTHOR]

E-currency transaction through smart card is the role in widespread and massive extension of information technology. When processing the smart card, third party always tries to retrieve personal information and to crack the security system. cryptographic techniques are used to providing security and privacy to the smart card information. An efficient algorithm of RSA has proved the strength through factorization of large prime numbers. The objective of this paper is to provide efficient security instead of processing large prime numbers, so proposed work provides efficient security by the implementation of Burnside curve based RSA. The performance analysis of the proposed work proved the security strength through the various attacks against RSA. [ABSTRACT FROM AUTHOR]

A side-channel attack (SCA) hardened AES-128 and RSA crypto-processor in 14-nm CMOS with measured resistance to correlation power/electromagnetic analysis (CPA/CEMA) in both time and frequency domains is demonstrated. While previously reported linear low-dropout regulators (LDOs) offer improvements in minimum-time-to-disclose (MTD) of extracted key bytes in the time domain, their transformations are less effective against frequency-domain attacks. This article describes a non-linear digital LDO (NL-DLDO) with control loop randomizations that bolster SCA resistance in the frequency domain. The NL-DLDO cascaded with an AES engine augmented with arithmetic countermeasures enables > 250 K × improvement in MTD, with no CPA/CEMA/DNN attacks detected after 1-B encryptions, with 8% power and 10% area overheads incurred by arithmetic techniques. The RSA-4K crypto-processor implements exponent magnitude and timing randomizations along with dynamic memory addressing to mitigate time- and frequency-domain attacks. The countermeasures enable 711 × suppression in means separation in current/EM magnitudes from 3.1 mV to 4.35 μV, reducing attacker’s accuracy to an ineffective random guess classification, while limiting area and performance overheads to < 0.05% and 3.25%, respectively. [ABSTRACT FROM AUTHOR]

In recent years, the trend has increased for the use of cloud computing, which provides broad capabilities with the sharing of resources, and thus it is possible to store and process data in the cloud remotely, but this (cloud) is untrusted because some parties can connect to the network such as the intemet and read or change data because it is not protected, therefore, protecting data security and privacy is one of the challenges that must be addressed \\~1en using cloud computing. Encryption is interested in the field of security, confidentiality and integrity of infonnation that sent by a secure connection between individuals or institutions reirnrdless of the method used to prepare this connection. But using the traditi;nal encryption methods to encrypt the data before sending it will force the data provider to send his private key to the server to dec1ypt the data to perfonn computations on it. In this paper we present a proposal to secure banking data transmission through the cloud by us ing paitially homomorphic enc1yption algoritluns such as (paillier, RSA algorithm) that allow performing mathematical operations on encrypted data without ne.e.ding to de.c1yption. A proxy server will also use for performing re-encryption process to enhance security. [ABSTRACT FROM AUTHOR]

RSA-CRT is one of the most common algorithms in the digital signature. Several side-channel attacks have been presented on the implementation of RSA-CRT. One of the most important side-channel attacks on RSA-CRT is Modular Reduction on Equidistant Data (MRED). The implementation of RSA-CRT has too many challenges in the multiplications when the key size is too long (e.g. 2048 bits). Montgomery multiplication is one of the common methods for executing the RSA multiplication, which has many implementation problems and side-channel leakage challenges. This article first implements an RSA-CRT algorithm based on the Montgomery multiplication with the high-speed and low area hardware. The implementation is named RSA-CRT-MMB (Montgomery Method Based). Next, a new power analysis side-channel attack on RSA-CRT-MMB is presented. We name our attack MRED on MMB. The attack utilizes new side-channel leakage information about the CRT reduction algorithm implemented by the MMB, for the first time. The previous articles do not investigate the MRED attack on Montgomery multiplication in RSA-CRT. Finally, a new countermeasure is presented to prevent the MREDM attack. The countermeasure does not have any overload in the hardware area or running time of the RSA algorithm. The correctness of our scheme, the 2048-bit RSA-CRT-MMB, is investigated by the implementation of the scheme on the SASEBO-W board in our DPA laboratory. The total running time of 2048-bit RSA is 250 ms and the RSA algorithm occupies only 23% of LUT slice on Spartan-6 FPGA. The proposed countermeasures are also verified by practical experiments. [ABSTRACT FROM AUTHOR]

Mobile ad hoc network (MANET) is an infrastructure-less, self-motivated, arbitrary, self-configuring, rapidly changing, multi-hop network that is self-possessing wireless bandwidth-conscious links without centrally managed router support. In such a network, wireless media is easy to snoop. It is firm to the surety to access any node, easier to insertion of bad elements or attackers for malicious activities in the network. Therefore, security issues become one of the significant considerations for such kind of networks. The deployment of an effective intrusion detection system is important in order to provide protection against various attacks. In this paper, a Digitally Signed Secure Acknowledgement Method (DSSAM) with the use of the RSA digital signature has been proposed and simulated. Three different parameters are considered, namely secure acknowledgment, node authentication, and packet authentication for study. This article observes the DSSAM performance and compares it with two existing standard methods, namely Watchdog and 2-ACK under standard Dynamic Source Routing (DSR) routing environment. In the end, it is noticed that the rate of detection of malicious behaviour is better in the case of the proposed method. However, associated overheads are high. A trade-off between performance and overhead has been considered. [ABSTRACT FROM AUTHOR]

The novel cryptosystem was designed to be fast and secure for cloud. Circle was used for encryption. A 3D hyperbola was used for decryption. Mathematical properties were used to ensure that an eavesdropper could not perform side-channel attacks. The number of equations which an eavesdropper had was lesser than the number of unknowns for every block. The cryptosystem could work anywhere from smartwatches to supercomputer. It was designed to be flexible. 3D hyperboloid cryptosystem could work as both stream and block cipher. There was no restriction on key size and block size. Confusion and diffusion were measured as parameters for security. It is a complete encryption type cryptosystem. Performance and security analysis was performed both in terms of hardware and software implementations. Problem of key management, handling and key distribution was solved. Experimental results indicate that the proposed cryptosystem was faster than both symmetric and asymmetric key cryptosystems. [ABSTRACT FROM AUTHOR]

This paper falls within the framework of the security of satellite images, in particular interferograms from an Interferometric Synthetic Aperture Radar (inSAR) system. The innovation of this work consists in the application of a cryptosystem based on two algorithms Advanced Encryption Standard (AES) and the Rivest, Shamir and Adleman (RSA) encryption algorithm for securing interferograms of inSAR systems. AES employs five encryption modes Electronic Code Book (ECB), Cipher Bloc Chaining (CBC), Cipher FeedBack (CFB), Output FeedBack (OFB), and counter-mode encryption (CTR). The use of the AES algorithm alone can only ensure the confidentiality function. In the proposed cryptosystem confidentiality is ensured by the AES algorithm, authenticity is guaranteed by the RSA algorithm, and integrity is ensured by two parameters; the correlation function between the adjacent pixels and the SSIM parameters (structural similarity index SSIM). For evaluation and analysis of security performance for interferogram encryption, several test metrics are employed. These metrics are: Analysis of histograms of the encrypted interferograms, correlation between the adjacent pixels, between the original interferogram and the encrypted interferogram, SSIM between the original interferogram and the decrypted one. Moreover, we exploit the analysis of resistance to error propagation for the five modes. The obtained results show a superiority of the OFB and CTR modes for the encryption of in- SAR interferograms compared to ECB, CFB, and CBC modes. It is noteworthy, that the main criteria that can be used to choose between OFB and CTR for encryption of satellite images are propagation of errors and the complexity material for their locations on the edges of the satellites propagation of errors and the complexity material for their locations on the edges of the satellites. OFB mode is employed in satellites to minimize the number of on-board circuits, which is decisive for satellites. CTR mode is recommended by the CCSDS (Consultative Committee for Space Data Systems) for telemetry (TM) and remote control (TC) encryption. [ABSTRACT FROM AUTHOR]

Copyright of 3C Tecnologia is the property of Area de Innovacion y Desarrollo, SL and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

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]