scientific article; zbMATH DE number 1302866

MaRDI QIDQ4249352zbMATHFDO

Authors Daniel V. Bailey, Christof Paar

Publication date 5 October 2000

zbMATH Keywords

cryptographyfinite fields

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• Efficient arithmetic in finite field extensions with application in elliptic curve cryptography.
• A comparison of different finite fields for elliptic curve cryptosystems
• An alternative class of irreducible polynomials for optimal extension fields
• scientific article; zbMATH DE number 1440071
• scientific article; zbMATH DE number 5636731

Cited in

(11)

• Efficient Explicit Formulae for Genus 2 Hyperelliptic Curves over Prime Fields and Their Implementations
• scientific article; zbMATH DE number 1878332 (Why is no real title available?)
• scientific article; zbMATH DE number 5066607 (Why is no real title available?)
• An alternative class of irreducible polynomials for optimal extension fields
• Efficient arithmetic in finite field extensions with application in elliptic curve cryptography.
• A comparison of different finite fields for elliptic curve cryptosystems
• Efficient software-implementation of finite fields with applications to cryptography
• Explicit Formulas for Efficient Multiplication in $\mathbb{F}_{3^{6m}}$
• Optimal Extension Field Inversion in the Frequency Domain
• scientific article; zbMATH DE number 1951623 (Why is no real title available?)
• Efficient hardware implementation of finite fields with applications to cryptography

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 Q4249352)