Some remarks on strong Fibonacci pseudoprimes

DOI10.1007/BF01810848zbMATH Open0726.11002MaRDI QIDQ802641FDOQ802641

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

Publication date: 1990

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

Recommendations

• scientific article
• scientific article; zbMATH DE number 4189810
• scientific article; zbMATH DE number 98710
• Pseudoprime values of the Fibonacci sequence, polynomials and the Euler function
• scientific article; zbMATH DE number 7646865

zbMATH Keywords

Dickson polynomialpublic key cryptographyCarmichael numberprimality testingLucas pseudoprimesstrong Fibonacci pseudoprimes

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Lucas Pseudoprimes
• Über Permutationspolynome und Permutationsfunktionen für Primzahlpotenzen
• Title not available (Why is that?)
• Generalizations of the Fibonacci pseudoprimes test
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (8)

• Title not available (Why is that?)
• A note on strong Dickson pseudoprimes
• Building pseudoprimes with a large number of prime factors
• Title not available (Why is that?)
• Title not available (Why is that?)
• RSA, Dickson, LUC and Williams: a study on four polynomial-type public-key cryptosystems
• Higher-order Carmichael numbers
• On strong Dickson pseudoprimes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q802641)