10 votes

Does this RSA decryption scheme make sense?

You're right, normal RSA does not (and cannot) work like that. Most likely, your client either: is using RSA with an absurdly low (and insecure) key size, is not actually using RSA at all, or has ...
Ilmari Karonen's user avatar
6 votes

Does this RSA decryption scheme make sense?

You can encrypt and decrypt arbitrary size of plaintext & ciphertext with RSA without using padding. This method is called as "Textbook RSA." However, it is definitely insecure. ...
NB_1907's user avatar
  • 610
4 votes

Does this RSA decryption scheme make sense?

if we encrypt something using a 2048-bit RSA key, we will inevitably get a 256 (bytes) ciphertext. Yes, except it's possible to save a few bits, and there are commonly used tricks to save one bit (...
fgrieu's user avatar
  • 140k
2 votes

What bitlength should I use for generating primes for a ElGamal Encryption Cyclic Group (given the data to encrypt has a short time-value vector)?

Sticking to the question as asked, that is choice of modulus size for textbook ElGamal encryption in a multiplicative (sub) group modulo a (perhaps safe) prime, the latest and most relevant data point ...
fgrieu's user avatar
  • 140k
2 votes

A question about "attacks on MAC key space"

I read carefully this chapter but I still cannot understand this idea. Well, we assume that there is 1 correct key and $2^t - 1$ incorrect keys. When we test a key, the correct key will verify. We ...
poncho's user avatar
  • 146k
1 vote

How much can we compress RSA public keys with two equal size factors?

Marc Joye's method to achieve $2n/3$ prescribed bits is essentially a streamlined version of the following. Bernstein attributes this method to Coppersmith (2003), but it's not clear whether ...
Samuel Neves's user avatar
  • 12.4k
1 vote

A question about "attacks on MAC key space"

Firstly I thank to Poncho for your kind reply. But now I have a guess like this (maybe it is not author's intention): At first I think a number of keys corresponding to a number of outputs is the ...
hellobc's user avatar
  • 11
1 vote

Threshold Paillier encryption key generation time

Assuming a party can be trusted for key generation (which may or may not be the case in the question), key generation time in Paillier encryption is about that for RSA with $N$ of comparable size. To ...
fgrieu's user avatar
  • 140k

Only top scored, non community-wiki answers of a minimum length are eligible