15 October 2012 Modular multiplication in GF(p) for public-key cryptography
Author Affiliations +
Proceedings Volume 8454, Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments 2012; 84542E (2012) https://doi.org/10.1117/12.2000065
Event: Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments 2012, 2012, Wilga, Poland
Abstract
Modular multiplication forms the basis of modular exponentiation which is the core operation of the RSA cryptosystem. It is also present in many other cryptographic algorithms including those based on ECC and HECC. Hence, an efficient implementation of PKC relies on efficient implementation of modular multiplication. The paper presents a survey of most common algorithms for modular multiplication along with hardware architectures especially suitable for cryptographic applications in energy constrained environments. The motivation for studying low-power and areaefficient modular multiplication algorithms comes from enabling public-key security for ultra-low power devices that can perform under constrained environments like wireless sensor networks. Serial architectures for GF(p) are analyzed and presented. Finally proposed architectures are verified and compared according to the amount of power dissipated throughout the operation.
© (2012) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Jakub Olszyna, "Modular multiplication in GF(p) for public-key cryptography", Proc. SPIE 8454, Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments 2012, 84542E (15 October 2012); doi: 10.1117/12.2000065; https://doi.org/10.1117/12.2000065
PROCEEDINGS
8 PAGES


SHARE
Back to Top