Thank you for your comment, I have added it to the description.

• When the length of the message is k * n * n (k > 1) where n is the order of the matrix, it is not clear what to do because you choose, as an example, a message of length < n * n.

• It should be specified that for every successive chunk of n * n letters, the decoding process (4 matrix rotations) is applied.

• Other than that, it is cool, I liked it !!

I deleted the spaces. Is that what you meant?

"Do_or_do_not._There_is_no_try.######"

"######.yrt_on_si_erehT_.ton_od_ro_oD"

"#r#o#edt#_rh#oTon#__._o.sDiyt_orne"

That's fine. I was talking about trailing spaces.

I used the character "_" instead of " " in the example so that you could see what character was in the matrices. How do you think it would be better?

"Do_or_do_not._There_is_no_try.######"

"######.yrt_on_si_erehT_.ton_od_ro_oD"

"_#r#o#edt_#_rh#oTon#__._o.sDiyt_orne"

The current formatting might confuse users into thinking that the spaces are part of the actual output. Could you please refine the formatting slightly before approval of this kata?

Thanks. I merged the fork.

Random tests should be placed in a separate block. Fork for review.

I added it to the description.

The description should state that the length of the (padded) message can be a multiple of the size of the grid (including 0).

Clockwise. I have detailed the description.

Then the grid was rotated 90 degrees

Clockwise or counterclockwise?

I think it would help to have a small message as example, with intermediate results at each step.

Thanks for the feedback! Which part is unclear?

I don't understand the description. Luckely, this is a known cypher, so I could look it up online for a decent spec.