# Questions tagged [rsa]

An asymmetric (e.g. public-key) cryptosystem, based on modular exponentiation with big exponents and modulus. RSA can be used both for signature and encryption with proper paddings.

2,177 questions
Filter by
Sorted by
Tagged with
16 views

### RSA decrypton correct? [closed]

Given $C_i$ = [176, 12, 64, 98, 185, 64, 98, 176, 138, 127, 45, 176, 35, 156, 138, 45, 45, 45, 98, 138, 104, 138, 51, 65, 138, 35, 168, 12, 22, 138, 176, 45, 12, 22] and $187, 3$ as public key. The ...
26 views

### Criteria for public modulus of RSA accumulator

What are criteria for generation of an RSA public modulus used in an RSA accumulator, and their rationale? Are there special requirements in some sub-cases, like for «one-way» accumulators? Josh ...
6 views

### What will be the key size for rsa, ecdhe and ecdsa from the cipher suite given? [migrated]

From the cipher suites tls_rsa_with_aes_128_cbc_sha256 and tls_ecdhe_ecdsa_with_aes_128_cbc_sha256 how do I know what will be ...
151 views

46 views

### Choosing UWP encryption algorithms

I've just come across the large variety of encryption ciphers available in the UWP WinRT API, both symmetric and asymmetric. I'm trying to figure out which are commonly seen as the most favourable ...
184 views

### In RSA, given public key $(n,e)$ and $d^e\bmod n$, can we factor $n$?

Given an RSA public key $(n,e)$ and the textbook-RSA encryption $c$ of a valid matching private exponent $d$, computed as $c\gets d^e\bmod n$:  can we factor $n$ ? Assume $n,e,d$ are per PKCS#1v2.2. ...
156 views

### With RSA or ECC, if I encrypt my private key with my public key, is there a way to recover my private key?

Is there an algorithmic, mathematical, technical or implementation "hack" to recover the private key or is it definitively encrypted without any particular mathematical property, like any ...
### How to compute $m$ value from RSA if $phi(n)$ is not relative prime with the $e$?
Here is some information we got : We know the value of $n$, with size $1043$. We know the value of $p$ (size $20$) and $q$ (size $1023$) as the factors. $e = 65537.$ $\varphi(n)$ = $(q-1)(p-1)$ When I ...