Optimal software-implemented Itoh-Tsujii inversion for \(\mathbb{F}_{2^{m}}\)

DOI10.1007/S10623-016-0260-1zbMath1402.12003OpenAlexW2513793927MaRDI QIDQ510481

Jeremy Maitin-Shepard

Publication date: 10 February 2017

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-016-0260-1

zbMATH Keywords

global optimizationfinite fieldsimplementationsearchbenchmarkingaddition chainsItoh-Tsujii inversion

Mathematics Subject Classification ID

Searching and sorting (68P10) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Combinatorial optimization (90C27) Elliptic curves (14H52) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Uses Software

• ecmh

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved generation of minimal addition chains
• A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
• Itoh-Tsujii inversion in standard basis and its application in cryptography and codes
• Binary Elligator Squared
• Software Implementation of Binary Elliptic Curves: Impact of the Carry-Less Multiplier on Scalar Multiplication
• ECC2K-130 on Cell CPUs
• Efficient Software Implementation of Binary Field Arithmetic Using Vector Instruction Sets
• On Repeated Squarings in Binary Fields
• Efficient Generation of Minimal Length Addition Chains
• High Speed Compact Elliptic Curve Cryptoprocessor for FPGA Platforms

This page was built for publication: Optimal software-implemented Itoh-Tsujii inversion for \(\mathbb{F}_{2^{m}}\)