Fast parallel modular exponentiation

MaRDI QIDQ2745059zbMATH OpenFDO

Authors Salem Sherif El Fard

Publication date 9 October 2001

Published in Visnyk. Seriya: Fizyko-Matematychni Nauky. Kyïvs'kyĭ Universytet Imeni Tarasa Shevchenka (Search for Journal in Brave)

zbMATH Keywords

modular exponentiationlarge numbersfast parallel algorithmpublic-key systems of data protection

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Parallel algorithms in computer science (68W10)

Cited in

(10)

• SPEEDING UP MULTI- EXPONENTIATION ALGORITHM ON A MULTICORE SYSTEM
• Parallel modular exponentiation using load balancing without precomputation
• A practical parallel algorithm for computinga b modc *
• Parallel exponentiation using common-multiplicand-multiplication and signed-digit-folding techniques
• Topics in Cryptology – CT-RSA 2004
• Computational efficiency analysis of Wu et al.'s fast modular multi-exponentiation algorithm
• Some Observations on Parallel Algorithms for Fast Exponentiation in $\operatorname{GF}(2^n)$
• Highly parallel computations modulo a number having only small prime factors
• Efficient algorithms for remainder computation and exponentiation of long numbers
• Parallel modular multiplication with table look-up

This page was built for publication: Fast parallel modular exponentiation

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