Elliptic-curve point-multiplication over GF(2163)

被引:2
|
作者
Deschamps, Jean-Pierre [1 ]
Sutter, Gustavo [2 ]
机构
[1] Univ Rovira & Virgili, Escola Tecn Super Engn, Tarragona, Spain
[2] Univ Madrid, Madrid, Spain
关键词
D O I
10.1109/SPL.2008.4547727
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
This paper describes algorithms and circuits for executing the point-multiplication operation in the particular case of the K-163 NIST-recommended curve. The circuits have been described in VHDL and implemented within the low cost Spartan-3 FPGA devices. Three point-multiplication algorithms are considered: the basic algorithm, the Montgomery algorithm and an algorithm based on the Frobenius map.
引用
收藏
页码:25 / +
页数:2
相关论文
共 50 条
  • [1] FPGA Implementation of Elliptic Curve Point Multiplication over GF(2191)
    Shohdy, Sameh M.
    El-sisi, Ashraf B.
    Ismail, Nabil
    [J]. ADVANCES IN INFORMATION SECURITY AND ASSURANCE, 2009, 5576 : 619 - 634
  • [2] Hardware Design and Implementation of Scalar Multiplication in Elliptic Curve Cryptography (ECC) over GF (2163) on FPGA
    Imran, Malik
    Kashif, Muhammad
    Rashid, Muhammad
    [J]. 2015 INTERNATIONAL CONFERENCE ON INFORMATION AND COMMUNICATION TECHNOLOGIES (ICICT), 2015,
  • [3] A 5.1μJ per point-multiplication elliptic curve cryptographic processor
    Rozic, Vladimir
    Reparaz, Oscar
    Verbauwhede, Ingrid
    [J]. INTERNATIONAL JOURNAL OF CIRCUIT THEORY AND APPLICATIONS, 2017, 45 (02) : 170 - 187
  • [4] Efficient RNS Implementation of Elliptic Curve Point Multiplication Over GF(p)
    Esmaeildoust, Mohammad
    Schinianakis, Dimitrios
    Javashi, Hamid
    Stouraitis, Thanos
    Navi, Keivan
    [J]. IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2013, 21 (08) : 1545 - 1549
  • [5] FPGA Implementation of Elliptic-Curve Point Multiplication Over GF(2233) Using Booth Polynomial Multiplier for Area-Sensitive Applications
    Aljaedi, Amer
    Qureshi, Furqan Aziz
    Hazzazi, Mohammad Mazyad
    Imran, Malik
    Bassfar, Zaid
    Jamal, Sajjad Shaukat
    [J]. IEEE ACCESS, 2024, 12 : 72847 - 72859
  • [6] High performance elliptic curve cryptographic processor over GF(2163)
    Choi, Hyun Min
    Hong, Chun Pyo
    Kim, Chang Hoon
    [J]. DELTA 2008: FOURTH IEEE INTERNATIONAL SYMPOSIUM ON ELECTRONIC DESIGN, TEST AND APPLICATIONS, PROCEEDINGS, 2008, : 290 - 295
  • [7] Design of Elliptic Curve Cryptoprocessors over GF(2163) on Koblitz Curves
    Realpe-Munoz, Paulo
    Trujillo-Olaya, Vladimir
    Velasco-Medina, Jaime
    [J]. 2014 IEEE 5TH LATIN AMERICAN SYMPOSIUM ON CIRCUITS AND SYSTEMS (LASCAS), 2014,
  • [8] A Modular Design of Elliptic-Curve Point Multiplication for Resource Constrained Devices
    Wei, Wei
    Zhang, Li
    Chang, Chip-Hong
    [J]. 2014 14TH INTERNATIONAL SYMPOSIUM ON INTEGRATED CIRCUITS (ISIC), 2014, : 596 - 599
  • [9] Improvements for High Performance Elliptic Curve Cryptosystem Processor over GF(2163)
    Loi, K. C. Cinnati
    Ko, Seok-Bum
    [J]. 2012 INTERNATIONAL SYMPOSIUM ON ELECTRONIC SYSTEM DESIGN (ISED 2012), 2012, : 140 - 144
  • [10] A Novel Low-Area Point Multiplication Architecture for Elliptic-Curve Cryptography
    Rashid, Muhammad
    Hazzazi, Mohammad Mazyad
    Khan, Sikandar Zulqarnain
    Alharbi, Adel R.
    Sajid, Asher
    Aljaedi, Amer
    [J]. ELECTRONICS, 2021, 10 (21)