Effects of Optimizations for Software Implementations of Small Binary Field Arithmetic

DOI10.1007/978-3-540-73074-3_7zbMath1213.94079OpenAlexW1811688889MaRDI QIDQ5426081

Nicolas Thériault, Roberto M. 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

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

Related Items (4)

Redundant \(\tau \)-adic expansions. I: Non-adjacent digit sets and their applications to scalar multiplication ⋮ Group arithmetic in \(C_{3,5}\) curves ⋮ 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

Uses Software

• NTL
• HECC

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