On the Improvement Attack Upon Some Variants of RSA Cryptosystem via the Continued Fractions Method

Abstract

Let N = pq be an RSA modulus where p and q are primes not necessarily of the same bit size. Previous cryptanalysis results on the difficulty of factoring the public modulus N = pq deployed on variants of RSA cryptosystem are revisited. Each of these variants share a common key relation utilizing the modified Euler quotient (p 2 − 1)(q 2 − 1), given by the key relation ed − k(p 2 − 1)(q 2 − 1) = 1 where e and d are the public and private keys respectively. By conducting continuous midpoint subdivision analysis upon an interval containing (p 2 − 1)(q 2 − 1) together with continued fractions on the key relation, we increase the security bound for d exponentially. INDEX TERMS Algebraic cryptanalysis, continued fractions method, integer factorization problem, RSA-variants.

A Secure Framework for Blockchain Transactions Protection

“…In terms of privacy protection in threat intelligence sharing, reference [24] used an aggregated blind signature (based on BBS + signature scheme) mechanism in order to protect the identity information of organizations sharing threat intelligence, and proposed a registration, sharing, and demonstration method. In order to prevent the private information from being leaked to untrusted participants or hackers in the process of threat intelligence sharing, reference [25] proposed a network security threat intelligence sharing and utilization framework based on the homomorphic encryption. Reference [26] analyzed the possible privacy information leakage problem in STIX network security threat intelligence sharing standard, and tried to solve the privacy information leakage problem by using an improved data sharing protocol.…”

Systematic and Critical Review of RSA Based Public Key Cryptographic Schemes: Past and Present Status

“…In naive words, it can be said that the security of all the proposed RSA variants indicates a more secure and better performing versions, and for many coming years, the possibility is high that they won't be easily breakable as even the standard RSA is considered a secure cryptosystem. However, one would ask about prior attacks done on the RSA implementations, considering this situation, most of the attacks include cryptanalyses done by the researchers only in order to assess the algorithm [102], [103]. And even so, if any of those attacks are made on a real-world application or framework, that is often due to the improper implementation of the algorithm on the system in a very weak manner, whether that system is any network protocol or key exchange framework or IoT devices [104].…”

Randomized Block Size (RBS) Model for Secure Data Storage in Distributed Server

“…In a client-server environment, multiple user authentication uses the key sharing scheme where both client and server have their private key for authentication, and it does not share with the TTP to protect against traditional attacks [7]. W. N. A. Ruzai et al [19] proposed the continued fraction-based RSA cryptosystem, which uses mathematical problems like factorizing large prime numbers for key generation. This approach uses the modified Euler quotient for essential relation and performs a continuous midpoint subdivision strategy for key distribution.…”