A verification of brickell's fast modular multiplication algorithm

DOI10.1080/00207169008803847MaRDI QIDQ4009756zbMATH OpenOpenAlexFDO

Authors Colin D. Walter, Stephen E. Eldridge

Publication date 27 September 1992

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207169008803847

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites work

• A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields (preliminary draft)
• A method for obtaining digital signatures and public-key cryptosystems

Cited in

(2)

• A faster modular multiplication algorithm
• Fast modular multiplication using 2-power radix

This page was built for publication: A verification of brickell's fast modular multiplication algorithm

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