# Weird exam question about RSA and Chunksize

I'm studing RSA theory, and I've a question about an exercise of an exam of the past year...

The image below is a question for past year's exam. Is a True/False answer.

A and B for me are clear. A is True, whereas B is False.

But the problem comes with C and D. The bit representative of a 1357 modulus is 10.4 bits. Theoretically I would say that the Input blocksize (m) should be small than n (modulus). So 10 bit chunksize as input should be correct, as 11 bit input is exceeds 10.4 bit and the input cannot be larger than the modulus (two different values will give the same encrypted result)

But the problem is the output. As the modulus is 10.4 the output is required to be 11 bit... because c= m^e mod n being m=10bit but n=10.4 bit will result in (at least) C=10.4 bit (should be coded as 11 bit)

So the problem arises at the decryption... makes no sense to decrypt 11 bit, that should be splitted to 10 bit + 1bit+padding... and this, for me doesn't give the original result.

As I've always understood that Input and Output sizes MUST be equal.

On the exam I would anser T F but C and D I would leave them in blank.

Any of you have a different interpretation of this situation? 