지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술대회자료
- 저자정보
- 발행연도
- 2011.11
- 수록면
- 215 - 218 (4page)
이용수
초록· 키워드
오류제보하기
This paper presents a new modular multiplication algorithm developed to remove division-based denormalization. In modular multiplication algorithms, the modular reduction estimates an intermediate quotient by referring to the most significant bits of the intermediate remainder since the modulus is scaled up, however, the modular multiplication results in an enlarged value that should be denormalized at the end. The denormalization has been realized by employing a division operation, which is not an efficient way in the view point of hardware implementation and processing cycles. The proposed modular multiplication is based on the scaled-modular multiplication which replaces the division-based denormalization with the Montgomery modular reduction. As a result, the hardware complexity is reduced compared to the up-to-date modular multiplication architecture.
목차
Abstract
I. INTRODUCTION
II. PRELIMINARIES ON MODULAR MULTIPLICATIONS
III. PROPOSED MODULAR MULTIPLICATION
IV. IMPLEMENTATION RESULTS
V. CONCLUSION
REFERENCES
참고문헌 (0)
참고문헌 신청이 논문의 저자 정보
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2013-569-001474787