Search

In this paper, a model of reversible data hiding in encrypted domain (RDH-ED) based on signal reconstruction is presented, in which homomorphic encryption is introduced to reconstruct the encrypted signal generated by non-expansible symmetric encryption (NSE). In this way, NSE guarantees the security of the original signal, homomorphic encryption with short-bit key is performed in signal reconstruction. Since the reconstructed encrypted signal is homomorphic, data hiding can be facilely achieved by using homomorphism. According to the proposed model, both homomorphic symmetric encryption and homomorphic public-key encryption can be adopted to reconstruct NSE-based signal. Meanwhile, homomorphism is not limited to additive homomorphism, and multiplicative homomorphism is also applicable. In addition, two RDH-ED methods using symmetric multiplication homomorphism and public-key addition homomorphism are devised, respectively. Experimental results are demonstrated to illustrate the superiority of the proposed methods. [ABSTRACT FROM AUTHOR]

We provide a pedagogical presentation of Shor's factoring algorithm, which is a quantum algorithm for factoring very large numbers (of order of hundreds to thousands of bits) in polynomial time. In contrast, all known classical algorithms for the factoring problem take an exponential time to factor such large numbers. Shor's algorithm therefore has profound implication for public-key encryption such as RSA and Diffie-Hellman key exchange. We assume no prior knowledge of Shor's algorithm beyond a basic familiarity with the circuit model of quantum computing. Shor's algorithm contains a number of moving parts, and can be rather daunting at first. The literature is replete with derivations and expositions of Shor's algorithm, but most of them seem to be lacking in essential details, and none of them provide a pedagogical presentation. They require a thicket of appendices and assume a knowledge of quantum algorithms and classical mathematics with which the reader might not be familiar. We therefore start with first principle derivations of the quantum Fourier transform (QFT) and quantum phase estimation (QPE), which are the essential building blocks of Shor's algorithm. We then go on to develop the theory of modular exponentiation (ME) operators, one of the fundamental components of Shor's algorithm, and the place where most of the quantum resources are deployed. We also delve into the number theory that establishes the link between factorization and the period of the modular exponential function. We then apply the QPE algorithm to obtain Shor's factoring algorithm. We also discuss the post-quantum processing and the method of continued fractions, which is used to extract the exact period of the modular exponential function from the approximately measured phase angles of the ME operator. The manuscript then moves on to a series of examples. We first verify the formalism by factoring N = 15, the smallest number accessible to Shor's algorithm. We then proceed to factor larger integers, developing a systematic procedure that will find the ME operators for any semi-prime N = p × q (where q and p are prime). Finally, we factor the composite numbers N = 21, 33, 35, 143, 247 using the Qiskit simulator. It is observed that the ME operators are somewhat forgiving, and truncated approximate forms are able to extract factors just as well as the exact operators. This is because the method of continued fractions only requires an approximate phase value for its input, which suggests that implementing Shor's algorithm might not be as difficult as first suspected. [ABSTRACT FROM AUTHOR]

Purpose: The recent development in logistics due to the dawn of Logistics 4.0 has made global logistics providers more dependent on intelligent technologies. In this era, these technologies assist in data collection and transmission of logistical data and pose many security and privacy threats in logistics management systems. The customer's private information, which is shared among the logistics stakeholders for optimal operation, faces unauthorized access due to a lack of privacy. This, amongst others, is a critical problem that needs to be addressed with blockchain. Blockchain is a disruptive technology that is transforming different sectors, and it has the potential to provide a solution to the issues mentioned above, with its unique features such as immutability, transparency, and anonymity. Method: This study designed a blockchain-based logistics management architecture on a decentralized peer-2-peer network using Ethereum smart contracts. The proposed system deployed the Rivest–Shamir–Adleman (RSA) asymmetric encryption method to protect the logistics system from cyber-attacks and secure customers' private information from unauthorized access. Findings: Furthermore, the security and privacy of the proposed system are evaluated based on the theorem. The proof shows that the system can provide security to the logistics system and privacy to customers' private data. The performance evaluation is based on throughput and latency. It shows that the proposed system is better than the baseline system, and the comparatives analysis shows that the proposed system is more secure and efficient than the existing systems. Implication and Limitation: The proposed system offers a better solution to the security/privacy of the logistics management system and provides recommendations to key stakeholders involved in the logistics industry while adopting blockchain technology. Apart from the study's methodological limitation, it is also limited by a lack of reference materials. [ABSTRACT FROM AUTHOR]

