Multiplicative inverse of a polynomial in $GF(8)$











up vote
0
down vote

favorite












I am trying to find the inverse of $x ^3+x +1$ in $GF(8)$.
I have done the Euclidean algorithm but I am stuck in the forward process to get the inverse. Please explain how to do it from reverse.










share|cite|improve this question









New contributor




Mariam Mashuryan is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.




















  • Do it this way - much less painful and less error-prone.
    – Bill Dubuque
    yesterday












  • Normally $x$ stands for an indeterminate, when $x^3+x+1$ is a polynomial. Polynomials don't have inverses in a finite field. If, as I suspect, $x$ stands for some element of $GF(8)$ you need to tell us which element. Or at least, tell us its minimal polynomial. You see, very often the field $GF(8)$ is defined as the quotient ring $GF(2)[x]/langle x^3+x+1rangle$. But, in that field the coset of $x^3+x+1$ is equal to zero. Again implying that it has no inverse (can't divide by zero).
    – Jyrki Lahtonen
    21 hours ago










  • The (only) other alternative is to have defined $GF(8)$ as the quotien $GF(2)[x]/langle x^3+x^2+1rangle$. In that case the coset of $x^3+x+1$ equals the coset of $x^2+x$ (because $(x^3+x+1)-(x^3+x^2+1)=x^2+x$). You can find the inverse of that by the usual process involving extended Euclid. You see, to positively id an element of the quotient ring we customarily reduce them by the polynomial defining the field.
    – Jyrki Lahtonen
    21 hours ago










  • By saying finite field, i mean the polynomial of the field, which is x^8+ x^4+ x^3+x+1. So i have to find the inverse of the first polynomial modulus this one
    – Mariam Mashuryan
    18 hours ago










  • What do you mean by $x^8 + x^4 + x^3 + x + 1$ being the "polynomial of the field"?
    – Tobias Kildetoft
    16 hours ago















up vote
0
down vote

favorite












I am trying to find the inverse of $x ^3+x +1$ in $GF(8)$.
I have done the Euclidean algorithm but I am stuck in the forward process to get the inverse. Please explain how to do it from reverse.










share|cite|improve this question









New contributor




Mariam Mashuryan is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.




















  • Do it this way - much less painful and less error-prone.
    – Bill Dubuque
    yesterday












  • Normally $x$ stands for an indeterminate, when $x^3+x+1$ is a polynomial. Polynomials don't have inverses in a finite field. If, as I suspect, $x$ stands for some element of $GF(8)$ you need to tell us which element. Or at least, tell us its minimal polynomial. You see, very often the field $GF(8)$ is defined as the quotient ring $GF(2)[x]/langle x^3+x+1rangle$. But, in that field the coset of $x^3+x+1$ is equal to zero. Again implying that it has no inverse (can't divide by zero).
    – Jyrki Lahtonen
    21 hours ago










  • The (only) other alternative is to have defined $GF(8)$ as the quotien $GF(2)[x]/langle x^3+x^2+1rangle$. In that case the coset of $x^3+x+1$ equals the coset of $x^2+x$ (because $(x^3+x+1)-(x^3+x^2+1)=x^2+x$). You can find the inverse of that by the usual process involving extended Euclid. You see, to positively id an element of the quotient ring we customarily reduce them by the polynomial defining the field.
    – Jyrki Lahtonen
    21 hours ago










  • By saying finite field, i mean the polynomial of the field, which is x^8+ x^4+ x^3+x+1. So i have to find the inverse of the first polynomial modulus this one
    – Mariam Mashuryan
    18 hours ago










  • What do you mean by $x^8 + x^4 + x^3 + x + 1$ being the "polynomial of the field"?
    – Tobias Kildetoft
    16 hours ago













up vote
0
down vote

favorite









up vote
0
down vote

favorite











I am trying to find the inverse of $x ^3+x +1$ in $GF(8)$.
I have done the Euclidean algorithm but I am stuck in the forward process to get the inverse. Please explain how to do it from reverse.










