Share Email Print
cover

Proceedings Paper

Modular multiplication in GF(p) for public-key cryptography
Author(s): Jakub Olszyna
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 15 October 2012
PDF: 8 pages
Proc. SPIE 8454, Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments 2012, 84542E (15 October 2012); doi: 10.1117/12.2000065
Show Author Affiliations
Jakub Olszyna, Warsaw Univ. of Technology (Poland)


Published in SPIE Proceedings Vol. 8454:
Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments 2012
Ryszard S. Romaniuk, Editor(s)

© SPIE. Terms of Use
Back to Top