In a typical Wireless Sensor Network (WSN), thousands of sensor nodes can be distributed in the environment. Then, each sensor node transmits its detected data to the base station with the help of cooperation. In this type of network, data aggregation protocols are used to increase the network's lifetime and reduce each sensor node's communication load and energy consumption. With Data Clustering, the density of data circulating in the network is reduced, thus increasing the network's life. Energy, delay, and efficiency are essential criteria in Data Clustering; however, security is another crucial aspect to be considered. A comprehensive solution for secure data clustering has yet to be seen when the literature is examined. In the solutions developed, data availability, which means that the WSN is resistant to Denial of Service (DOS) attacks, has been neglected too much, even though confidentiality, integrity, and authentication are met with different algorithms. This study developed a comprehensive, secure clustering protocol by considering all security requirements, especially data availability. The developed protocol uses the blowfish encryption algorithm, EAX mode, and RSA algorithm. The proposed protocol was theoretically analyzed, empirically evaluated, and simulated from many perspectives. Comparisons were made with LSDAR, SUCID, and OOP-MDCRP protocols. As a result of the study, a comprehensive security solution is provided and more successful results were obtained according to Energy Efficiency, Network Lifetime, Average Delay, and Packet delivery ratio criteria. [ABSTRACT FROM AUTHOR]

Summary: The Internet of Things (IoT) connects physical components all around the world via the internet and provides people with easy access. Even though IoT offers speedy operations, saves money, and provides automation and control, it suffers from different complexities such as data breaches, security issues, and load balancing. To overcome these complexities in the IoT environment, we propose a novel strategy to deal with energy consumption issues and offer a privacy‐preserving data transfer strategy. The proposed hybrid fuzzy water cycle and evaporation algorithm increases the lifetime of IoT networks by reducing the amount of energy required by massive IoT nodes and balancing traffic loads. To protect against malicious entries in cloud servers, the digital data block that is transported to be stored in the cloud is encrypted using the matrix‐based RSA encryption technique. The significance of the proposed methodology is proven by simulated results that compare it to state‐of‐the‐art methodologies in terms of security, system cost, resource utilization, and energy consumption. The resource utilization of this proposed methodology is 100% and the security level is 96%. [ABSTRACT FROM AUTHOR]

The wearable healthcare equipment is primarily designed to alert patients of any specific health conditions or to act as a useful tool for treatment or follow-up. With the growth of technologies and connectivity, the security of these devices has become a growing concern. The lack of security awareness amongst novice users and the risk of several intermediary attacks for accessing health information severely endangers the use of IoT-enabled healthcare systems. In this paper, a blockchain-based secure data storage system is proposed along with a user authentication and health status prediction system. Firstly, this work utilizes reversed public-private keys combined Rivest–Shamir–Adleman (RP2-RSA) algorithm for providing security. Secondly, feature selection is completed by employing the correlation factor-induced salp swarm optimization algorithm (CF-SSOA). Finally, health status classification is performed using advanced weight initialization adapted SignReLU activation function-based artificial neural network (ASR-ANN) which classifies the status as normal and abnormal. Meanwhile, the abnormal measures are stored in the corresponding patient blockchain. Here, blockchain technology is used to store medical data securely for further analysis. The proposed model has achieved an accuracy of 95.893% and is validated by comparing it with other baseline techniques. On the security front, the proposed RP2-RSA attains a 96.123% security level. [ABSTRACT FROM AUTHOR]

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]

In order to ensure the protection of important data in the face of natural and man-made disasters in data centers in cloud computing services, sufficient backups of the data are required. This paper briefly introduced the security encryption measures for disaster backup of data under cloud computing. The transmission performance during disaster backup was improved by the intelligent ant colony algorithm. Simulation experiments were performed to compare the encryption performance of two encryption algorithms, the Rivest, Shamir, and Adleman (RSA) algorithm and the Advanced Encryption Standard (AES) algorithm, in disaster backup, and the transmission performance of the intelligent ant colony algorithm and the maximum network flow algorithm. The results showed that the asymmetric encryption algorithm and the RSA algorithm had better encryption performance than the AES algorithm in terms of disaster backup; with the increase of backup data volume, the transmission performance of both route assignment algorithms decreased, but the intelligent ant colony algorithm always outperformed the maximum network flow algorithm. [ABSTRACT FROM AUTHOR]

