How can I encrypt with a matrix key using ECB mode?

H Aßdøµ

1/29/24, 1:17 PM

Given this plaintext: 101010101010, and the block is 3, with a IV = 000 and the key as k = |1 2 3| |2 1 3| What are the required steps to get the same result like these in ECB mode: c1 = Ek(m1) = 011, c2 = Ek(m2) = 100, c3 = Ek(m3) = 011 et c4 = Ek(m4) = 100. c = c1||c1||c1||c1 = 011100011100.

Note: It is not a homework/ test, I just making some preparation.

Full exercice and its solution are bellow:

0 + 4

ecb

kodlu

1/29/24, 1:24 PM

the concept "matrix key" is nonstandard and unclear. also, smells like homework / test question, which is off topic

H Aßdøµ

1/29/24, 5:43 PM

@kodlu This is not a homework, this is preparation and it happen I am trying to solve some exercices.

kodlu

1/29/24, 5:45 PM

ok, seems to be some Mini AES resembling block cipher. Still your terminology is meaningless without further info, you should translate the details from french. What is the alphabet? Etc. etc.

Morrolan

1/29/24, 5:48 PM

The underlying 'block cipher' you are expected to use is simply a permutation of three elements, defined by the key $k$. That is $k$ defines a permutation $\pi$ such that $\pi(1) = 2$, $\pi(2) = 1$, and $\pi(3) = 3$. Its domain and co-domain are thus bit strings of length three.

Elon Musk

I sit in a Tesla and translated this thread with Ai:

EN: How can I encrypt with a matrix key using ECB mode?

Post an answer

Most people don’t grasp that asking a lot of questions unlocks learning and improves interpersonal bonding. In Alison’s studies, for example, though people could accurately recall how many questions had been asked in their conversations, they didn’t intuit the link between questions and liking. Across four studies, in which participants were engaged in conversations themselves or read transcripts of others’ conversations, people tended not to realize that question asking would influence—or had influenced—the level of amity between the conversationalists.