Analysis of algorithms of generating key parameters for the XTR cryptosystems

MaRDI QIDQ3421477zbMATH OpenFDO

Authors Maciej Grześkowiak

Publication date 13 February 2007

zbMATH Keywords

hypothesis Hleast prime in arithmetic progressionprimality testingXTR public key cryptosystem

Mathematics Subject Classification ID

Primality (11Y11) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1857515
• CERTAIN CUBIC POLYNOMIALS OVER FINITE FIELDS
• Selected Areas in Cryptography
• scientific article; zbMATH DE number 1583781
• Algorithms for pairing-friendly primes

Cited in

(3)

• Generating elements of orders dividing \(p^6 \pm p^5 + p^4 \pm p^3 + p^2 \pm+1\)
• CERTAIN CUBIC POLYNOMIALS OVER FINITE FIELDS
• scientific article; zbMATH DE number 1857515 (Why is no real title available?)

This page was built for publication: Analysis of algorithms of generating key parameters for the XTR cryptosystems

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