In future, hundreds of years of mathematical problems that the security of public key cryptography algorithms rely on may be defeated by quantum algorithms. How can a digital signature scheme gracefully balance security and efficiency? This study uses the conjugate search problem and the left self-distributive system to combine and uses the RSA-like algorithm as the underlying structure to propose a new aggregated signature scheme. We, through the EUF game, under the random metaphor model, prove that the security of the scheme satisfies the adaptation unforgeability under selective message attack, the scheme can be finally reduced to the discrete logarithm problem or large prime number decomposition problem. In addition, we can achieve antiquantum attack and exhaustive attack by performing matrix calculations on the message, defining and changing the structure of the matrix by encoding, and setting thresholds for the matrix dimension and the length of the private key. In terms of efficiency, the message signature implementation is linear compared with the expansion rate in terms of storage and computing overhead, and the generation and verification of the final signature pair have nothing to do with the number of users. In addition, the length of the signature is fixed and the size is only the length of a single group, which effectively reduces the generation of public and private key pairs and saves a lot of storage space. The storage space and computational complexity are also effectively improved compared with other solutions. [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]

With the fast development of blockchain technology in the latest years, its application in scenarios that require privacy, such as health area, have become encouraged and widely discussed. This paper presents an architecture to ensure the privacy of health-related data, which are stored and shared within a blockchain network in a decentralized manner, through the use of encryption with the RSA, ECC, and AES algorithms. Evaluation tests were performed to verify the impact of cryptography on the proposed architecture in terms of computational effort, memory usage, and execution time. The results demonstrate an impact mainly on the execution time and on the increase in the computational effort for sending data to the blockchain, which is justifiable considering the privacy and security provided with the architecture and encryption. [ABSTRACT FROM AUTHOR]

As smartphones incorporate location data, there is a growing concern about location privacy as smartphone technologies advance. Using a remote server, the mobile applications are able to capture the current location coordinates at any time and store them. The client awards authorization to an outsider. The outsider can gain admittance to area information on the worker by JSON Web Token (JWT). Protection is giving cover to clients, access control, and secure information stockpiling. Encryption guarantees the security of the location area on the remote server using the Rivest Shamir Adleman (RSA) algorithm. This paper introduced two utilizations of cell phones (tokens, and location). The principal application can give area information by means of the geographic position method of these gadgets. Every cell phone can create a token. The token holds secret keys got from versatile fixed identifiers for the most part of the Social Security Number (SSN) for each SIM (Endorser Personality Module) Chronic Number) and IMEI (Global Portable Hardware Character) by RSA calculation. The token is going through the short and informative administration of Short Message Service (SMS) from the client to the outsider. Information is scrambled before being stored on a faraway worker. The actual worker can't comprehend the area’s information. The third-party cannot follow the area if the client utilizes distinctive mystery keys. The client’s data and area information are saved by the various workers. The proposed application offers a mysterious sharing instrument that uses token verification to grant clients access to scrambled area data and provides encryption data in a remote server with an authentication token, achieving mutual authentication on each mobile device and user concealment. [ABSTRACT FROM AUTHOR]

Since 3D mesh security has become intellectual property, 3D watermarking algorithms have continued to appear to secure 3D meshes shared by remote users and saved in distantmultimedia databases. The novelty of our approach is that it uses a new Clifford-multiwavelet transform to insert copyright data in a multiresolution domain, allowing us to greatly expand the size of the watermark. After that, our method does two rounds of insertion, each applying a different type of Clifford-wavelet transform. Before being placed into the Clifford-multiwavelet coefficients, the watermark, which is a mixture of the mesh description, source mesh signature (produced using SHA512), and a logo encrypted using the RSA (Ronald Shamir Adleman) technique, is encoded using Turbo-code. Using the Least Significant Bit method steps, data embedding involves modulation and insertion processes. Finally, the watermarked mesh is reconstructed using the inverse Cliffordmultiwavelet transform. Due to the utilization of a hybrid insertion domain, our technique has demonstrated a very high insertion rate while retaining mesh quality. The mesh is watermarked, and the extracted data is acquired in real-time. Our approach is also resistant to the most common types of attacks. Our findings reveal that the current approach improves on previous efforts. [ABSTRACT FROM AUTHOR]

