Mixing
What does affine equivalence mean in the context of cryptographic boolean functions?
$begingroup$
The definition of affine equivalence is that 2 $n$-variable Boolean functions are affine equivalent if there exist affine permutations $A$ of ${F}^n_2$ such that $g(x)=f(A(x))$.
What do affine permutations mean here? And how do they apply to the definition of affine equivalence?
It would be great if anyone could share their understanding of affine equivalence. Thank you so much for your time!
boolean-algebra cryptography
asked Jan 22 at 16:05
HannahHannah
61
$endgroup$
add a comment |
$begingroup$
The definition of affine equivalence is that 2 $n$-variable Boolean functions are affine equivalent if there exist affine permutations $A$ of ${F}^n_2$ such that $g(x)=f(A(x))$.
What do affine permutations mean here? And how do they apply to the definition of affine equivalence?
It would be great if anyone could share their understanding of affine equivalence. Thank you so much for your time!
boolean-algebra cryptography
asked Jan 22 at 16:05
HannahHannah
61
$endgroup$
add a comment |
$begingroup$
The definition of affine equivalence is that 2 $n$-variable Boolean functions are affine equivalent if there exist affine permutations $A$ of ${F}^n_2$ such that $g(x)=f(A(x))$.
What do affine permutations mean here? And how do they apply to the definition of affine equivalence?
It would be great if anyone could share their understanding of affine equivalence. Thank you so much for your time!
boolean-algebra cryptography
asked Jan 22 at 16:05
HannahHannah
61
$endgroup$
The definition of affine equivalence is that 2 $n$-variable Boolean functions are affine equivalent if there exist affine permutations $A$ of ${F}^n_2$ such that $g(x)=f(A(x))$.
What do affine permutations mean here? And how do they apply to the definition of affine equivalence?
It would be great if anyone could share their understanding of affine equivalence. Thank you so much for your time!
boolean-algebra cryptography
boolean-algebra cryptography
asked Jan 22 at 16:05
HannahHannah
61
asked Jan 22 at 16:05
HannahHannah
61
asked Jan 22 at 16:05
HannahHannah
61
asked Jan 22 at 16:05
HannahHannah
61
asked Jan 22 at 16:05
HannahHannah
61
61
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
In the context of finite fields, a boolean function is a mapping $$F:mathbb{F}_{2^n}rightarrow mathbb{F}_2.$$
Such a function is linear (the representation below is sometimes called a linearized polynomial) if it can be expressed as
$$
F(x)=sum_{i=0}^{n-1} a_i x^{2^i},quad a_i in mathbb{F}_{2^n}.
$$
If $F(0)=a_0=0,$ then the function is called linear, otherwise it is called affine.
There are families of such functions which give permutations, and those are the ones referred to in this case.
Claude Carlet has chapters on boolean functions and vector boolean functions you can find with a google search.
answered Jan 23 at 4:03
kodlukodlu
3,390716
$endgroup$
add a comment |
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',
autoActivateHeartbeat: false,
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
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3083341%2fwhat-does-affine-equivalence-mean-in-the-context-of-cryptographic-boolean-functi%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
In the context of finite fields, a boolean function is a mapping $$F:mathbb{F}_{2^n}rightarrow mathbb{F}_2.$$
Such a function is linear (the representation below is sometimes called a linearized polynomial) if it can be expressed as
$$
F(x)=sum_{i=0}^{n-1} a_i x^{2^i},quad a_i in mathbb{F}_{2^n}.
$$
If $F(0)=a_0=0,$ then the function is called linear, otherwise it is called affine.
There are families of such functions which give permutations, and those are the ones referred to in this case.
Claude Carlet has chapters on boolean functions and vector boolean functions you can find with a google search.
answered Jan 23 at 4:03
kodlukodlu
3,390716
$endgroup$
add a comment |
$begingroup$
In the context of finite fields, a boolean function is a mapping $$F:mathbb{F}_{2^n}rightarrow mathbb{F}_2.$$
Such a function is linear (the representation below is sometimes called a linearized polynomial) if it can be expressed as
$$
F(x)=sum_{i=0}^{n-1} a_i x^{2^i},quad a_i in mathbb{F}_{2^n}.
$$
If $F(0)=a_0=0,$ then the function is called linear, otherwise it is called affine.
There are families of such functions which give permutations, and those are the ones referred to in this case.
Claude Carlet has chapters on boolean functions and vector boolean functions you can find with a google search.
answered Jan 23 at 4:03
kodlukodlu
3,390716
$endgroup$
add a comment |
$begingroup$
In the context of finite fields, a boolean function is a mapping $$F:mathbb{F}_{2^n}rightarrow mathbb{F}_2.$$
Such a function is linear (the representation below is sometimes called a linearized polynomial) if it can be expressed as
$$
F(x)=sum_{i=0}^{n-1} a_i x^{2^i},quad a_i in mathbb{F}_{2^n}.
$$
If $F(0)=a_0=0,$ then the function is called linear, otherwise it is called affine.
There are families of such functions which give permutations, and those are the ones referred to in this case.
Claude Carlet has chapters on boolean functions and vector boolean functions you can find with a google search.
answered Jan 23 at 4:03
kodlukodlu
3,390716
$endgroup$
In the context of finite fields, a boolean function is a mapping $$F:mathbb{F}_{2^n}rightarrow mathbb{F}_2.$$
Such a function is linear (the representation below is sometimes called a linearized polynomial) if it can be expressed as
$$
F(x)=sum_{i=0}^{n-1} a_i x^{2^i},quad a_i in mathbb{F}_{2^n}.
$$
If $F(0)=a_0=0,$ then the function is called linear, otherwise it is called affine.
There are families of such functions which give permutations, and those are the ones referred to in this case.
Claude Carlet has chapters on boolean functions and vector boolean functions you can find with a google search.
answered Jan 23 at 4:03
kodlukodlu
3,390716
answered Jan 23 at 4:03
kodlukodlu
3,390716
answered Jan 23 at 4:03
kodlukodlu
3,390716
answered Jan 23 at 4:03
kodlukodlu
3,390716
3,390716
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3083341%2fwhat-does-affine-equivalence-mean-in-the-context-of-cryptographic-boolean-functi%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
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
