Dickson pseudoprimes and primality testing

Authors:
Winfried B. Müller;Alan Oswald
Affiliations:
Institut für Mathematik, Universität Klagenfurt, Klagenfurt, Austria;School of Computing and Mathematics, Teesside Polytechnic, Middlesbrough, Cleveland, Great Britain
Venue:
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Year:
1991

Citing 4
Cited 0

Cryptanalysis of the Dickson-scheme

Proc. of a workshop on the theory and application of cryptographic techniques on Advances in cryptology---EUROCRYPT '85
A course in number theory and cryptography

A course in number theory and cryptography
A probabilistic primality test based on the properties of certain generalized Lucas numbers

Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Generalizations of the Fibonacci pseudoprimes test

Discrete Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper gives a general definition for the concept of strong Dickson pseudoprimes which contains as special cases the Carmichael numbers and the strong Fibonacci pseudoprimes. Furthermore, we give necessary and sufficient conditions for two important classes of strong Dickson pseudoprimes and deduce some properties for their elements. A suggestion of how to improve a primality test by Baillie&Wagstaff concludes the paper.