Internet of Things (IoT) techniques have been employed in many areas, e.g., vehicles, smart home, and medicine. Among the applications of IoTs, the Internet of Vehicles (IoV) is one of the most popular techniques. IoVs are protected by public key cryptographic systems, such as RSA and ECC. However, such systems are vulnerable to quantum computer attacks. Thus, we improve the security of IoV-based post-quantum signatures, which can resist quantum computer attacks. The key operations are divisions in a finite field. Hence, we improve the security of IoV-based post-quantum signatures with division by employing systolic architectures. We propose a systolic architecture for computing division in composite fields. After that, we improve the IoT security-based post-quantum signatures with systolic divisions. We test and verify our design on a Field-Programmable Gate Array (FPGA); the experimental results confirm our estimates. Furthermore, the optimized method proposed can be further applied to various applications like solving system of linear equations and cryptographic applications for IoT security. [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]

With the development of new energy vehicles, information sharing and charging service-sharing in the Internet of Vehicles have become popular directions in smart city research. The number of new energy vehicles has surged, and the ensuing range anxiety and low charging efficiency have become the main problems to be solved urgently in charging services. In the era of big data, privacy leakage is becoming more and more serious, and information security and privacy protection cannot be delayed. This paper proposes an efficient charging and privacy protection system based on the PKS system. The original single-stage topology is improved by adding the PFC and LLC circuit topologies. The PID method is used to precisely control the voltage and current loss to improve the conversion efficiency of the charging pile. The private data in the shared information uses the RSA encryption algorithm to prevent the leakage of private data and enhance the security of system communication. This paper aims to improve the charging efficiency of charging piles and the security of private information in network communication. Simulation experiments are carried out on the proposed hardware topology and software encryption system scheme. Experiments compare the waveform state of the improved output current and voltage and the safety protection area of the system architecture. The results show that the proposed charging system is efficient and safe. [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]

As a promising service paradigm, cloud computing has attracted lots of enterprises and individuals to outsource big data to public cloud. To facilitate secure data using and sharing, dual-policy attribute-based encryption (DP-ABE) is a suitable solution. It allows two access control mechanisms over encrypted data at the same time: one involves access policies over subjective attributes ascribed to user credentials, and the other involves policies over objective attributes ascribed to data. In this work, we are exploring methods to make DP-ABE more flexible, more efficient, and more secure for deployments in cloud scenes. Our proposal features the following achievements simultaneously: (1) beyond the access control mechanisms of DP-ABE, it also supports two flexible features called encryption and key generation in single-policy modes; (2) most operations of key generation, encryption, and decryption are securely outsourced to cloud servers, leaving extremely low overheads for the PKG, data owners, and users; and (3) it realizes the strongest security notion of public-key encryption schemes, namely, CCA security. We formalize the security definition and formally prove its security in the random oracle model. Moreover, we implement the proposed schemes using the Charm framework. The experiment results demonstrate that our schemes are efficient and practical. [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]

The reptile search algorithm (RSA) is a swarm-based metaheuristic algorithm inspired by the encirclement and hunt mechanisms of crocodiles. Compared with other algorithms, RSA is competitive but still suffers from low population diversity, unbalanced exploitation and exploration, and the tendency to fall into local optima. To overcome these shortcomings, a modified variant of RSA, named MRSA, is proposed in this paper. First, an adaptive chaotic reverse learning strategy is employed to enhance the population diversity. Second, an elite alternative pooling strategy is proposed to balance exploitation and exploration. Finally, a shifted distribution estimation strategy is used to correct the evolutionary direction and improve the algorithm performance. Subsequently, the superiority of MRSA is verified using 23 benchmark functions, IEEE CEC2017 benchmark functions, and robot path planning problems. The Friedman test, the Wilcoxon signed-rank test, and simulation results show that the proposed MRSA outperforms other comparative algorithms in terms of convergence accuracy, convergence speed, and stability. [ABSTRACT FROM AUTHOR]

