Fast batch modular exponentiation with common-multiplicand multiplication

DOI10.1016/J.IPL.2017.09.003zbMath1419.68223OpenAlexW2751671579MaRDI QIDQ2410573

Jungjoo Seo, Kun Soo Park

Publication date: 18 October 2017

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10371/140679

zbMATH Keywords

cryptographymodular exponentiationcommon-multiplicand multiplication

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Cryptography (94A60)

Uses Software

• DSP56000

Cites Work

• Unnamed Item
• Improved batch exponentiation
• An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation
• Efficient signature generation by smart cards
• A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation.
• Modular Multiplication Without Trial Division
• Multi-exponentiation (cryptographic protocols)

This page was built for publication: Fast batch modular exponentiation with common-multiplicand multiplication