Implementation of RSA Exponentiator Based on Radix-![]() |
권택원
(경북대학과 전자공학과 대학원)
최준림 (경북대학교 전자전기컴퓨터학부) |
1 |
Two implementation methods of a 1024-bit RSA cyptoprocessor based on modified Montgomery algorithm
/
|
2 |
A method for abtaining digital signatures and public-key cryptosystems
/
DOI ScienceOn |
3 |
An improved Montgomery algorithm for high-speed RSA public-key cryptosystem
/
DOI ScienceOn |
4 |
Montgoemry modular exponentiation on reconfigurable hardware
/
|
5 |
RSA Hardware Implementation
/
|
6 |
A VLSI architecture of fast high-radix modular multiplication for RSA cryptosystem
/
|
7 |
Radix-4 modular multiplication and exponentiation algorithm, for the RSA public-key cryptosystem
/
|
8 |
A generalized Multibit Coding of Two's Complement Binary Numbers and Its Proof with Application in Multiplier Implementation
/
|
9 |
High-radix Montgoemry exponentiation on reconfigurable hardware
/
DOI ScienceOn |
10 |
High speed binary adder
/
|
11 |
Montgomery modular multiplication and exponentiation in the residue number
/
|
12 |
A spanning tree carry lookahead adder
/
DOI ScienceOn |
13 |
/
|
14 |
/
|
15 |
A scalable architecture for Montgomery multiplication
/
|
16 |
Bit-level systolic arrays for modular multiplication
/
|
17 |
New efficient structure for a modular multiplier for RNS
/
DOI ScienceOn |
18 |
/
|
19 |
High-radix design of a scalable modular multiplier
/
|
![]() |