To improve the cybersecurity of Cloud Computing (CC) system. This paper proposes a Network Anomaly Detection (NAD) model based on the Fuzzy-C-Means (FCM) clustering algorithm. Secondly, the Cybersecurity Assessment Model (CAM) based on Grey Relational Grade (GRG) is creatively constructed. Finally, combined with Rivest Shamir Adleman (RSA) algorithm, this work proposes a CC network-oriented data encryption technology, selects different data sets for different models, and tests each model through design experiments. The results show that the average Correct Detection Rate (CDR) of the NAD model for different types of abnormal data is 93.33%. The average False Positive Rate (FPR) and the average Unreported Rate (UR) are 6.65% and 16.27%, respectively. Thus, the NAD model can ensure a high detection accuracy in the case of sufficient data. Meanwhile, the cybersecurity situation prediction by the CAM is in good agreement with the actual situation. The error between the average value of cybersecurity situation prediction and the actual value is only 0.82%, and the prediction accuracy is high. The RSA algorithm can control the average encryption time for very large text, about 12s. The decryption time is slightly longer but within a reasonable range. For different-size text, the encryption time is maintained within 0.5s. This work aims to provide important technical support for anomaly detection, overall security situation analysis, and data transmission security protection of CC systems to improve their cybersecurity. [ABSTRACT FROM AUTHOR]

The poxvirus lumpy skin disease virus (LSDV) is the causative agent of the vexatious lumpy skin disease, which predominantly affects cattle and water buffalo. It has been endemic to South Africa since the 1950s, and in 1960, a live attenuated vaccine was commercially released for use in the country to mitigate the spread of this transboundary disease. This vaccine (Neethling/vaccine/LW-1959) was generated from serial passages of the prototype lumpy skin disease virus strain Neethling-WC/RSA/1957, which was isolated in 1957 from an outbreak in the Western Cape province of South Africa and was subsequently used to prove the infectious nature of the virus and the resulting disease in cattle. In this study, we determined the complete genome sequence of the LSDV prototype strain Neethling-WC/RSA/1957, as well as three other LSDV isolates from the 1950s, one wild-type isolate from the 1970s, and a commercial vaccine produced in 1988 (LW-1959). Phylogenomic analysis showed that all six sequences were in cluster 1.1, along with previous sequences of the vaccine strain, the oldest known isolate (LSDV/Haden/RSA/1954), and virulent viruses isolated in the 1990s from South Africa. Seven single-nucleotide polymorphisms were identified between the Neethling-WC/RSA/1957 strain and the vaccine strain (LW-1959), providing new insights into virus attenuation and possible markers for DIVA assays. [ABSTRACT FROM AUTHOR]

This work describes a class of Algorithm Substitution Attack (ASA) generically targeting the receiver of a communication between two parties. Our work provides a unified framework that applies to any scheme where a secret key is held by the receiver; in particular, message authentication schemes (MACs), authenticated encryption (AEAD) and public key encryption (PKE). Our unified framework brings together prior work targeting MAC schemes (FSE'19) and AEAD schemes (IMACC'19); we extend prior work by showing that public key encryption may also be targeted. ASAs were initially introduced by Bellare, Paterson and Rogaway in light of revelations concerning mass surveillance, as a novel attack class against the confidentiality of encryption schemes. Such an attack replaces one or more of the regular scheme algorithms with a subverted version that aims to reveal information to an adversary (engaged in mass surveillance), while remaining undetected by users. Previous work looking at ASAs against encryption schemes can be divided into two groups. ASAs against PKE schemes target key generation by creating subverted public keys that allow an adversary to recover the secret key. ASAs against symmetric encryption target the encryption algorithm and leak information through a subliminal channel in the ciphertexts. We present a new class of attack that targets the decryption algorithm of an encryption scheme for symmetric encryption and public key encryption, or the verification algorithm for an authentication scheme. We present a generic framework for subverting a cryptographic scheme between a sender and receiver, and show how a decryption oracle allows a subverter to create a subliminal channel which can be used to leak secret keys. We then show that the generic framework can be applied to authenticated encryption with associated data, message authentication schemes, public key encryption and KEM/DEM constructions. We consider practical considerations and specific conditions that apply for particular schemes, strengthening the generic approach. Furthermore, we show how the hybrid subversion of key generation and decryption algorithms can be used to amplify the effectiveness of our decryption attack. We argue that this attack represents an attractive opportunity for a mass surveillance adversary. Our work serves to refine the ASA model and contributes to a series of papers that raises awareness and understanding about what is possible with ASAs. [ABSTRACT FROM AUTHOR]

