Mixing
Bases for deterministic Miller-Rabin primality test
$begingroup$
Miller-Rabin primality test can be made deterministic when the number $n$ is small, for example "if $n < 2047$, it is enough to test [with base] $a = 2$".
How are those bases found? By brute force? Say I pick an upper bound 2047 and test many different bases to see if any of them always returns correct primality outcomes?
prime-numbers primality-test
asked Nov 30 '18 at 18:45
Ecir HanaEcir Hana
442414
$endgroup$
add a comment |
$begingroup$
Miller-Rabin primality test can be made deterministic when the number $n$ is small, for example "if $n < 2047$, it is enough to test [with base] $a = 2$".
How are those bases found? By brute force? Say I pick an upper bound 2047 and test many different bases to see if any of them always returns correct primality outcomes?
prime-numbers primality-test
asked Nov 30 '18 at 18:45
Ecir HanaEcir Hana
442414
$endgroup$
1
$begingroup$
May be Finding primes & proving primality and the listed references help; especially Jaeschke's paper On strong pseudoprimes to several bases
$endgroup$
– gammatester
Nov 30 '18 at 19:17
1
$begingroup$
The Wikipedia references are much more up to date than the primes.utm page, but certainly the basic references such as Jaeschke are worthwhile as they go into detail about the mathematics (not relying on exhaustive testing). For the efficient deterministic bases, somewhere past 32-bit they rely on the Feitsma/Galway enumeration of all base-2 strong pseudoprimes to get deterministic results for 64-bit inputs, which makes searches practical.
$endgroup$
– DanaJ
Nov 30 '18 at 19:50
add a comment |
$begingroup$
Miller-Rabin primality test can be made deterministic when the number $n$ is small, for example "if $n < 2047$, it is enough to test [with base] $a = 2$".
How are those bases found? By brute force? Say I pick an upper bound 2047 and test many different bases to see if any of them always returns correct primality outcomes?
prime-numbers primality-test
asked Nov 30 '18 at 18:45
Ecir HanaEcir Hana
442414
$endgroup$
Miller-Rabin primality test can be made deterministic when the number $n$ is small, for example "if $n < 2047$, it is enough to test [with base] $a = 2$".
How are those bases found? By brute force? Say I pick an upper bound 2047 and test many different bases to see if any of them always returns correct primality outcomes?
prime-numbers primality-test
prime-numbers primality-test
asked Nov 30 '18 at 18:45
Ecir HanaEcir Hana
442414
asked Nov 30 '18 at 18:45
Ecir HanaEcir Hana
442414
asked Nov 30 '18 at 18:45
Ecir HanaEcir Hana
442414
asked Nov 30 '18 at 18:45
Ecir HanaEcir Hana
442414
asked Nov 30 '18 at 18:45
Ecir HanaEcir Hana
442414
442414
1
$begingroup$
May be Finding primes & proving primality and the listed references help; especially Jaeschke's paper On strong pseudoprimes to several bases
$endgroup$
– gammatester
Nov 30 '18 at 19:17
1
$begingroup$
The Wikipedia references are much more up to date than the primes.utm page, but certainly the basic references such as Jaeschke are worthwhile as they go into detail about the mathematics (not relying on exhaustive testing). For the efficient deterministic bases, somewhere past 32-bit they rely on the Feitsma/Galway enumeration of all base-2 strong pseudoprimes to get deterministic results for 64-bit inputs, which makes searches practical.
$endgroup$
– DanaJ
Nov 30 '18 at 19:50
add a comment |
1
$begingroup$
May be Finding primes & proving primality and the listed references help; especially Jaeschke's paper On strong pseudoprimes to several bases
$endgroup$
– gammatester
Nov 30 '18 at 19:17
1
$begingroup$
The Wikipedia references are much more up to date than the primes.utm page, but certainly the basic references such as Jaeschke are worthwhile as they go into detail about the mathematics (not relying on exhaustive testing). For the efficient deterministic bases, somewhere past 32-bit they rely on the Feitsma/Galway enumeration of all base-2 strong pseudoprimes to get deterministic results for 64-bit inputs, which makes searches practical.
$endgroup$
– DanaJ
Nov 30 '18 at 19:50
1
1
$begingroup$
May be Finding primes & proving primality and the listed references help; especially Jaeschke's paper On strong pseudoprimes to several bases
$endgroup$
– gammatester
Nov 30 '18 at 19:17
$begingroup$
May be Finding primes & proving primality and the listed references help; especially Jaeschke's paper On strong pseudoprimes to several bases
$endgroup$
– gammatester
Nov 30 '18 at 19:17
1
1
$begingroup$
The Wikipedia references are much more up to date than the primes.utm page, but certainly the basic references such as Jaeschke are worthwhile as they go into detail about the mathematics (not relying on exhaustive testing). For the efficient deterministic bases, somewhere past 32-bit they rely on the Feitsma/Galway enumeration of all base-2 strong pseudoprimes to get deterministic results for 64-bit inputs, which makes searches practical.
$endgroup$
– DanaJ
Nov 30 '18 at 19:50
$begingroup$
The Wikipedia references are much more up to date than the primes.utm page, but certainly the basic references such as Jaeschke are worthwhile as they go into detail about the mathematics (not relying on exhaustive testing). For the efficient deterministic bases, somewhere past 32-bit they rely on the Feitsma/Galway enumeration of all base-2 strong pseudoprimes to get deterministic results for 64-bit inputs, which makes searches practical.
$endgroup$
– DanaJ
Nov 30 '18 at 19:50
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
You do it the other way round. You give a set of bases that are tested and look which composites pass the test based on this set.
In particular interesting is the smallest composite number passing the test.
If the set is, for example {$2,3$}, the smallest counterexample is $$1373653$$ Hence we can say : If $n<1373653$ and $n$ is a strong Fermat-pseudoprime to bases $2$ and $3$ , then $n$ is prime.
The poulet-numbers are calculated upto a large limit, using these numbers we can (assuming that the set contains $2$) accelerate the search dramatically, but since the poulet-numbers were basically found by brute force, there is probably no better method to find the smallest counterexamples (or good base-combinations with a large smallest counter-example) than brute force.
answered Feb 3 at 10:26
PeterPeter
49.3k1240138
$endgroup$
add a comment |
Your Answer
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%2f3020478%2fbases-for-deterministic-miller-rabin-primality-test%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$
You do it the other way round. You give a set of bases that are tested and look which composites pass the test based on this set.
In particular interesting is the smallest composite number passing the test.
If the set is, for example {$2,3$}, the smallest counterexample is $$1373653$$ Hence we can say : If $n<1373653$ and $n$ is a strong Fermat-pseudoprime to bases $2$ and $3$ , then $n$ is prime.
The poulet-numbers are calculated upto a large limit, using these numbers we can (assuming that the set contains $2$) accelerate the search dramatically, but since the poulet-numbers were basically found by brute force, there is probably no better method to find the smallest counterexamples (or good base-combinations with a large smallest counter-example) than brute force.
answered Feb 3 at 10:26
PeterPeter
49.3k1240138
$endgroup$
add a comment |
$begingroup$
You do it the other way round. You give a set of bases that are tested and look which composites pass the test based on this set.
In particular interesting is the smallest composite number passing the test.
If the set is, for example {$2,3$}, the smallest counterexample is $$1373653$$ Hence we can say : If $n<1373653$ and $n$ is a strong Fermat-pseudoprime to bases $2$ and $3$ , then $n$ is prime.
The poulet-numbers are calculated upto a large limit, using these numbers we can (assuming that the set contains $2$) accelerate the search dramatically, but since the poulet-numbers were basically found by brute force, there is probably no better method to find the smallest counterexamples (or good base-combinations with a large smallest counter-example) than brute force.
answered Feb 3 at 10:26
PeterPeter
49.3k1240138
$endgroup$
add a comment |
$begingroup$
You do it the other way round. You give a set of bases that are tested and look which composites pass the test based on this set.
In particular interesting is the smallest composite number passing the test.
If the set is, for example {$2,3$}, the smallest counterexample is $$1373653$$ Hence we can say : If $n<1373653$ and $n$ is a strong Fermat-pseudoprime to bases $2$ and $3$ , then $n$ is prime.
The poulet-numbers are calculated upto a large limit, using these numbers we can (assuming that the set contains $2$) accelerate the search dramatically, but since the poulet-numbers were basically found by brute force, there is probably no better method to find the smallest counterexamples (or good base-combinations with a large smallest counter-example) than brute force.
answered Feb 3 at 10:26
PeterPeter
49.3k1240138
$endgroup$
You do it the other way round. You give a set of bases that are tested and look which composites pass the test based on this set.
In particular interesting is the smallest composite number passing the test.
If the set is, for example {$2,3$}, the smallest counterexample is $$1373653$$ Hence we can say : If $n<1373653$ and $n$ is a strong Fermat-pseudoprime to bases $2$ and $3$ , then $n$ is prime.
The poulet-numbers are calculated upto a large limit, using these numbers we can (assuming that the set contains $2$) accelerate the search dramatically, but since the poulet-numbers were basically found by brute force, there is probably no better method to find the smallest counterexamples (or good base-combinations with a large smallest counter-example) than brute force.
answered Feb 3 at 10:26
PeterPeter
49.3k1240138
answered Feb 3 at 10:26
PeterPeter
49.3k1240138
answered Feb 3 at 10:26
PeterPeter
49.3k1240138
answered Feb 3 at 10:26
PeterPeter
49.3k1240138
49.3k1240138
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%2f3020478%2fbases-for-deterministic-miller-rabin-primality-test%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
1
$begingroup$
May be Finding primes & proving primality and the listed references help; especially Jaeschke's paper On strong pseudoprimes to several bases
$endgroup$
– gammatester
Nov 30 '18 at 19:17
1
$begingroup$
The Wikipedia references are much more up to date than the primes.utm page, but certainly the basic references such as Jaeschke are worthwhile as they go into detail about the mathematics (not relying on exhaustive testing). For the efficient deterministic bases, somewhere past 32-bit they rely on the Feitsma/Galway enumeration of all base-2 strong pseudoprimes to get deterministic results for 64-bit inputs, which makes searches practical.
$endgroup$
– DanaJ
Nov 30 '18 at 19:50