share|cite|improve this question









New contributor




Mariam Mashuryan is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











I am trying to find the inverse of $x ^3+x +1$ in $GF(8)$.
I have done the Euclidean algorithm but I am stuck in the forward process to get the inverse. Please explain how to do it from reverse.







number-theory galois-theory finite-fields cryptography






share|cite|improve this question









New contributor




Mariam Mashuryan is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











share|cite|improve this question









New contributor




Mariam Mashuryan is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









share|cite|improve this question




share|cite|improve this question








edited 16 hours ago





















New contributor




Mariam Mashuryan is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









asked yesterday









Mariam Mashuryan

13




13




New contributor




Mariam Mashuryan is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.





New contributor





Mariam Mashuryan is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






Mariam Mashuryan is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.












  • Do it this way - much less painful and less error-prone.
    – Bill Dubuque
    yesterday












  • Normally $x$ stands for an indeterminate, when $x^3+x+1$ is a polynomial. Polynomials don't have inverses in a finite field. If, as I suspect, $x$ stands for some element of $GF(8)$ you need to tell us which element. Or at least, tell us its minimal polynomial. You see, very often the field $GF(8)$ is defined as the quotient ring $GF(2)[x]/langle x^3+x+1rangle$. But, in that field the coset of $x^3+x+1$ is equal to zero. Again implying that it has no inverse (can't divide by zero).
    – Jyrki Lahtonen
    21 hours ago










  • The (only) other alternative is to have defined $GF(8)$ as the quotien $GF(2)[x]/langle x^3+x^2+1rangle$. In that case the coset of $x^3+x+1$ equals the coset of $x^2+x$ (because $(x^3+x+1)-(x^3+x^2+1)=x^2+x$). You can find the inverse of that by the usual process involving extended Euclid. You see, to positively id an element of the quotient ring we customarily reduce them by the polynomial defining the field.
    – Jyrki Lahtonen
    21 hours ago










  • By saying finite field, i mean the polynomial of the field, which is x^8+ x^4+ x^3+x+1. So i have to find the inverse of the first polynomial modulus this one
    – Mariam Mashuryan
    18 hours ago










  • What do you mean by $x^8 + x^4 + x^3 + x + 1$ being the "polynomial of the field"?
    – Tobias Kildetoft
    16 hours ago


















  • Do it this way - much less painful and less error-prone.
    – Bill Dubuque
    yesterday












  • Normally $x$ stands for an indeterminate, when $x^3+x+1$ is a polynomial. Polynomials don't have inverses in a finite field. If, as I suspect, $x$ stands for some element of $GF(8)$ you need to tell us which element. Or at least, tell us its minimal polynomial. You see, very often the field $GF(8)$ is defined as the quotient ring $GF(2)[x]/langle x^3+x+1rangle$. But, in that field the coset of $x^3+x+1$ is equal to zero. Again implying that it has no inverse (can't divide by zero).
    – Jyrki Lahtonen
    21 hours ago










  • The (only) other alternative is to have defined $GF(8)$ as the quotien $GF(2)[x]/langle x^3+x^2+1rangle$. In that case the coset of $x^3+x+1$ equals the coset of $x^2+x$ (because $(x^3+x+1)-(x^3+x^2+1)=x^2+x$). You can find the inverse of that by the usual process involving extended Euclid. You see, to positively id an element of the quotient ring we customarily reduce them by the polynomial defining the field.
    – Jyrki Lahtonen
    21 hours ago










  • By saying finite field, i mean the polynomial of the field, which is x^8+ x^4+ x^3+x+1. So i have to find the inverse of the first polynomial modulus this one
    – Mariam Mashuryan
    18 hours ago










  • What do you mean by $x^8 + x^4 + x^3 + x + 1$ being the "polynomial of the field"?
    – Tobias Kildetoft
    16 hours ago
















