Bit-Serial and Bit-Parallel Montgomery Multiplication and Squaring over GF(2^m)

DOI10.1109/TC.2009.70zbMath1367.94315OpenAlexW2136484227MaRDI QIDQ4974887

Arash Reyhani-Masoleh, Arash Hariri

Publication date: 8 August 2017

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

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

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Numerical algorithms for computer arithmetic, etc. (65Y04)

Related Items (3)

Reduction-free multiplication for finite fields and polynomial rings ⋮ Fast modular reduction and squaring in \(\mathrm{GF}(2^m)\) ⋮ A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers

This page was built for publication: Bit-Serial and Bit-Parallel Montgomery Multiplication and Squaring over GF(2^m)