Mixing
Gröbner basis vs Brute Force Attacks on GF(2) polynomial system of equations?
$begingroup$
I'm studying cryptography and I have a question regarding the complexity analysis of algorithms.
In AES cryptography, the Gröbner basis algorithm for solving systems of polynomial equations over the GF(2) field is said to have a double exponential running time in the worst case scenario.
My question is, why then is the Gröbner basis algorithm still celebrated and considered one of the best algorithms when it comes to breaking systems of polynomial equations? It seems as though, the brute force method, although impractical, would yield better results that the Gröbner bases as it only requires guessing through all the variables you have. Say you have $n$ variables. You'd have to guess $2^n$ times. It seems that brute force is much better than the double exponential running time scenario.
I have also done my own computations in SageMath, generating systems of equations up to a degree $10$ with $10$ variables. The system has only one answer. Brute force gives the solution in less than 2 seconds, whereas SageMath's Gröbner basis' method gives it in slightly over 18 seconds. However, when the maximum degree was lowered to $2$, the Gröbner basis method was comparable to the brute force method, giving the answer in 1.8 seconds.
Does the efficiency of the Gröbner basis method rely on the highest maximum of the polynomial? I've read through Buchberger's algorithm of Gröbner basis computation, and I couldn't find an intuitive reason why this is so.
P.S. I felt this question would be more suitable in mathematics instead of CS as it deals more with the workings of Gröbner basis computations.
computer-science cryptography groebner-basis
asked Jan 30 at 1:17
Yip Jung HonYip Jung Hon
48112
$endgroup$
add a comment |
$begingroup$
I'm studying cryptography and I have a question regarding the complexity analysis of algorithms.
In AES cryptography, the Gröbner basis algorithm for solving systems of polynomial equations over the GF(2) field is said to have a double exponential running time in the worst case scenario.
My question is, why then is the Gröbner basis algorithm still celebrated and considered one of the best algorithms when it comes to breaking systems of polynomial equations? It seems as though, the brute force method, although impractical, would yield better results that the Gröbner bases as it only requires guessing through all the variables you have. Say you have $n$ variables. You'd have to guess $2^n$ times. It seems that brute force is much better than the double exponential running time scenario.
I have also done my own computations in SageMath, generating systems of equations up to a degree $10$ with $10$ variables. The system has only one answer. Brute force gives the solution in less than 2 seconds, whereas SageMath's Gröbner basis' method gives it in slightly over 18 seconds. However, when the maximum degree was lowered to $2$, the Gröbner basis method was comparable to the brute force method, giving the answer in 1.8 seconds.
Does the efficiency of the Gröbner basis method rely on the highest maximum of the polynomial? I've read through Buchberger's algorithm of Gröbner basis computation, and I couldn't find an intuitive reason why this is so.
P.S. I felt this question would be more suitable in mathematics instead of CS as it deals more with the workings of Gröbner basis computations.
computer-science cryptography groebner-basis
asked Jan 30 at 1:17
Yip Jung HonYip Jung Hon
48112
$endgroup$
add a comment |
$begingroup$
I'm studying cryptography and I have a question regarding the complexity analysis of algorithms.
In AES cryptography, the Gröbner basis algorithm for solving systems of polynomial equations over the GF(2) field is said to have a double exponential running time in the worst case scenario.
My question is, why then is the Gröbner basis algorithm still celebrated and considered one of the best algorithms when it comes to breaking systems of polynomial equations? It seems as though, the brute force method, although impractical, would yield better results that the Gröbner bases as it only requires guessing through all the variables you have. Say you have $n$ variables. You'd have to guess $2^n$ times. It seems that brute force is much better than the double exponential running time scenario.
I have also done my own computations in SageMath, generating systems of equations up to a degree $10$ with $10$ variables. The system has only one answer. Brute force gives the solution in less than 2 seconds, whereas SageMath's Gröbner basis' method gives it in slightly over 18 seconds. However, when the maximum degree was lowered to $2$, the Gröbner basis method was comparable to the brute force method, giving the answer in 1.8 seconds.
Does the efficiency of the Gröbner basis method rely on the highest maximum of the polynomial? I've read through Buchberger's algorithm of Gröbner basis computation, and I couldn't find an intuitive reason why this is so.
P.S. I felt this question would be more suitable in mathematics instead of CS as it deals more with the workings of Gröbner basis computations.
computer-science cryptography groebner-basis
asked Jan 30 at 1:17
Yip Jung HonYip Jung Hon
48112
$endgroup$
I'm studying cryptography and I have a question regarding the complexity analysis of algorithms.
In AES cryptography, the Gröbner basis algorithm for solving systems of polynomial equations over the GF(2) field is said to have a double exponential running time in the worst case scenario.
My question is, why then is the Gröbner basis algorithm still celebrated and considered one of the best algorithms when it comes to breaking systems of polynomial equations? It seems as though, the brute force method, although impractical, would yield better results that the Gröbner bases as it only requires guessing through all the variables you have. Say you have $n$ variables. You'd have to guess $2^n$ times. It seems that brute force is much better than the double exponential running time scenario.
I have also done my own computations in SageMath, generating systems of equations up to a degree $10$ with $10$ variables. The system has only one answer. Brute force gives the solution in less than 2 seconds, whereas SageMath's Gröbner basis' method gives it in slightly over 18 seconds. However, when the maximum degree was lowered to $2$, the Gröbner basis method was comparable to the brute force method, giving the answer in 1.8 seconds.
Does the efficiency of the Gröbner basis method rely on the highest maximum of the polynomial? I've read through Buchberger's algorithm of Gröbner basis computation, and I couldn't find an intuitive reason why this is so.
P.S. I felt this question would be more suitable in mathematics instead of CS as it deals more with the workings of Gröbner basis computations.
computer-science cryptography groebner-basis
computer-science cryptography groebner-basis
asked Jan 30 at 1:17
Yip Jung HonYip Jung Hon
48112
asked Jan 30 at 1:17
Yip Jung HonYip Jung Hon
48112
asked Jan 30 at 1:17
Yip Jung HonYip Jung Hon
48112
asked Jan 30 at 1:17
Yip Jung HonYip Jung Hon
48112
asked Jan 30 at 1:17
Yip Jung HonYip Jung Hon
48112
48112
add a comment |
add a comment |
0
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',
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%2f3092970%2fgr%25c3%25b6bner-basis-vs-brute-force-attacks-on-gf2-polynomial-system-of-equations%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
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%2f3092970%2fgr%25c3%25b6bner-basis-vs-brute-force-attacks-on-gf2-polynomial-system-of-equations%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
