Some remarks on strong Fibonacci pseudoprimes

DOI10.1007/BF01810848zbMath0726.11002MaRDI QIDQ802641

Rudolf Lidl, Alan Oswald, Winfried B. Müller

Publication date: 1990

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

zbMATH Keywords

public key cryptographyDickson polynomialCarmichael numberprimality testingLucas pseudoprimesstrong Fibonacci pseudoprimes

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Factorization; primality (11A51) Primes (11A41) Factorization (11Y05) Primality (11Y11)

Related Items (4)

Building pseudoprimes with a large number of prime factors ⋮ RSA, Dickson, LUC and Williams: a study on four polynomial-type public-key cryptosystems ⋮ On strong Dickson pseudoprimes ⋮ Higher-order Carmichael numbers

Cites Work

• Generalizations of the Fibonacci pseudoprimes test
• Über Permutationspolynome und Permutationsfunktionen für Primzahlpotenzen
• Lucas Pseudoprimes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some remarks on strong Fibonacci pseudoprimes