Search

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]

Sensor node authentication and integrity of data are of utmost importance in many decision-making processes in wireless sensor networks, with the intent that every necessary data must be digitally signed by its sensor node to send data cautiously on wireless network. No one should unlock the data other than the sink node, since only the sink node can have privilege for the verification of data. The key generation process and/or the verification process is certainly a difficult job, and it would wear out the sensor having minimal operational resources. This paper studies and evaluates different types of digital signature algorithms, such as ECDSA, RSA, OTS, Lightweight digital signature and identity-based signature, and compares their key sizes, computational and energy cost in WSN. It has been found that elliptic curve digital signature algorithm has significant benefit over other public-key algorithms in WSN, as it minimizes computational time, amount of data transmission and storage. [ABSTRACT FROM AUTHOR]

Steganography deals with hiding information, which offers ultimate security in defense, profitable usages, thus sending the imperceptible information, will not be bare or distinguished by others. In this paper, a multidirectional PVD hiding scheme with RSA algorithm is proposed. Secret bits are embedded in three directions of a color image by dividing the non-overlapping blocks into R, G, b channels by selecting the minimum pixels of each block regrouping. In order to ensure the security of an stego-image, the work proposed by scheme is used, and in addition to that RSA algorithm is proposed. [ABSTRACT FROM AUTHOR]

Over few decades, people have been working on providing security solutions, whereas attackers too have been working simultaneously. We present an evaluation of security algorithms, comparing performances and robustness. These comparisons are performed after hardware implementation and use crypt analysis. The targeted devices are wrist watches, RFID tags, IoT devices and others, which don't have a lot of areas (millions of gate equivalent). While performing this, the primary concern has been exploration of an algorithm that can work in these constrained limits. This led to a search for an algorithm that has low hardware footprints, low power consumption and better speed but at the same time implements adequate security. PRESENT has been found to be one such suitable algorithm. It has been also included in the new international standard for light-weight cryptographic methods under ISO/IEC 29192-2:2012 for its straight forward and light design. Our paper reports hardware implementation results of PRESENT, AES, ECDH, DH and RSA cryptography algorithms. We have implemented these algorithms with standard gate library of UMC-90 nm. Each algorithm has its own architecture and hence requires different crypt-analysis techniques like brute force, Pollard's Rho and biclique for "difficulty to break" measurement. It is a measure in term of time and data complexity of efforts required of a cryptographic attack. We have obtained 1.7 × improvement in area and 63 × improvement in power for modified PRESENT algorithm as compared to AES. It has also been observed that the proposed PRESENT algorithm has a time complexity of break attack as 2 127 for 128 bit key length. [ABSTRACT FROM AUTHOR]

The standard RSA relies on multiple big-number modular exponentiation operations and a longer key-length is required for better protection. This imposes a hefty time penalty for encryption and decryption. In this study, we analysed and developed an improved parallel algorithm (PMKRSA) based on the idea of splitting the plaintext into multiple chunks and encrypt the chunks using multiple key-pairs. The algorithm in our new scheme is so natural for parallelised implementation that we also investigated its parallelisation in a GPU environment. In the following, the structure of our new scheme is outlined and its correctness is proved mathematically. Then, with the algorithm implemented and optimised on both CPU and CPU+GPU platforms, we showed that our algorithm shortens the computational time considerably, and it has a security advantage over the standard RSA as it is invulnerable to the common attacks. Finally, we also proved the feasibility of using our algorithm to encrypt large files through simulation. The results show that over the set of file size: 1 MB, 10 MB, 25 MB, 50 MB, 100 MB, the average encryption and decryption time of the CPU version is 0.2476 and 9.4476 s, and for the CPU+GPU version, it is 0.0009 and 0.0618 s, respectively. [ABSTRACT FROM AUTHOR]

