Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,594,489 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
12 relations
Computational hardness assumption
Cryptography
Generic group model
Integer factorization
Expand
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
Gan Sun
,
Yang Cong
,
Qiang Wang
,
Xiaowei Xu
International Conference on Pattern Recognition
2018
Corpus ID: 54436773
11The corresponding author is Prof. Yang Cong. This work is supported by Nature Science Foundation of China under Grant (61722311…
Expand
2014
2014
Recurrent Neural Network-based Tuple Sequence Model for Machine Translation
Youzheng Wu
,
Taro Watanabe
,
Chiori Hori
International Conference on Computational…
2014
Corpus ID: 16909765
In this paper, we propose a recurrent neural network-based tuple sequence model (RNNTSM) that can help phrase-based translation…
Expand
2014
2014
Iterative Methods for Designing Orthogonal and Biorthogonal Two-channel FIR Filter Banks with Regularities
R. Bregovi
,
T. Saramäki
2014
Corpus ID: 16238467
Efficient iterative methods are described for designing orthogonal and biorthogonal two-channel perfect-reconstruction FIR filter…
Expand
2012
2012
A New Efficient Asymmetric Cryptosystem Based on the Integer Factorization Problem
M. Ariffin
2012
Corpus ID: 16829106
A new asymmetric cryptosystem based on the Integer Factorization Problem is proposed. It posses an encryption and decryption…
Expand
2010
2010
Exploiting Within-Clique Factorizations in Junction-Tree Algorithms
Julian McAuley
,
T. Caetano
International Conference on Artificial…
2010
Corpus ID: 9535568
We show that the expected computational complexity of the Junction-Tree Algorithm for maximum a posteriori inference in graphical…
Expand
2009
2009
Chosen-Ciphertext Secure RSA-Type Cryptosystems
Benoît Chevallier-Mames
,
M. Joye
Provable Security
2009
Corpus ID: 5955148
This paper explains how to design fully secure RSA-type cryptosystems from schemes only secure against passive attacks, in the…
Expand
2007
2007
Monotone versions of $\delta$-normality
L. Haynes
,
C. Good
2007
Corpus ID: 115160771
We continue the study of properties related to monotone countable paracompactness, investigating various monotone versions of…
Expand
2006
2006
Factorization of Device Driver Code between Kernel and User Spaces
Arini Balakrishnan
,
S. Krishnan
2006
Corpus ID: 17213399
Device drivers, which are normally implemented as kernel code, pose stability problems since bugs in the drivers cause kernel…
Expand
2002
2002
On separable-variable functions
S. Messaoudi
2002
Corpus ID: 121824095
In this note Scott's result is generalized and a method given to factorize separable-variable functions.
1980
1980
A Note on Resolution: How to Get Rid of Factoring without Loosing Completeness
H. Noll
CADE
1980
Corpus ID: 36404409
It is often useful to simplify the resolution inference system by elimination of factoring. Factoring, however, cannot be ignored…
Expand