With the explosion of connected devices linked to one another, the amount of transmitted data grows day by day, posing new problems in terms of information security, such as unauthorized access to users' credentials and sensitive information. Therefore, this study employed RSA and ElGamal cryptographic algorithms with the application of SHA-256 for digital signature formulation to enhance security and validate the sharing of sensitive information. Security is increasingly becoming a complex task to achieve. The goal of this study is to be able to authenticate shared data with the application of the SHA-256 function to the cryptographic algorithms. The methodology employed involved the use of C# programming language for the implementation of the RSA and ElGamal cryptographic algorithms using the SHA-256 hash function for digital signature. The experimental result shows that the RSA algorithm performs better than the ElGamal during the encryption and signature verification processes, while ElGamal performs better than RSA during the decryption and signature generation process. [ABSTRACT FROM AUTHOR]

Ensuring the secure communication is the prime concern for all kinds of data communication infrastructure. Several data encryption techniques are in use for secure communication. There is a scope for further improvement in the security level, as well as for the received signal quality. The selection of a proper combination of encryption and modulation techniques can improve the overall effectiveness of both the security level and the received signal quality. The combination of asymmetric cryptography (here use RSA (Rivest–Shamir–Adleman) algorithm) algorithm with the proposed reflex klystron-based frequency shift keying (FSK) modulation technique provides a high level of secure communication system. The performance of the proposed technique is experimentally verified. The conventional FSK modulation technique operates in the low-frequency band, but the proposed FSK modulation technique is powered by high-power microwave devices, which operate in the X band. The experimental result has been demonstrated and successfully verified for secured communication using the X band. [ABSTRACT FROM AUTHOR]

Data encryption technology can protect data from illegal theft. This study analyzed the Rivest, Shamir, and Adleman (RSA) algorithm, the Advanced Encryption Standard (AES) algorithm, and their encryption and decryption processes, compared their merits and demerits, and combined them to from the AES + RSA algorithm to achieve network data protection. It was found from the performance analysis that the AES algorithm only took a short time to encrypt and decrypt, while the RSA algorithm, due to asymmetric encryption, spent a much longer time in decryption than in encryption; the total time consumed by the AES algorithm for encryption and decryption increased hundreds of times, but the operation time of the AES + RSA algorithm was only slightly longer than that of the AES algorithm. Also, from the perspective of security analysis, both AES and RSA algorithms had high confidentiality, which could meet the needs of information security. The results show that the combination of AES and RSA algorithms is effective in information security, which can be further popularized and applied in reality. [ABSTRACT FROM AUTHOR]

It is known that, given an RSA modulus, n = p q , the public key e and the corresponding private key d satisfy the modulo congruence e d ≡ 1 mod ϕ n , where ϕ n = p − 1 q − 1 . Usually, the private key d can be computed efficiently using the extended Euclidean algorithm, and it is common knowledge that the private key is unique in the sense of modular ϕ n . This paper shows that there exist multiple private keys d ; they all satisfy that d < ϕ n . This paper also presents the exact relationship between an RSA public key and a corresponding private key. [ABSTRACT FROM AUTHOR]

COVID-19 has made the world realize that the world is a whole, and international trade is the main way to connect countries. With the increase of international trade, the trade data has also become gradually huge. However, the current international trade data is still transmitted using the traditional Internet, which not only is inefficient, but also has poor security. Therefore, this paper aimed to use blockchain technology to explore the big data sharing model and key mechanism of international trade. This paper mainly introduced the design and implementation of a blockchain-based IoT data security sharing system. Firstly, the functional architecture of the prototype system was comprehensively introduced. According to the division of different functional modules, the data interaction design of different modules and the design of related smart contracts were expounded. According to the characteristics of international trade big data, the encryption and decryption algorithms are designed for the transmission of international trade big data. Finally, the prototype system was introduced from data acquisition, experimental environment deployment, system-related functional verification, and performance testing. The experimental test results showed that the encryption and decryption of transaction data by the data security sharing prototype system were more than 2 times faster than those of the traditional algorithm, and the transmission efficiency of the system at different nodes fluctuated within 10%, which showed that the system could perform security interactive sharing of data. [ABSTRACT FROM AUTHOR]