A watermarking method based on a robust sparse domain is proposed in this paper, which integrates the secret information into the significant sparse elements of the original image. Our algorithm protects the original data by a two-way security process to embed confidential information. First of all, converting the watermark logo into a discrete transform coefficient (DCT) is the protection process. Then, using the dictionary learning method, the transformed coefficient is embedded in the selected effective sparse coefficient in the original image. The embedded logo is extracted from the selected effective sparse coefficient using the sparse orthogonal matching tracking algorithm (OMP) domain. Then, the discrete inverse transformation is performed. To check the algorithm's efficiency, numerous specific attacks are checked. The experimental results show that the algorithm can recover the embedded watermark with precision without losing any information. [ABSTRACT FROM AUTHOR]

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

In next-generation high-speed networks, Elastic Optical Networks (EONs) play a promising role due to its more flexibility and optimal spectrum management. Some of the key facts of EON that have to be addressed are Routing and Spectrum allocation. In this paper, an efficient routing algorithm is proposed along with optimization of spectrum allocation for EON. Improved Bellman Floyd Warshall (IBFW) shortest path routing and Enhanced Shuffled Frog Leaping Algorithm (ESFLA) are used in our proposed work. Simulation results are compared with recent RSA algorithms with appropriate metrics where it achieves better spectrum utilisation and reduced number of blocking. [ABSTRACT FROM AUTHOR]

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

Identity-based Encryption (IBE) solves the problem of requiring key certificates in Public Key Encryption (PKE) by replacing the public key with the user's identity. However, most IBE systems depend on Elliptic Curve Cryptography (ECC) which makes them time inefficient. Since Adi Shamir presented the idea of IBE, designing an IBE using an efficient encryption algorithm such as RSA still remains an open challenge. In 2017, Jain and Singh presented an identity-based variant of RSA. They claimed that their system is secure without any more computational overhead. In this paper, we analyze the security of Jain Singh's identity-based RSA encryption. We launch two attacks against their system and prove that their system is not secure. [ABSTRACT FROM AUTHOR]

In the following article, a proprietary method of anonymisation of identifiable statistical data using context-free probabilistic grammar is proposed. The advantage of this method is that it is simple and thanks to this, the identifier is easy to retrieve after masking the identifiable data, e.g. when it is necessary to modify or update the micro-data. This can be done using public-key cryptography, i.e. encrypting some probabilistic context-free grammar with this method. In the case of public statistics, there is often a need to use an anonymised source value, for example when economic operators' reports are verified by statistical officers. With appropriate information generated by context-free grammar, the verifier can easily identify an economic operator or a natural person. The idea of the anonymising algorithm used in the proposed method is presented by means of an example. According to the authors, the combination of the proposed method with asymmetric encryption of the definition of context-free grammar using public key infrastructure, makes it probable that its resistance to attacks will be quite high. This is because statistical methods that are used in the analysis of natural languages are not susceptible to attacks. [ABSTRACT FROM AUTHOR]

Purpose: Encryption of patient information has become an important issue in medical ultrasound instrumentation to secure information when images are accessed off-site. The proposed algorithm is used to encrypt private medical images and transfer the encrypted images to improve the encryption capability and elapsed time. Materials and methods: We generate a public key using three prime numbers, including a fixed Mersenne prime number, in the modified Rivest-Shamir-Adelman (RSA) algorithm to compare the encryption capability. We calculated and compared the elapsed time using the modified RSA algorithm with a breast phantom in the medical ultrasound imaging instrumentation. Results: The encryption capability is improved because the elapsed time when using three prime numbers is longer (1.2337 s) than that when using two prime numbers (1.0712 s). However, the elapsed time using fixed Mersenne prime numbers (0.8360 s) is a similar to that using two prime numbers (0.8389 s). Conclusions: Our proposed cryptographic algorithm provides improved encryption in medical ultrasound imaging compared to algorithms that use two prime numbers that are not Mersenne prime numbers, while transmitting images with adequate elapsed times. [ABSTRACT FROM AUTHOR]

