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

추천
검색

논문 기본 정보

자료유형
학위논문
저자정보

박병관 (금오공과대학교, 금오공과대학교 대학원)

지도교수
신경욱
발행연도
2018
저작권
금오공과대학교 논문은 저작권에 의해 보호받습니다.

이용수9

표지
AI에게 요청하기
추천
검색

이 논문의 연구 히스토리 (4)

초록· 키워드

오류제보하기
Elliptic curve cryptography processor proposed as the next generation public key cryptosystem was designed. The scalable ECC processor supports multiple elliptic curves of P-192, P-224, P-256, and P-384 over prime field as defined by the NIST FIPS 186-2 standard. The processor consist of Smul_Mem block to store intermediate results of scalar multiplication, SAlu_GFp block to perform addition, subtraction, multiplication, and squaring over prime field of various lengths, and a control block. The modified Montgomery ladder algorithm was used to perform scalar multiplication. In order to eliminate division operations that require large hardware, the projective coordinate was adopted to implement point operations. The final result of the scalar multiplication operation is translated to affine coordinate system for compatibility with other processors. The operations such as addition, subtraction, multiplication are carried out over prime field. It was designed with a 32-bit word-based structure to complete all operations on fixed hardware resources irrespective of field size. A new arithmetic circuit that is based on 32-bit data path was devised to implement Montgomery multiplier over prime field. The designed Montgomery multiplier effectively reduced hardware complexity and critical path by using the regularity of the algorithm. The comparator required for Montgomery multiplier is replaced with designed adder/subtractor to reduce hardware resource. The scalable ECC processor was verified by functional verification using Modelsim and FPGA implementation. The processor synthesized using a 0.18 CMOS cell library occupies 5.4-Kbit RAM and 26,283 gate equivalents (GEs), and the estimated maximum clock frequency is 125 MHz. A scalar multiplication takes 0.6, 0.9, 1.2, 3.7 million clock cycles for P-192, P-224, P-256, P-384, respectively. It is expected to support scalar multiplication on multiple elliptic curves using a single processor and to be applied to an information security system requiring various security strengths.

목차

등록된 정보가 없습니다.

최근 본 자료

전체보기

댓글(0)

0