A generalisation of Brickell's algorithm for fast modular multiplication

DOI10.1007/BF01954895MaRDI QIDQ1115183zbMATH OpenFDO

Authors J. K. Gibson

Publication date 1988

Published in BIT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01954895

zbMATH Keywords

cryptographycomputer arithmeticcomputational number theorymodular multiplication

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Radix representation; digital problems (11A63)

Recommendations

• A fast modular multiplication algorithm
• A faster modular multiplication algorithm
• scientific article; zbMATH DE number 1294069
• scientific article; zbMATH DE number 4191561
• New modular multiplication algorithms for fast modular exponentiation
• Fast algorithms for implemention of Montgomery's modular multiplication technique
• A fast parallel modular exponentiation algorithm
• An Algorithm for Multiplication in Modular Arithmetic
• New iterative algorithms for modular multiplication
• A fast modular multiplication algorithm for calculating the product \(AB\) modulo \(N\)

Cites work

• scientific article; zbMATH DE number 3812999 (Why is no real title available?)
• A Computer Algorithm for Calculating the Product AB Modulo M
• A method for obtaining digital signatures and public-key cryptosystems
• The parallel complexity of exponentiating polynomials over finite fields

Cited in

(2)

• scientific article; zbMATH DE number 5679233 (Why is no real title available?)
• Another look at some fast modular arithmetic methods

This page was built for publication: A generalisation of Brickell's algorithm for fast modular multiplication

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