Design of RSA cryptographic circuit for small chip area using refined Montgomery algorithm
![]() |
김무섭
(한국전자통신연구원 정보보호기술연구본부)
최용제 (한국전자통신연구원 정보보호기술연구본부) 김호원 (한국전자통신연구원 정보보호기술연구본부) 정교일 (한국전자통신연구원 정보보호기술연구본부) |
1 |
Two implementation methods of a 1024-bit RSA cryptoprocessor based on modified Montgomery algorithm
/
|
2 |
/
|
3 |
New efficient structure for a modular multiplier for RNS
/
DOI ScienceOn |
4 |
Bit-level systolic arrays for modular multiplication
/
|
5 |
/
|
6 |
Advances in Cryptology Eurocrypt'90: A Cryptographic Library for the Motorola DSP56000
/
|
7 |
/
|
8 |
A radix-4 modular multiplication hardware algorithm for modular exponentiation
/
DOI ScienceOn |
9 |
A faster modular multiplication algorithm
/
DOI |
10 |
/
|
11 |
Implementation of RSA cryptoprocessor based on Montgomery algorithm
/
|
12 |
Modular multiplication without trial division
/
DOI ScienceOn |
13 |
/
|
14 |
Montgomery 곱셈기를 이용한 효율적인 모듈라 멱승기 구조
/
과학기술학회마을 |
15 |
Fast Implementation of RSA cryptography
/
|
16 |
/
|
17 |
Montgomery modular exponentiation on reconfigurable hardware
/
|
18 |
Hardware Implementation of Montgomery's Modular Multiplication Algorithm
/
|
19 |
CHES 99: A scalable architecture for Montgomery multiplication
/
|
20 |
/
|
![]() |