Open AccessPosted Content
Modified Trial Division Algorithm Using KNJ-Factorization Method To Factorize RSA Public Key Encryption
TL;DR: In this article, the proposed KNJ-Factorization algorithm works very efficiently on those factors which are adjoining and close to the positive integer N, which is the multiple of two precise large prime numbers.
read more
Abstract: The security of RSA algorithm depends upon the positive integer N, which is the multiple of two precise large prime numbers. Factorization of such great numbers is a problematic process. There are many algorithms has been implemented in the past years. The offered KNJ -Factorization algorithm contributes a deterministic way to factorize RSA. The algorithm limits the search by only considering the prime values. Subsequently prime numbers are odd numbers accordingly it also requires smaller number steps to factorize RSA. In this paper, the anticipated algorithm is very simple besides it is very easy to understand and implement. The main concept of this KNJ factorization algorithm is, to check only those factors which are odd and prime. The proposed KNJ- Factorization algorithm works very efficiently on those factors; which are adjoining and close to N. The proposed factorization method can speed up if we can reduce the time for primality testing. It fundamentally decreases the time complexity.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A Cache Content Replacement Scheme for Information Centric Network
Kumari Nidhi Lal,Anoj Kumar +1 more
TL;DR: A Cache content replacement (CCR) scheme for information centric network with evaluation of popularity of the content is presented and performance of CCR scheme will be evaluated in provision of cache hit ratio and Cache load.
22
The improvement of initial value closer to the target for Fermat’s factorization algorithm
TL;DR: In this article, the authors present the hard problem of breaking RSA using the Fermat's Factorization Algorithm (FFA), which is one of the hard problems for breaking RSA.
16
Estimating the new Initial Value of Trial Division Algorithm for Balanced Modulus to Decrease Computation Loops
Kritsanapong Somsuk,Thanapat Chiawchanwattana,Chalida Sanemueang +2 more
- 01 Jul 2019
TL;DR: The aim of this paper is to propose the new initial value of Trial Division Algorithm (TDA) which is suitable for balanced modulus, and the experimental results show that most of $n$ can be factored with decreased loops whenever the newInitial value is estimated.
9
A New Methodology to Find Private Key of RSA Based on Euler Totient Function
TL;DR: In this paper, the RSA was used to evaluate the performance of the authors of this paper and found that 66% of the RSA scores were negative. But the RSA score was not a good fit for this paper.
7
An Efficient Variant of Pollard's p - 1 for the Case That All Prime Factors of the p - 1 in B-Smooth
TL;DR: The aim of this paper is to propose a variant of Pollard’s p − 1 in order to decrease the computation time, and it is demonstrated that the proposed method’'s best-case running time is O(x).
References
A method for obtaining digital signatures and public-key cryptosystems
TL;DR: An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key.
KNN based Machine Learning Approach for Text and Document Mining
TL;DR: This paper first categorize the documents using KNN based machine learning approach and then return the most relevant documents to solve the text categorization problem.
•Posted Content
Machine learning approach for text and document mining
TL;DR: In this article, a KNN-based machine learning approach was used to classify the documents and then return the most relevant documents for text categorization, which has received much attention in the last years from both researchers in the academia and industry developers.
179
Factoring Large Numbers with the TWIRL Device
Adi Shamir,Eran Tromer +1 more
- 17 Aug 2003
TL;DR: This paper describes a new hardware implementation of the NFS sieving step (based on standard 0.13μm, 1GHz silicon VLSI technology) which is 3-4 orders of magnitude more cost effective than the best previously published designs (such as the optoelectronic TWINKLE and the mesh-based sieving).
Human Activity Recognition Using Gait Pattern
TL;DR: Experimental results suggest that the proposed Model based approach for activity recognition with the help of movement of legs only are able to recognize the human activities with a good accuracy rate and robust to shadows present in the videos.
84