Some remarks on strong Fibonacci pseudoprimes
From MaRDI portal
Publication:802641
DOI10.1007/BF01810848zbMath0726.11002MaRDI QIDQ802641
Winfried B. Müller, Rudolf Lidl, Alan Oswald
Publication date: 1990
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
public key cryptography; Dickson polynomial; Carmichael number; primality testing; Lucas pseudoprimes; strong Fibonacci pseudoprimes
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
11A51: Factorization; primality
11A41: Primes
11Y05: Factorization
11Y11: Primality
Related Items
Higher-order Carmichael numbers, On strong Dickson pseudoprimes, Building pseudoprimes with a large number of prime factors, RSA, Dickson, LUC and Williams: a study on four polynomial-type public-key cryptosystems
Cites Work