A Computer Algorithm for Calculating the Product AB Modulo M

DOI10.1109/TC.1983.1676262zbMath0522.68045OpenAlexW2063884927MaRDI QIDQ3673107

G. R. Blakley

Publication date: 1983

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

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

zbMATH Keywords

cryptologyinteger arithmeticmodular arithmeticmodular multiplicationmultiple precision arithmeticseminumerical algorithmsproducts in Galois fields

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to number theory (11-04) Arithmetic theory of polynomial rings over finite fields (11T55) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Theory of computing (68Q99) Software, source code, etc. for problems pertaining to field theory (12-04)

Related Items (11)

Efficient software-implementation of finite fields with applications to cryptography ⋮ Efficient hardware implementation of finite fields with applications to cryptography ⋮ A generalisation of Brickell's algorithm for fast modular multiplication ⋮ Encroaching lists as a measure of presortedness ⋮ Reduction-free multiplication for finite fields and polynomial rings ⋮ Memory-Constrained Implementations of Elliptic Curve Cryptography in Co-Z Coordinate Representation ⋮ Revisiting sum of residues modular multiplication ⋮ Parallel modular multiplication with table look-up ⋮ A fast modular multiplication algorithm for calculating the product \(AB\) modulo \(N\) ⋮ An iterative modular multiplication algorithm ⋮ An iterative modular multiplication algorithm in RNS

This page was built for publication: A Computer Algorithm for Calculating the Product AB Modulo M