Do it this way - much less painful and less error-prone.
– Bill Dubuque
yesterday






Do it this way - much less painful and less error-prone.
– Bill Dubuque
yesterday














Normally $x$ stands for an indeterminate, when $x^3+x+1$ is a polynomial. Polynomials don't have inverses in a finite field. If, as I suspect, $x$ stands for some element of $GF(8)$ you need to tell us which element. Or at least, tell us its minimal polynomial. You see, very often the field $GF(8)$ is defined as the quotient ring $GF(2)[x]/langle x^3+x+1rangle$. But, in that field the coset of $x^3+x+1$ is equal to zero. Again implying that it has no inverse (can't divide by zero).
– Jyrki Lahtonen
21 hours ago




Normally $x$ stands for an indeterminate, when $x^3+x+1$ is a polynomial. Polynomials don't have inverses in a finite field. If, as I suspect, $x$ stands for some element of $GF(8)$ you need to tell us which element. Or at least, tell us its minimal polynomial. You see, very often the field $GF(8)$ is defined as the quotient ring $GF(2)[x]/langle x^3+x+1rangle$. But, in that field the coset of $x^3+x+1$ is equal to zero. Again implying that it has no inverse (can't divide by zero).
– Jyrki Lahtonen
21 hours ago












The (only) other alternative is to have defined $GF(8)$ as the quotien $GF(2)[x]/langle x^3+x^2+1rangle$. In that case the coset of $x^3+x+1$ equals the coset of $x^2+x$ (because $(x^3+x+1)-(x^3+x^2+1)=x^2+x$). You can find the inverse of that by the usual process involving extended Euclid. You see, to positively id an element of the quotient ring we customarily reduce them by the polynomial defining the field.
– Jyrki Lahtonen
21 hours ago




The (only) other alternative is to have defined $GF(8)$ as the quotien $GF(2)[x]/langle x^3+x^2+1rangle$. In that case the coset of $x^3+x+1$ equals the coset of $x^2+x$ (because $(x^3+x+1)-(x^3+x^2+1)=x^2+x$). You can find the inverse of that by the usual process involving extended Euclid. You see, to positively id an element of the quotient ring we customarily reduce them by the polynomial defining the field.
– Jyrki Lahtonen
21 hours ago












By saying finite field, i mean the polynomial of the field, which is x^8+ x^4+ x^3+x+1. So i have to find the inverse of the first polynomial modulus this one
– Mariam Mashuryan
18 hours ago




By saying finite field, i mean the polynomial of the field, which is x^8+ x^4+ x^3+x+1. So i have to find the inverse of the first polynomial modulus this one
– Mariam Mashuryan
18 hours ago












What do you mean by $x^8 + x^4 + x^3 + x + 1$ being the "polynomial of the field"?
– Tobias Kildetoft
16 hours ago




What do you mean by $x^8 + x^4 + x^3 + x + 1$ being the "polynomial of the field"?
– Tobias Kildetoft
16 hours ago















active

oldest

votes











Your Answer





StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});






Mariam Mashuryan is a new contributor. Be nice, and check out our Code of Conduct.










 

draft saved


draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2999014%2fmultiplicative-inverse-of-a-polynomial-in-gf8%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown






























active

oldest

votes













active

oldest

votes









active

oldest

votes






active

oldest

votes








Mariam Mashuryan is a new contributor. Be nice, and check out our Code of Conduct.










 

draft saved


draft discarded


















Mariam Mashuryan is a new contributor. Be nice, and check out our Code of Conduct.













Mariam Mashuryan is a new contributor. Be nice, and check out our Code of Conduct.












Mariam Mashuryan is a new contributor. Be nice, and check out our Code of Conduct.















 


draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2999014%2fmultiplicative-inverse-of-a-polynomial-in-gf8%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

Quarter-circle Tiles

build a pushdown automaton that recognizes the reverse language of a given pushdown automaton?

Mont Emei