The Elliptic curve cryptosystem is a public-key cryptosystem that receives more focus in recent years due to its higher security with smaller key size when compared to RSA. Smartcards and other applications have highlighted the importance of security in resource-constrained situations. To meet the increasing need for speed in today's applications, hardware acceleration with cryptographic algorithms is required. In this paper, we present a novel parallel architecture for elliptic curve scalar multiplication based on a modified Lopez-Dahab–Montgomery(LDM) algorithm, to reduce the total time delay for computing scalar multiplication. It comprises three main steps: affine to projective conversion, point addition and doubling in the main loop followed by reconversion to affine coordinate. The modified parallel algorithm with new inversion in the reconversion yields lesser clock cycle and total time delay compared to existing techniques in the literature for the National Institute of Standards and Technology recommended trinomial G F (2 233) . Our proposed architecture implemented on Virtex4 and Virtex7 FPGA technologies, respectively, achieved a lesser clock cycle of 956, which yields a lesser delay of 20.025 and 8.22 μs. Compared with the state-of-the-art of existing techniques, two multiplications are reduced in the reconstruction process and our processor yields 18.29% and 27.21% increase in area-time performance in Virtex 4 and Virtex 7 devices, respectively. [ABSTRACT FROM AUTHOR]

The invention in 1978 of the first practical asymmetric cryptosystem known as RSA was a breakthrough within the long history of secret communications. Since its inception, the RSA cryptosystem has become embedded in millions of digital applications with the objectives of ensuring confidentiality, integrity, authenticity, and disallowing repudiation. However, the generation of the RSA modulus, N = p q which requires p and q to be random primes, may accidentally entail the choice of a special type of prime called a near-square prime. This structure of N may be used unknowingly en masse in real-world applications since no current cryptographic implementation prevents its generation. In this study, we show that use of this type of prime will potentially lead to total destruction of RSA. We present three cases of near-square primes used as RSA primes, set in the form of (i) N = p q = (a m − r a) (b m − r b) ; (ii) N = p q = (a m + r a) (b m − r b) ; and (iii) N = p q = (a m − r a) (b m + r b) . Although (ii) and (iii) are quite similar, p and q must be within the same size range of n-bits, which results in different conditions for both cases. We formulate attacks using three different algorithms to better understand their feasibility. We also provide an efficient countermeasure that it is recommended is adopted by current cryptographic libraries with RSA implementation. [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]

Password-authenticated key exchange (PAKE) protocols play an important role in cryptography. Most of PAKEs are based on the Diffie–Hellman key exchange protocols or RSA encryption schemes, but their security is threatened by quantum computers. In this study, we propose the first code-based PAKE protocol based on Ouroboros, which is a code-based key exchange protocol. Our scheme enjoys high efficiency and provides mutual explicit authentication, with a security reduction to decoding random quasi-cyclic codes in the random oracle model. [ABSTRACT FROM AUTHOR]

Cloud computing has gained attention due to its sophisticated processing architecture and data storage capabilities in the last couple of years. Due to high volume data and the endless number of possible users, the security of the account holder's stored data and privacy becomes essential for this paradigm. This article focuses on the encryption architecture of data storage and retrieval by creating an encrypted searchable index, which is inspired by symmetric searchable encryption. Ranking becomes a need for providing the best out of the search results to the user. This research article proposes an efficient and flexible artificial neural network (ANN) based ranking scheme to search for documents from the cloud server. The proposed algorithm architecture is segmented into three parts. The first part is the generation of the encryption index over the uploaded data, the second part is query analysis, and the third part is ranking. To consolidate the encryption mechanism, RSA, NTRU, and AES were used based on the requirement of the data. To orient the retrieval part, the degree of the top keyword in the server is determined by using term frequency with inverse document frequency schemes. The retrieved documents are further ranked using ANNs. The simulation setup was done on MATLAB 2016b having datasets from Kaggle (Twitter data) and FIRE dataset. [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]