메뉴 건너뛰기
.. 내서재 .. 알림
소속 기관/학교 인증
인증하면 논문, 학술자료 등을  무료로 열람할 수 있어요.
한국대학교, 누리자동차, 시립도서관 등 나의 기관을 확인해보세요
(국내 대학 90% 이상 구독 중)
로그인 회원가입 고객센터 ENG
주제분류

추천
검색

논문 기본 정보

자료유형
학술저널
저자정보
저널정보
한국지식정보기술학회 한국지식정보기술학회 논문지 한국지식정보기술학회 논문지 제10권 제4호
발행연도
2015.1
수록면
501 - 507 (7page)

이용수

표지
📌
연구주제
📖
연구배경
🔬
연구방법
🏆
연구결과
AI에게 요청하기
추천
검색

초록· 키워드

오류제보하기
The multiplication over finite field GF(2^163) is the main arithmetic operation in Elliptic Curve Cryptography (ECC). Therefore, the design of efficient dedicated finite field multiplier architectures can lead to dramatic improvement on the overall system performance. In this paper, a hardware implementation of hybrid multiplier over GF(2^163) is presented. The proposed multiplier operates in polynomial basis of GF(2^163). This multiplier’s size of 163 bits is currently recommended by the National Institute of Standards and Technology (NIST) in their elliptic curve digital signature standard (ECDSS), and is used in practice for binary field multiplication in elliptic curve cryptography. The hybrid architecture is -times faster than bit-serial architectures but with lower area complexity than bit-parallel ones, where the value for , 2≤t≤[m/2] , can be arbitrarily selected by the designer to set the tradeoff between area and speed. The most significant feature of the proposed architecture is that a trade-off between hardware complexity and delay time can be achieved. This makes the proposed multipliers suitable for applications where the value of is large but space is of concern, e.g., resource constrained cryptographic systems such as smart cards and mobile phones. In addition, the proposed architecture is highly regular, simple, expandable and therefore, well-suited for VLSI implementation.

목차

등록된 정보가 없습니다.

참고문헌 (11)

참고문헌 신청

함께 읽어보면 좋을 논문

논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!

이 논문의 저자 정보

최근 본 자료

전체보기

댓글(0)

0