Enhanced security for electronic health care information using obfuscation and RSA algorithm in cloud computing

P Gautam, MD Ansari, SK Sharma - Research Anthology on …, 2021 - igi-global.com
Recently, the electronic heath record (EHR) has become the chosen method to maintain a
patient's health information. The advancement of cloud computing enables users to access …

Pell's RSA key generation and its security analysis

TC Segar, R Vijayaragavan - 2013 Fourth International …, 2013 - ieeexplore.ieee.org
In this paper, a new variant of RSA has been proposed whose key generation method is
distinct with the standard RSA. Generally the RSA family of variants can be applied at the …

An algorithm to enhance security in RSA

R Minni, K Sultania, S Mishra… - 2013 Fourth …, 2013 - ieeexplore.ieee.org
In symmetric key cryptography the sender as well as the receiver possess a common key.
Asymmetric key cryptography involves generation of two distinct keys which are used for …

A hybrid security algorithm for RSA cryptosystem

PK Panda, S Chattopadhyay - 2017 4th International …, 2017 - ieeexplore.ieee.org
This paper presents a new Hybrid security algorithm for RSA cryptosystem named as Hybrid
RSA (HRSA). Here computation of" public key"(P) as well as" private key"(Q) depends on the …

The improvement of initial value closer to the target for Fermat's factorization algorithm

K Somsuk - Journal of Discrete Mathematical Sciences and …, 2018 - Taylor & Francis
Abstract Integer Factorization Algorithm is one of the hard problems for breaking RSA.
Fermat's Factorization Algorithm (FFA) factoring the modulus very fast whenever the …

A method for decimal number recovery from its residues based on the addition of the product modules

M Karpinski, S Rajba, S Zawislak… - 2019 10th IEEE …, 2019 - ieeexplore.ieee.org
A Method for Decimal Number Recovery from its Residues Based on the Addition of the Product
Modules Page 1 The 10th IEEE International Conference on Intelligent Data Acquisition and …

The Improvement of Elliptic Curve Factorization Method to Recover RSA's Prime Factors

K Somsuk - Symmetry, 2021 - mdpi.com
Elliptic Curve Factorization Method (ECM) is the general-purpose factoring method used in
the digital computer era. It is based on the medium length of the modulus; ECM is an efficient …

[PDF][PDF] An Improvement of Fermat's Factorization by Considering the Last m Digits of Modulus to Decrease Computation Time.

K Somsuk, K Tientanopajai - Int. J. Netw. Secur., 2017 - ijns.jalaxy.com.tw
Abstract Fermat's Factorization Algorithm (FFA) and the algorithms improved from FFA are
the fast integer factorization algorithms when these algorithms are chosen to find two large …

RSA cryptanalysis—Fermat factorization exact bound and the role of integer sequences in factorization problem

AS Shatnawi, MM Almazari, Z AlShara… - Journal of Information …, 2023 - Elsevier
Large composite integer factorization algorithms still need to be more efficient and, thus, not
operate linearly. The RSA popular cryptographic algorithm strength solely depends on …

[PDF][PDF] A new methodology to find private key of RSA based on euler totient function

K Somsuk - Baghdad Science Journal, 2021 - iasj.net
The aim of this paper is to present a new methodology to find the private key of RSA. A new
initial value which is generated from a new equation is selected to speed up the process. In …