A high performance ROM-based structure for modular exponentiation

Authors:
Giuseppe Alia;Enrico Martinelli
Affiliations:
Dept. of Information Engineering, University of Pisa Via Caruso, 16 56122 Pisa, Italy;Dept. of Information Engineering, University of Siena, Via Roma, 56 53100 Siena, Italy
Venue:
Computers and Electrical Engineering
Year:
2011

Citing 15
Cited 0

Exponentiation using canonical recoding

Theoretical Computer Science
A survey of fast exponentiation methods

Journal of Algorithms
Radix-4 modular multiplication and exponentiation algorithms for the RSA public-key cryptosystem

ASP-DAC '00 Proceedings of the 2000 Asia and South Pacific Design Automation Conference
RSA cryptosystem design based on the Chinese remainder theorem

Proceedings of the 2001 Asia and South Pacific Design Automation Conference
Efficient architectures for implementing montgomery modular multiplication and RSA modular exponentiation on reconfigurable logic

FPGA '02 Proceedings of the 2002 ACM/SIGDA tenth international symposium on Field-programmable gate arrays
Architectural tradeoff in implementing RSA processors

ACM SIGARCH Computer Architecture News
Fast modular exponentiation of large numbers with large exponents

Journal of Systems Architecture: the EUROMICRO Journal
O(n)-depth circuit algorithm for modular exponentiation

ARITH '95 Proceedings of the 12th Symposium on Computer Arithmetic
A Scalable Architecture for Modular Multiplication Based on Montgomery's Algorithm

IEEE Transactions on Computers
Three Hardware Implementations for the Binary Modular Exponentiation: Sequential, Parallel and Systolic

SBAC-PAD '03 Proceedings of the 15th Symposium on Computer Architecture and High Performance Computing
Fast Reconfigurable Hardware for the M-ary Modular Exponentiation

DSD '04 Proceedings of the Digital System Design, EUROMICRO Systems
Parallel Cryptographic Arithmetic Using a Redundant Montgomery Representation

IEEE Transactions on Computers
A Hardware Algorithm for Modular Multiplication/Division

IEEE Transactions on Computers
A Novel Unified Architecture for Public-Key Cryptography

Proceedings of the conference on Design, Automation and Test in Europe - Volume 3
Reconfigurable Hardware for Addition Chains Based Modular Exponentiation

ITCC '05 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01

Quantified Score

Hi-index	0.00

Visualization

Abstract

Modular processing of large numbers requires high speed computing resources. In particular an operation slowing the whole computing process heavily is modular exponentiation. A previous method reduces the computation of |x^e|"m to n simpler modular exponentiations |x"i^@h^"^i|"m"""i at most, where m"i is an element of the factorization of m, x"i=|x|"m"""i and @h"i