# 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,437 questions
Filter by
Sorted by
Tagged with
59 views

78 views

### How does recovering a message from a signature, as described by RSA, prove that the message was signed with a private key?

In the original RSA paper, in the section that describes digital signatures, the authors write, “He [Bob] need not send M as well; it can be computed from S.” Then, a few sentences later, “Bob cannot ...
150 views

### Is it more secure to use Diffie-Hellman to generate a symmetric AES key for use with CBC, rather than use CBC directly atop RSA encryption?

Short question: If we assume a one-session use public RSA keypair on both sides, and if we assume that the input stream will be split into blocks -- with CBC encryption -- is there any security ...
145 views

### Does Coron and May's paper for deterministically reducing finding 𝑑 to factoring 𝑛 work with $\lambda(n)$?

Samuel Neves in his reply mentioned a method by Coron and May's 2004 paper for deterministically reduce finding 𝑑 to factoring 𝑛. As you all know, we are using $\lambda(n)$ everywhere now for RSA. ...
19 views

### RSA private / public key, two valid private keys? [duplicate]

This might be really stupid but... if P = 11 and q = 13 N = 143 and r = 120 Say we choose e = 7 where gcd(r, e) = 1 and e < r. And therefore our public key is (7, 143) can there be multiple valid ...
938 views

### SHA-256 private/public coordinates to the PEM format

I feel that my question might display a bit of ignorance. I have been searching for answers, but have had no luck--perhaps my assumptions are wrong. I apologize if that is the case. Context: I have a ...
32 views

### Practical use of semi direct product of group in Cryptography

Is there any example of semi-direct product used in any of cryptographic application? Does it help in choosing integers p, q in RSA?
198 views

### Inverse function of RSA and safe prime requirement of DH Key exchange

Ok so the inverse function of RSA encryption (that is decryption) is $m \gets c^{d}\bmod N$ where $d$ is the secret exponent As I understand the hardness of RSA depends on two things: the Integer ...
81 views

### How to generate private SSH RSA key from given primes?

I have two primes and public exponent. How I can generate private key with this values and "ssh-rsa" format?