Some remarks on strong Fibonacci pseudoprimes (Q802641): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q592369 |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Herman J. Tiersma / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lucas Pseudoprimes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3807279 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3834120 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3792737 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4769119 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Generalizations of the Fibonacci pseudoprimes test / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3216750 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3713987 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3697115 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Über Permutationspolynome und Permutationsfunktionen für Primzahlpotenzen / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4039755 / rank | |||
Normal rank |
Latest revision as of 16:38, 21 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Some remarks on strong Fibonacci pseudoprimes |
scientific article |
Statements
Some remarks on strong Fibonacci pseudoprimes (English)
0 references
1990
0 references
The existence of strong Fibonacci pseudoprimes is an open problem. The contribution of the authors to this problem consists in the derivation of some necessary and sufficient conditions for an odd composite integer n to be a strong Fibonacci pseudoprime. One of the consequences of these conditions is that any such pseudoprime has to be a Carmichael number.
0 references
Lucas pseudoprimes
0 references
Dickson polynomial
0 references
public key cryptography
0 references
primality testing
0 references
strong Fibonacci pseudoprimes
0 references
Carmichael number
0 references