Proceedings of 2004 IEEE Asia-Pacific Conference on Advanced System Integrated Circuits · 2004 · 12 citations · 9 references
ComputingComputer EngineeringComputer ScienceComputer ArchitectureCryptographyLow-power DesignCryptographic AlgorithmsCryptographic ArchitectureCryptographic ImplementationElliptic Curve CryptographyHardware AccelerationPower OptimizationCryptographic OperationsEfficiency OptimizationHardware Acceleration For CryptographyModular Arithmetic AlgorithmsModular Arithmetic In CryptographyMultiplier DesignRsa CryptosystemStall
We propose a high speed RSA crypto-processor based on an enhanced word-based Montgomery Multiplication (MM) algorithm. With the help of the proposed Correction Module (CM), the word-based modular multiplier can achieve 100% utilization. A simplified Parity Prediction Module (PPM) is also proposed to eliminate the pipeline stall. Using a 0.18 /spl mu/m CMOS standard cell library, our RSA crypto-processor achieves a 512-bit RSA encryption rate of 375Kbps under 300MHz clock. The result shows that our architecture is cost-effective in terms of area and performance.
9
Modular multiplication without trial division
Peter L. Montgomery · Mathematics of Computation · 1985 · 2.4K citations
Modular Multiplication Without Trial Division
Peter L. Montgomery · Mathematics of Computation · 1985 · 1.1K citations · Full text