Cloud computing allows the users to store their data in its storage and use them whenever they need. While the data of user is traveling outside its physical infrastructure through Internet, it needs to use a very strong encryption to protect them against the hackers who attempt to steal or alter the data. Thus, the data security in transmission is so important. Most of the users send the data to cloud, but all the data do not have a high sensitivity. In this paper, K nearest neighbors algorithm is used to decide whether the data is normal sensitive or high sensitive, and then according to the level of sensitivity we proposed a framework to do data encryption. In order to ensure user authentication, we used one time password to authenticate the user, and for the data which belong to normal sensitivity level we have applied AES (advanced encryption standard)-192 algorithm. Finally, for the data which belong to high sensitivity level, AES-256 algorithm has been applied, and RSA (Rivest-Shamir-Adleman) algorithm is used to encrypt the key of AES 256, then we use hash-based massage authentication code to be attached in the end of message to ensure integrity and authenticity of message. [ABSTRACT FROM AUTHOR]

This article presents the VLSI design of a configurable RSA public key cryptosystem supporting the 512-bit, 1024-bit and 2048-bit based on Montgomery algorithm achieving comparable clock cycles of current relevant works but with smaller die size. We use binary method for the modular exponentiation and adopt Montgomery algorithm for the modular multiplication to simplify computational complexity, which, together with the systolic array concept for electric circuit designs effectively, lower the die size. The main architecture of the chip consists of four functional blocks, namely input/output modules, registers module, arithmetic module and control module. We applied the concept of systolic array to design the RSA encryption/decryption chip by using VHDL hardware language and verified using the TSMC/CIC 0.35 m 1P4 M technology. The die area of the 2048-bit RSA chip without the DFT is 3.9 × 3.9 mm2(4.58 × 4.58 mm2with DFT). Its average baud rate can reach 10.84 kbps under a 100 MHz clock. [ABSTRACT FROM AUTHOR]

Because two types of side-channel attacks, namely passive information leakages and active fault injections, are considered separate implementation threats to cryptographic modules, most countermeasures against these attacks have been independently developed. However, Amielet al.demonstrated that a fault injection combined with a simple power analysis (SPA) can break such a classical Rivest, Shamir, and Adelman (RSA) system implementation. In this paper, we show that this combined attack (CA) can be applied to the Boscher, Naciri, and Prouff algorithm, which is an SPA/fault attack (FA)-resistant exponentiation method for RSA implementation. Furthermore, this paper proposes a novel exponentiation algorithm resistant to power analysis and an FA as well as to the CA. The proposed exponentiation algorithm can be employed for secure Chinese remainder theorem-RSA implementation. In addition, the paper presents some experimental results of an SPA under the assumption of a successful fault injection. [ABSTRACT FROM AUTHOR]

Background: The efficacy of sodium citrate supplementation (SC) in exercise performance is unclear. Therefore, the aim of this study was to investigate the effect of SC on skilled tennis performance. Methods: Ten Brazilian nationally-ranked young male tennis players (age: 17 ± 1 yrs.; stature: 176.7 ± 5.2 cm; body mass: 68.4 ± 7.9 kg) participated in this crossover, placebo-controlled, double-blind study. Upon arrival, at baseline, in both experimental sessions blood was collected, then subjects ingested either sodium citrate (SC - 0.5 g.kg−1BM in capsules of 500 mg) or a placebo (PLA). Two hours later, pre-match blood was collected then skills tests (skill tennis performance test - STPT, repeated-sprint ability shuttle test - RSA) were performed followed by a 1-h simulated match. Immediately following the match, blood was again collected, and STPT, and RSA were administered. Results: All metabolic parameters (i.e. base excess, pH, bicarbonate, and blood lactate) increased (p < 0.001) from baseline to pre-match and post-match in SC condition. Each metabolic parameter was greater (p < 0.001) in SC compared to PLA condition at both pre- and post-match. The SC condition elicited a greater (p < 0.01) shot consistency at post-match in the STPT vs. PLA condition (SC: 58.5 ± 14.8% vs. PLA: 40.4 ± 10.4%). A greater (p < 0.001) amount of games won was observed in the simulated match for SC condition vs. PLA condition (SC: 8.0 ± 1.6 vs. PLA: 6.0 ± 1.7). Additionally, the games won during the simulated match in SC condition was positively correlated with percentage shot consistency (r = 0.67, p < 0.001). Conclusions: The current findings suggest that SC supplementation is an effective ergogenic aid to enhance skilled tennis performance. [ABSTRACT FROM AUTHOR]