scientific article; zbMATH DE number 4157891

MaRDI QIDQ3485872zbMATH OpenFDO

Authors Helmut Postl

Publication date 1988

zbMATH Keywords

Dickson polynomialsevaluation algorithm

Mathematics Subject Classification ID

Computational aspects and applications of commutative rings (13P99) Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 1839603
• scientific article; zbMATH DE number 939316
• The world's most interesting class of integral polynomials.
• The fast cascade exponentiation algorithm and its applications on cryptography
• A small secret exponent attack on cryptosystems using Dickson polynomials

Cited in

(5)

• Generalizations of the Fibonacci pseudoprimes test
• On strong Dickson pseudoprimes
• Fast recursive computation of Krawtchouk polynomials
• RSA, Dickson, LUC and Williams: a study on four polynomial-type public-key cryptosystems
• Fast evaluation of trigonometric polynomials from hyperbolic crosses

This page was built for publication:

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