Skip to search formSkip to main contentSkip to account menu

RSA problem

In cryptography, the RSA problem summarizes the task of performing an RSA private-key operation given only the public key. The RSA algorithm raises a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

12 relations
Computational hardness assumptionCryptographyGeneric group modelInteger factorization

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Online Low-Rank Metric Learning via Parallel Coordinate Descent Method
11The corresponding author is Prof. Yang Cong. This work is supported by Nature Science Foundation of China under Grant (61722311… 
2015
2015
Explorer Exploiting separability in large-scale linear support vector machine training
Linear support vector machine training can be represented as a large quadratic program. We present an efficient and numerically… 
2012
2012
A New Efficient Asymmetric Cryptosystem Based on the Integer Factorization Problem
A new asymmetric cryptosystem based on the Integer Factorization Problem is proposed. It posses an encryption and decryption… 
2012
2012
Complex loss optimization via dual decomposition
We describe a novel max-margin parameter learning approach for structured prediction problems under certain non-decomposable… 
2010
2010
Exploiting Within-Clique Factorizations in Junction-Tree Algorithms
We show that the expected computational complexity of the Junction-Tree Algorithm for maximum a posteriori inference in graphical… 
2009
2009
Chosen-Ciphertext Secure RSA-Type Cryptosystems
This paper explains how to design fully secure RSA-type cryptosystems from schemes only secure against passive attacks, in the… 
2009
2009
High-multiplicity final states and transverse-momentum dependent parton showering at hadron colliders
If large-angle multigluon radiation gives significant contributions to parton showers in the LHC high-energy region, appropriate… 
2007
2007
Specifying, Verifying and Implementing a MAS : A Case study
This paper deals with the design of multi-agent systems. We demonstrate the goal-oriented agent model called Goal Decomposition… 
2006
2006
Factorization of Device Driver Code between Kernel and User Spaces
Device drivers, which are normally implemented as kernel code, pose stability problems since bugs in the drivers cause kernel… 
1980
1980
A Note on Resolution: How to Get Rid of Factoring without Loosing Completeness
It is often useful to simplify the resolution inference system by elimination of factoring. Factoring, however, cannot be ignored… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)