How to calculate the inversion fuction S:S:\mathbb{F}_{2^n}\rightarrow \mathbb{F}_{2^n},with S(x)=x^{-1}

mini minions

9/23/23, 2:11 AM

The S-box is defined as the generalised inverse function $S:\mathbb{F}_{2^n}\rightarrow \mathbb{F}_{2^n}$,in quotient ring $\mathcal{R}:=\mathbb{F}_{2^n}[X]/(X^{2^n}-X)$ with $S(x)=x^{-1}$, is correct $S(X):=X^{2^n-2}$. But the Euler's theorem says $x^{\varphi(n)}\equiv1\pmod{n}$,so the answer is $x^{\varphi(n)-1}=x^{2^{n-1}-1}\equiv x^{-1}\pmod{n}$,why is $S(X):=X^{2^n-2}$

0 + 0

s-boxes

finite-field

Score:0

Crypto

Daniel S

9/23/23, 5:54 AM

Euler's theorem is a special case of Lagrange's theorem applied to the group $(\mathbb Z/m\mathbb Z)^\times$. It can be applied in the case $m=2^n$ where $|(\mathbb Z/m\mathbb Z)^\times|=2^{n-1}$ to deduce that for any odd integer $x$ $x^{2^{n-1}-1}\equiv x^{-1}\pmod{2^n}$. However, this is different to the group $\mathbb F_{2^n}^\times$. In this case $|\mathbb F_{2^n}^\times|=2^n-1$ and we can use this to deduce that for any element $x\in\mathbb F_{2^n}^\times$ we have $x^{2^n-2}\equiv x^{-1}$. Elements of $\mathbb F_{2^n}$ are often written as polynomials in some variable, say $X$, over $\mathbb F_2$ modulo some irreducible polynomial, say $f(X)$ of degree $n$. Thus another way to express this is to say that for any polynomial $g(X)$ coprime to $f(X)$ over $\mathbb F_2$ we have $$g(X)^{2^n-2}\equiv g(X)^{-1}\pmod{\langle 2,f(X)\rangle}.$$

0 + 0

fgrieu

12/6/22, 4:57 PM

Can you explain the notation $\langle 2,f(X)\rangle$ ? I know from context that the outcome is the reduction polynomial, but I can't figure the logic behind the notation. Ah, or is it that coefficients of the polynomial $\langle m,f(X)\rangle$ are in $\mathbb Z/m\mathbb Z$?

Mark

12/6/22, 9:11 PM

generally $\langle x_1,x_2,\dots,x_k\rangle$ is notation for the (ring-theoretic) ideal generated by the elements $x_1, x_2,\dots, x_k$. So concretely $\langle 2, f(X)\rangle = \{2r_1 + r_2f(X)\mid r_i\in\mathbb{F}_2[X]\}.$

Elon Musk

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

EN: How to calculate the inversion fuction S:S:\mathbb{F}_{2^n}\rightarrow \mathbb{F}_{2^n},with S(x)=x^{-1}

TH: วิธีคำนวณฟังก์ชันผกผัน S:S:\mathbb{F}_{2^n}\rightarrow \mathbb{F}_{2^n} กับ S(x)=x^{-1}

RO: Cum se calculează funcția de inversare S:S:\mathbb{F}_{2^n}\rightarrow \mathbb{F}_{2^n}, cu S(x)=x^{-1}

RU: Как вычислить функцию инверсии S:S:\mathbb{F}_{2^n}\rightarrow \mathbb{F}_{2^n}, где S(x)=x^{-1}

VI: Cách tính hàm nghịch đảo S:S:\mathbb{F}_{2^n}\rightarrow \mathbb{F}_{2^n},với S(x)=x^{-1}

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.