Effects of Optimizations for Software Implementations of Small Binary Field Arithmetic

DOI10.1007/978-3-540-73074-3_7MaRDI QIDQ5426081zbMATH OpenOpenAlexFDO

Authors Nicolas Thériault, Roberto Maria Avanzi

Publication date 15 November 2007

Published in Arithmetic of Finite Fields (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73074-3_7

zbMATH Keywords

efficient implementationcurve-based cryptographyBinary fields

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)

Recommendations

• Efficient software implementation of binary field arithmetic using vector instruction sets
• Efficient software-implementation of finite fields with applications to cryptography
• Optimal software-implemented Itoh-Tsujii inversion for \(\mathbb{F}_{2^{m}}\)
• scientific article; zbMATH DE number 1759315
• scientific article; zbMATH DE number 2043312

Cited in

(6)

• Group arithmetic in \(C_{3,5}\) curves
• Efficient software implementation of binary field arithmetic using vector instruction sets
• Redundant \(\tau \)-adic expansions. I: Non-adjacent digit sets and their applications to scalar multiplication
• Batch binary Weierstrass
• Extended elliptic curve Montgomery ladder algorithm over binary fields with resistance to simple power analysis
• Another Look at Square Roots (and Other Less Common Operations) in Fields of Even Characteristic

Describes a project that uses

Uses Software

• HECC
• NTL

This page was built for publication: Effects of Optimizations for Software Implementations of Small Binary Field Arithmetic

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