RSA question as well, following B. Schneier book example

Hello all,

I've a question regarding Cyphered messages bloc with RSA algorithms.


Said p=47, q=71,
=> n=3337
=> (p-1)(q-1)=3220

As Bruce Schneier explain in "Applied Cryptography", we can choose e among the three most commonly used ones {3, 7, 65537} (not only thoses ones, of course, but i wanted to see the behaviour with commonly used ones).

So i choose e = 3

d=(e^-1) mod ((p-1)(q-1))

Extended Euclid algorithm give me the value 2147 for d. Can you confirm me this value?

I try to cypher a couple of clear bloc message (lenght = 3 digit).They
are listed on the follwong table. The second column show the used 'dc'
script.
the third column show the strand result as crypted message bloc. They do not have the same lenght. Is this normal?


+---+-------------------+------+
| m | (m^3) mod 3337 | c |
+---+-------------------+------+
|284| 284 3 ^ 3337 % p | 1136 |
|832| 832 3 ^ 3337 % p | 875 |
|595| 595 3 ^ 3337 % p | 87 |
|625| 625 3 ^ 3337 % p | 2368 |
|120| 120 3 ^ 3337 % p | 2771 |
|282| 282 3 ^ 3337 % p | 1128 |
+---+-------------------+------+

I don't understand thoses results. I beleied that all c messages should have the same lenght.

However, i don't see where is my mistake?

Thank you for your help.


--
Vincent Badier
.