Fast Modular Multiplication by Processing the Multiplier from Both Sides in Parallel
スポンサーリンク
概要
- 論文の詳細を見る
We propose a fast method for computing modular multiplication, in which the calculation is performed over newly defined Montgomery images. The Montgomery multiplication is newly defined so that it can be efficiently computed by using the classical shift-and-add algorithm and the Montgomery algorithm in parallel. This method enables to accelerate modular multiplication up to twice the speed of existing algorithms. Transformations between the binary representation and the newly defined Montgomery image can be performed in half the time than that required when conventional Montgomery representation is used.
- 社団法人電子情報通信学会の論文
- 2005-03-03
著者
-
Takagi Naofumi
Department Of Information Engineering Nagoya University
-
KAIHARA Marcelo
Department of Information Engineering, Nagoya University
-
Kaihara Marcelo
Department Of Information Engineering Nagoya University
-
Takagi Naofumi
Department Of Communications And Computer Engineering Kyoto University
関連論文
- A Method of Sequential Circuit Synthesis Using One-Hot Encoding for Single-Flux-Quantum Digital Circuits(Superconducting Electronics)
- Logic Synthesis Method for Dual-Rail RSFQ Digital Circuits Using Root-Shared Binary Decision Diagrams(VLSI Design Technology and CAD)
- Floating-Point Euclidean Norm Computing Circuit
- Digit-Recurrence Algorithm for Computing Reciprocal Square-Root(Regular Section)
- A Hardware Algorithm for Integer Division Using the SD2 Representation(VLSI Design Technology and CAD)
- A VLSI Architecture for Output Probability Computations of HMM-Based Recognition Systems with Store-Based Block Parallel Processing
- Minimum Cut Linear Arrangement of p-q Dags for VLSI Layout of Adder Trees (Special Section on Discrete Mathematics and Its Applications)
- Proposal of a Desk-Side Supercomputer with Reconfigurable Data-Paths Using Rapid Single-Flux-Quantum Circuits
- 100GHz Demonstrations Based on the Single-Flux-Quantum Cell Library for the 10kA/cm^2 Nb Multi-Layer Process
- Automated Passive-Transmission-Line Routing Tool for Single-Flux-Quantum Circuits Based on A^* Algorithm
- A Clock Scheduling Algorithm for High-Throughput RSFQ Digital Circuits
- Comparisons of Synchronous-Clocking SFQ Adders
- Pipelined Bipartite Modular Multiplication
- Pipelined Bipartite Modular Multiplication
- Hardware Algorithm for Computing Reciprocal of Euclidean Norm of a 3-D Vector(VLSI Design Technology and CAD)
- Pipelined Bipartite Modular Multiplication
- Pipelined Bipartite Modular Multiplication
- Fast Modular Multiplication by Processing the Multiplier from Both Sides in Parallel
- Fast Modular Multiplication by Processing the Multiplier from Both Sides in Parallel
- Layout-Driven Skewed Clock Tree Synthesis for Superconducting SFQ Circuits
- Fast Modular Multiplication by Processing the Multiplier from Both Sides in Parallel
- A Digit-Recurrence Algorithm for Cube Rooting
- A Hardware Algorithm for Modular Multiplication/Division Based on the Extended Euclidean Algorithm(VLSI Design Technology and CAD)
- A VLSI Architecture with Multiple Fast Store-Based Block Parallel Processing for Output Probability and Likelihood Score Computations in HMM-Based Isolated Word Recognition