An efficient Montgomery exponentiation algorithm for public-key cryptosystems

IEEE International Conference on Intelligence and Security Informatics, 2008, IEEE ISI 2008

Volumn , Issue , 2008, Pages 284-285

  Wu, Chia Long ^a   Lou, Der Chyuan ^b   Chang, Te Jen ^b  

^a AIR FORCE INSTITUTE OF TECHNOLOGY   (Taiwan)

^b NATIONAL DEFENSE UNIVERSITY   (Taiwan)

Author keywords

Common multiplicand multiplication; Cryptography; Public key cryptosystem; Signed digit recoding

Indexed keywords

CHLORINE COMPOUNDS; COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; DIGITAL SIGNAL PROCESSING; INTERSYMBOL INTERFERENCE; PUBLIC KEY CRYPTOGRAPHY;

BINARY METHODS; BINARY REPRESENTATIONS; COMMON-MULTIPLICAND MULTIPLICATION; EXPONENTIATION ALGORITHMS; INTERNATIONAL CONFERENCES; MODULAR EXPONENTIATION; MODULAR REDUCTION; MONTGOMERY; OCCURRENCE PROBABILITY; PUBLIC-KEY CRYPTOSYSTEM; PUBLIC-KEY CRYPTOSYSTEMS; SECURITY INFORMATICS; SIGNED-DIGIT RECODING;

ALGORITHMS;

EID: 51849090069     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISI.2008.4565086     Document Type: Conference Paper

References (3)

1. S. Arno and F. S. Wheeler, "Signed digit representations of minimal Hamming weight," IEEE Transactions on Computers, vol. 42, no. 8, pp. 1007-1010, Aug. 1993.
2. nd Edition, A. K. Peters, Natick, MA, 2002.
3. J.-C. Ha and S.-J. Moon, "A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation," Information Processing Letters, vol. 66, no. 2, pp. 105-107, April. 1998.