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.
2016
2016
Efficient routing and spectrum assignment in elastic optical networks with time scheduled traffic
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… 
2014
2014
Alternative routing and zone-based spectrum assignment algorithm for flexgrid optical networks
In optical flexgrid networks, the optical spectrum can be allocated at a much finer granularity than it can be in fixed-grid WDM… 
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
Small primitive roots and malleability of RSA moduli
In a paper of P. Paillier and J. Villar a conjecture is made about the malleability of an RSA modulus. In this paper we present… 
2007
2007
Proxy-protected signature secure against the undelegated proxy signature attack
2007
2007
Hierarchical Artificial Neural Networks for Recognizing High Similar Large Data Sets
This paper proposes a hierarchical artificial neural network for recognizing high similar large data sets. It is usually required… 
2005
2005
A monotonic-decreasing rate scheduler for variable-bit-rate video streaming
Variable-bit-rate (VBR) encoded videos can provide a more consistent visual quality than constant-bit-rate (CBR) encoded videos… 
1999
1999
Notes onn-D Polynomial Matrix Factorizations
This paper discusses a relationship between the prime factorizability of a normal full rank n-D (n > 2) polynomial matrix and its… 
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)