GF(2191) elliptic curve processor using montgomery ladder and high speed finite field arithmetic unit

被引:0
|
作者
Ha, Chang-Soo
Kim, Joo-Hong
Choi, Byeong-Yoon
Lee, Jong-Hyoung
Kim, Ho-Won
机构
来源
TENCON 2005 - 2005 IEEE REGION 10 CONFERENCE, VOLS 1-5 | 2006年
关键词
system-on-chip; montgomery ladder; elliptic curve cryptosystem;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper describes hardware implementation of GF(2(191)) elliptic curve cryptographic(ECC) coprocessor. It supports 6 operations such as scalar multiplication(kP), Menezes-Vanstone(MV) elliptic curve cipher/decipher, point addition(P+Q), point doubling(2P), and finite-field multiplication/division. The ECC processor adopts the Montgomery scalar multiplication scheme in which main loop can be executed using only x-coordinate. It also takes advantage of concurrent operations among arithmetic units, such as GF_ALU, GF_MUL, and GF_DIV to achieve high cipher rate. The processor has about 68,000 gates using 0.35um CMOS technology, and its worst case delay time is about 7.8-ns. It can be efficiently applied to various elliptic curve cryptographic applications due to high cipher rate (about 647 kbps) and the possible 6 operations.
引用
收藏
页码:1489 / 1492
页数:4
相关论文
共 50 条
  • [1] Design of an elliptic curve cryptography processor using a scalable finite field multiplier in GF(2193)
    Lee, C
    Lee, J
    JOURNAL OF THE KOREAN PHYSICAL SOCIETY, 2004, 44 (01) : 39 - 45
  • [2] A high-performance elliptic curve cryptographic processor for general curves over GF(p) based on a systolic arithmetic unit
    Chen, Gang
    Bai, Guoqiang
    Chen, Hongyi
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2007, 54 (05) : 412 - 416
  • [3] A dual-field elliptic curve cryptographic processor based on a systolic arithmetic unit
    Chen, Gang
    Bai, Guoqiang
    Chen, Hongyi
    PROCEEDINGS OF 2008 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS 1-10, 2008, : 3298 - 3301
  • [4] Hardware implementation of an elliptic curve processor over GF(p) with Montgomery modular multiplier
    Ors, Berna
    Batina, Lejla
    Preneel, Bart
    Vandewalle, Joos
    INTERNATIONAL JOURNAL OF EMBEDDED SYSTEMS, 2008, 3 (04) : 229 - 240
  • [5] A compact finite field processor over GF(2m) for elliptic curve cryptography
    Kim, JH
    Lee, DH
    2002 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOL II, PROCEEDINGS, 2002, : 340 - 343
  • [6] A High-Speed Elliptic Curve Cryptographic Processor for Generic Curves over GF(p)
    Ma, Yuan
    Liu, Zongbin
    Pan, Wuqiong
    Jing, Jiwu
    SELECTED AREAS IN CRYPTOGRAPHY - SAC 2013, 2014, 8282 : 421 - 437
  • [7] Performance of finite field arithmetic in an elliptic curve cryptosystem
    Li, Z
    Higgins, J
    Clement, M
    NINTH INTERNATIONAL SYMPOSIUM ON MODELING, ANALYSIS AND SIMULATION OF COMPUTER AND TELECOMMUNICATION SYSTEMS, PROCEEDINGS, 2001, : 249 - 256
  • [8] A high speed processor for elliptic curve cryptography over NIST prime field
    Hu, Xianghong
    Li, Xueming
    Zheng, Xin
    Liu, Yuan
    Xiong, Xiaoming
    IET CIRCUITS DEVICES & SYSTEMS, 2022, 16 (04) : 350 - 359
  • [9] Fully paramaterisable Galois field arithmetic processor over GF(3m) suitable for elliptic curve cryptography
    Kerins, T
    Popovici, EM
    Marnane, WP
    2004 24TH INTERNATIONAL CONFERENCE ON MICROELECTRONICS, PROCEEDINGS, VOLS 1 AND 2, 2004, : 739 - 742
  • [10] High radix parallel architecture for GF(p) elliptic curve processor
    Gutub, AAA
    Ibrahim, MK
    2003 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOL II, PROCEEDINGS: SPEECH II; INDUSTRY TECHNOLOGY TRACKS; DESIGN & IMPLEMENTATION OF SIGNAL PROCESSING SYSTEMS; NEURAL NETWORKS FOR SIGNAL PROCESSING, 2003, : 625 - 628