A Computer Algorithm for Calculating the Product AB Modulo M

DOI10.1109/TC.1983.1676262zbMath0522.68045MaRDI 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

cryptology; integer arithmetic; modular arithmetic; modular multiplication; multiple precision arithmetic; seminumerical algorithms; products in Galois fields

Mathematics Subject Classification ID

11-04: Software, source code, etc. for problems pertaining to number theory

11T55: Arithmetic theory of polynomial rings over finite fields

11A05: Multiplicative structure; Euclidean algorithm; greatest common divisors

68Q99: Theory of computing

12-04: Software, source code, etc. for problems pertaining to field theory

Related Items

Revisiting sum of residues modular multiplication, An iterative modular multiplication algorithm in RNS, 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, A fast modular multiplication algorithm for calculating the product \(AB\) modulo \(N\), An iterative modular multiplication algorithm, Memory-Constrained Implementations of Elliptic Curve Cryptography in Co-Z Coordinate Representation, Parallel modular multiplication with table look-up