A generalisation of Brickell's algorithm for fast modular multiplication

DOI10.1007/BF01954895zbMath0663.68049MaRDI QIDQ1115183

J. K. Gibson

Publication date: 1988

Published in: BIT (Search for Journal in Brave)

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)

Cites Work

• Unnamed Item
• A Computer Algorithm for Calculating the Product AB Modulo M
• The parallel complexity of exponentiating polynomials over finite fields
• A method for obtaining digital signatures and public-key cryptosystems

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