On the Baillie PSW conjecture (Q6638437)

The authors analyze the Baillie PSW conjecture, through the combined Fermat and Lucas tests, in order to determine the primality of a class of numbers.\N\NThe article proposes a solution based on the introduction of new restrictions on the numbers that could be FL-pseudoprimes, propose algorithms assumed to be more efficient, for their identification. It also offers a computational proof of the non-existence of FL-pseudoprimes, numerically limited to a previously known value.\N\NThe research proposed in this article is mainly addressed to young mathematical researchers who investigate number theory, especially primality tests and pseudoprimes, in an applied sense, in the field of cryptography.\N\NIt would have been useful to have treated the case of equivalent linear complexity for a bijection to particular spaces defined over nonsupersingular elliptic curves, as long as most of the applicabilities are in this area, as well as resistance to quantum computing attack.