Message Boards Message Boards

0
|
8183 Views
|
8 Replies
|
4 Total Likes
View groups...
Share
Share this post:

How big a number can PrimeQ work?

8 Replies
POSTED BY: Adam Mendenhall

Hi there, thank you so much for your answer even though it was not what I wished ...but hey some questions really have no answer...thank you.

Implementation details will change with the next release, to use an updated version of the Baiillie-PSW method.

https://arxiv.org/abs/2006.14425

This of course remains probabilistic. Here is Robert Baillie's remark though, which strikes me as quite apt for the problem at hand. "There are zero known counterexamples to the original BPSW, and we expect the new test to have even fewer :)"

POSTED BY: Daniel Lichtblau

Thank you Dr. Daniel looking forward to it... i will read the article you send me...thank you so much!!!

Posted 2 years ago

So was updated PSW implemented?

POSTED BY: ZAQU zaqu

Yes, PrimeQ uses the recent version of PSW.

POSTED BY: Daniel Lichtblau
Posted 2 years ago

So base 3 Miller-Rabin no longer is used, THAT is great. BTW, you did not forget gcd(Q, n) == 1 check, right? See other implementation: https://github.com/entropyxyz/crypto-primes/pull/11

POSTED BY: ZAQU zaqu

As best I can tell, the Miller-Rabin 3-psuedoprime test is not used.

Regarding our current Lucas test, I believe the reference implementation I posted on Community is equivalent to what is implemented in our internal code.

POSTED BY: Daniel Lichtblau
Reply to this discussion
Community posts can be styled and formatted using the Markdown syntax.
Reply Preview
Attachments
Remove
or Discard

Group Abstract Group Abstract