An efficient modulo \(p\) multiplication algorithm with moderate factors of \(p+1\) and \(p-1\)

DOI10.4310/CMS.2007.V5.N2.A8zbMath1148.68363OpenAlexW2055651258MaRDI QIDQ2470834

Sheng-Hua Shiau, Ren-Junn Hwang, Feng-Fu Su

Publication date: 15 February 2008

Published in: Communications in Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.cms/1183990371

zbMATH Keywords

modular exponentiationstrong primeRSA cryptosystemmodular multiplication

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

This page was built for publication: An efficient modulo \(p\) multiplication algorithm with moderate factors of \(p+1\) and \(p-1\)