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

DOI10.1109/TC.2009.70MaRDI QIDQ4974887zbMATH OpenOpenAlexFDO

Authors Arash Hariri, Arash Reyhani-Masoleh

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) Numerical algorithms for computer arithmetic, etc. (65Y04) Cryptography (94A60)

Cited in

(7)

• Fast modular reduction and squaring in \(\mathrm{GF}(2^m)\)
• A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers
• scientific article; zbMATH DE number 1979304 (Why is no real title available?)
• A Parallel and Uniform k-Partition Method for Montgomery Multiplication
• Computational Science and Its Applications – ICCSA 2004
• scientific article; zbMATH DE number 5041007 (Why is no real title available?)
• Reduction-free multiplication for finite fields and polynomial rings

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4974887)