Montgomery multiplication in \(\text{GF}(2^ k)\)

DOI10.1023/A:1008208521515zbMath0887.11054OpenAlexW2103774873MaRDI QIDQ1379662

Tolga Acar, Çetin Kaya Koç

Publication date: 10 May 1998

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

Full work available at URL: https://doi.org/10.1023/a:1008208521515

zbMATH Keywords

finite fieldsanalysis of algorithmMontgomery multiplicationsquaring

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Related Items (16)

Polynomial basis multiplication over \(\text{GF}(2^m)\) ⋮ Programmable cellular automata based Montgomery hardware architecture ⋮ MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity ⋮ Montgomery Residue Representation Fault-Tolerant Computation in GF(2 k ) ⋮ Modular Reduction in GF(2 n ) without Pre-computational Phase ⋮ Digit-Serial Structures for the Shifted Polynomial Basis Multiplication over Binary Extension Fields ⋮ Montgomery multiplication over rings ⋮ Communication-computation trade-off in executing ECDSA in a contactless smartcard ⋮ Faster Montgomery Modular Multiplication without Pre-computational Phase For Some Classes of Finite Fields ⋮ $\mathbf{Li}^{\boldsymbol{(p)}}$-service? An algorithm for computing $\boldsymbol{p}$-adic polylogarithms ⋮ A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers ⋮ Montgomery exponent architecture based on programmable cellular automata ⋮ Subquadratic Polynomial Multiplication over GF(2 m ) Using Trinomial Bases and Chinese Remaindering ⋮ Efficient implementation of the Galois counter mode using a carry-less multiplier and a fast reduction algorithm ⋮ Rings of low multiplicative complexity ⋮ An iterative modular multiplication algorithm in RNS

This page was built for publication: Montgomery multiplication in \(\text{GF}(2^ k)\)