scientific article; zbMATH DE number 1302866

zbMATH Open0945.11025MaRDI QIDQ4249352FDOQ4249352

Authors: Daniel V. Bailey, Christof Paar 

Publication date: 5 October 2000

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

cryptographyfinite fields

Mathematics Subject Classification ID

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

Cited In (11)

• Title not available (Why is that?)
• Title not available (Why is that?)
• An alternative class of irreducible polynomials for optimal extension fields
• Efficient software-implementation of finite fields with applications to cryptography
• Optimal Extension Field Inversion in the Frequency Domain
• A comparison of different finite fields for elliptic curve cryptosystems
• Explicit Formulas for Efficient Multiplication in $\mathbb{F}_{3^{6m}}$
• Title not available (Why is that?)
• Efficient Explicit Formulae for Genus 2 Hyperelliptic Curves over Prime Fields and Their Implementations
• Efficient arithmetic in finite field extensions with application in elliptic curve cryptography.
• 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)