Analysis of the variable length nonzero window method for exponentiation

DOI10.1016/S0898-1221(99)00084-XzbMath0935.94022MaRDI QIDQ1963003

Yanyan Li

Publication date: 20 January 2000

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

modular exponentiationexponentiationaddition chainRSA cryptosystemvariable length nonzero window method

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

How to compute modular exponentiation with large operators based on the right-to-left binary algorithm

Uses Software

• GAP

Cites Work

• Analysis of sliding window techniques for exponentiation
• New Modular Multiplication Algorithms for Fast Modular Exponentiation
• Modular Multiplication Without Trial Division
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Computing Sequences with Addition Chains
• A method for obtaining digital signatures and public-key cryptosystems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item