An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques
type: Item
instance of: scholarly article
title: An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques
zbMATH Open document ID: 1109.68129
author: Der-Chyuan Lou
author: Jui-Chang Lai
author: Chia-Long Wu
author: Te-Jen Chang
published in: Applied Mathematics and Computation
publication date: 2007-03-12T00:00:00Z
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 5132895
zbMATH Keywords: Montgomery algorithm
zbMATH Keywords: modular exponentiation
zbMATH Keywords: exponent-folding technique
zbMATH Keywords: algorithm analysis
zbMATH Keywords: canonical-signed-digit recoding
MaRDI profile type: Publication
full work available at URL: j.amc.2006.06.089
OpenAlex ID: W2054293188
cites work: A method for obtaining digital signatures and public-key cryptosystems
cites work: A public key cryptosystem and a signature scheme based on discrete logarithms
cites work: New directions in cryptography
cites work: Computer arithmetic algorithms.
cites work: Modular Multiplication Without Trial Division
cites work: Q4036874
cites work: Q5585020
cites work: Fast exponentiation by folding the signed-digit exponent in half
cites work: Optimal left-to-right binary signed-digit recoding
cites work: A Survey of Fast Exponentiation Methods
cites work: Q4718481
cites work: Q4036876
cites work: Q5708977
cites work: Algorithm of asynchronous binary signed-digit recoding on fast multiexponentiation
cites work: Q5730090
cites work: A fast algorithm for multiplicative inversion in GF(2/sup m/) using normal basis
cites work: Fast exponentiation in subgroups of finite fields
cites work: A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation.
DOI: 10.1016/J.AMC.2006.06.089
description: scientific article; zbMATH DE number 5132895