# 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.

1,702 questions
378 views

### How to find the public key in RSA?

Finding the public key given the private key $d$ and the prime numbers $p$ and $q$. $$p = 3092551601$$ $$q = 3490383433$$ $$d = 10719928016004921607$$ Since this is RSA, here is my thinking. In ...
53 views

### PKI Challenge Response: why is $h(r) = x$ enough to protect against chosen text attacks?

I think the question was asked somewhere else but not answered very precisely. Quoting from the "Handbook of applied cryptography": Identification based on PK decryption and witness. Consider ...
260 views

### Exploit RSA , given some information about n

Every week Bob updates his public RSA modulus $n=p*q$ and encryption exponent $e$ by picking a new pair of primes $p$ and $q$ and a new exponent $e$. After several weeks, bob becomes lazy and ...
2k views

### RSA: What would happen if you chose n to be a prime? [duplicate]

If Alice were to choose n to be a prime, instead of the product of two primes, what exactly would go wrong in the RSA cryptosystem? How would Bob decrypt her message?
104 views

### RSA public key same across all clients or different?

I understand that public key is a pair of $(e, N)$ where $N$ is product of two primes and $e$ is encryption key. I understand that $N$ is usually unique for an entity. For example, Facebook, Google, ...
146 views

### Understanding how Oscar can decrypt a message in RSA

I have the following set-up: Bob has an RSA Cryptosystem with a large modulus $n$ for which the factorization cannot be found in a reasonable amount of time. Alice sends a message to Bob by ...
416 views

### Paillier VS RSA

I was wondering if there are major pros or cons of choosing the Paillier algorithm over RSA except for Pailliers being additively homomorphic and RSA multiplicative?