A fast algorithm for multiplicative inversion in GF(2/sup m/) using normal basis

DOI10.1109/12.926155zbMath1391.94800OpenAlexW2096979168MaRDI QIDQ4571328

Jun-Ichi Yoshiki, Kazuyoshi Takagi, Naofumi Takagi

Publication date: 9 July 2018

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/12.926155

Mathematics Subject Classification ID

Cryptography (94A60) Mathematical problems of computer architecture (68M07) Numerical algorithms for computer arithmetic, etc. (65Y04)

Related Items (4)

An extension of TYT algorithm for \(GF((2^n)^m)\) using precomputation ⋮ An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques ⋮ An extension of TYT inversion algorithm in polynomial basis ⋮ An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation

This page was built for publication: A fast algorithm for multiplicative inversion in GF(2/sup m/) using normal basis