Enhanced montgomery multiplication on DSP architectures for embedded public-key cryptosystems

Authors:
P. Gastaldo;G. Parodi;R. Zunino
Affiliations:
Department of Biophysical and Electronic Engineering, University of Genoa, Genova, Italy;Department of Biophysical and Electronic Engineering, University of Genoa, Genova, Italy;Department of Biophysical and Electronic Engineering, University of Genoa, Genova, Italy
Venue:
EURASIP Journal on Embedded Systems - Embedded System Design in Intelligent Industrial Automation
Year:
2008

Citing 12
Cited 1

A cryptographic library for the Motorola DSP56000

EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Hardware Implementation of Montgomery's Modular Multiplication Algorithm

IEEE Transactions on Computers
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Handbook of Applied Cryptography

Handbook of Applied Cryptography
Analyzing and Comparing Montgomery Multiplication Algorithms

IEEE Micro
Fast Implementation of Public-Key Cryptography ona DSP TMS320C6201

CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
Design and Implementation of a Coprocessor for Cryptography Applications

EDTC '97 Proceedings of the 1997 European conference on Design and Test
A Scalable Architecture for Modular Multiplication Based on Montgomery's Algorithm

IEEE Transactions on Computers
FPGA Montgomery Multiplier Architectures - A Comparison

FCCM '04 Proceedings of the 12th Annual IEEE Symposium on Field-Programmable Custom Computing Machines
A hardware version of the RSA using the Montgomery's algorithm with systolic arrays

Integration, the VLSI Journal
An efficient implementation of multi-prime RSA on DSP processor

ICME '03 Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 3 (ICME '03) - Volume 03
Applications of fast truncated multiplication in cryptography

EURASIP Journal on Embedded Systems

pSHS: a scalable parallel software implementation of Montgomery multiplication for multicore systems

Proceedings of the Conference on Design, Automation and Test in Europe

Quantified Score

Hi-index	0.00

Visualization

Abstract

Montgomery's algorithm is a popular technique to speed up modular multiplications in public-key cryptosystems. This paper tackles the efficient support of modular exponentiation on inexpensive circuitry for embedded security services and proposes a variant of the finely integrated product scanning (FIPS) algorithm that is targeted to digital signal processors. The general approach improves on the basic FIPS formulation by removing potential inefficiencies and boosts the exploitation of computing resources. The reformulation of the basic FIPS structure results in a general approach that balances computational efficiency and flexibility. Experimental results on commercial DSP platforms confirm both the method's validity and its effectiveness.