Strengthening the Baillie-PSW primality test

06/25/2020
by   Robert Baillie, et al.
0

The Baillie-PSW primality test combines Fermat and Lucas probable prime tests. It reports that a number is either composite or probably prime. No odd composite integer has been reported to pass this combination of primality tests if the parameters are chosen in an appropriate way. Here, we describe a significant strengthening of this test that comes at almost no additional computational cost. This is achieved by including in the test what we call Lucas-V pseudoprimes, of which there are only five less than 10^15.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/24/2022

Random primes without primality testing

Numerous algorithms call for computation over the integers modulo a rand...
research
05/02/2017

Towards an Automated Optimization of Laminated Composite Structures: Hierarchical Zoning Approach with Exact Blending Rules

We present an automated methodology to optimize laminated composite stru...
research
11/30/2020

Combined Sieve Algorithm for Prime Gaps

A new Combined Sieve algorithm is presented with cost proportional to th...
research
09/16/2022

An Efficient Modular Exponentiation Proof Scheme

We present an efficient proof scheme for any instance of left-to-right m...
research
08/17/2021

Stable combination tests

This paper proposes a stable combination test, which is a natural extens...
research
06/15/2020

Taxonomy and Practical Evaluation of Primality Testing Algorithms

Modern cryptography algorithms are commonly used to ensure information s...
research
11/19/2021

Composite Goodness-of-fit Tests with Kernels

Model misspecification can create significant challenges for the impleme...

Please sign up or login with your details

Forgot password? Click here to reset