A Multiple-Precision Modular Multiplication Algorithm with Triangle Additions
スポンサーリンク
概要
- 論文の詳細を見る
A new algorithm for multiple-precision modular multiplication is proposed. It is fast and uses a small amount of main memory, and hence, is useful for application of a public-key cryptosystem to small computers, such as card computers.
- 社団法人電子情報通信学会の論文
- 1995-10-25
著者
関連論文
- Floating-Point Euclidean Norm Computing Circuit
- Digit-Recurrence Algorithm for Computing Reciprocal Square-Root(Regular Section)
- 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
- Fast Modular Multiplication by Processing the Multiplier from Both Sides in Parallel
- A Multiple-Precision Modular Multiplication Algorithm with Triangle Additions
- A Hardware Algorithm for Modular Division Based on the Extended Euclidean Algorithm
- A Digit-Recurrence Algorithm for Cube Rooting