Compact and Programmable yet High-Performance SoC Architecture for Cryptographic Pairings

被引:4
作者
Bahadori, Milad [1 ]
Jarvinen, Kimmo [1 ]
机构
[1] Univ Helsinki, Dept Comp Sci, Helsinki, Finland
来源
2020 30TH INTERNATIONAL CONFERENCE ON FIELD-PROGRAMMABLE LOGIC AND APPLICATIONS (FPL) | 2020年
基金
欧盟地平线“2020”;
关键词
Cryptographic pairing; system-on-chip; HW/SW codesign; FPGA; optimal Ate pairing; Barreto-Naehrig curves; EFFICIENT; IMPLEMENTATION; COMPUTATION; ENCRYPTION;
D O I
10.1109/FPL50879.2020.00038
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Cryptographic pairings are important primitives for many advanced cryptosystems. Efficient computation of pairings requires the use of several layers of algorithms as well as optimizations in different algorithm and implementation levels. This makes implementing cryptographic pairings a difficult task particularly in hardware. Many existing hardware implementations fix the parameters of the pairing to improve efficiency but this significantly limits the generality and practicality of the solution. In this paper, we present a compact and programmable yet high-performance architecture for programmable system-on-chip platforms designed for efficient computation of different cryptographic pairings. We demonstrate with real hardware that this architecture can compute optimal ate pairings on a Barreto-Naehrig curve with 126-bit security in 2.18 ms in a Xilinx Zynq-7020 device and occupies only about 3200 slices, 36 DSPs, and 18 BRAMs. We also show that the architecture can support different types of pairings via microcode updates and can be implemented on other reprogrammable devices with very minor modifications.
引用
收藏
页码:176 / 184
页数:9
相关论文
共 42 条
  • [1] Abdalla M, 2005, LECT NOTES COMPUT SC, V3621, P205
  • [2] Multi-input Inner-Product Functional Encryption from Pairings
    Abdalla, Michel
    Gay, Romain
    Raykova, Mariana
    Wee, Hoeteck
    [J]. ADVANCES IN CRYPTOLOGY - EUROCRYPT 2017, PT I, 2017, 10210 : 601 - 626
  • [3] The Realm of the Pairings
    Aranha, Diego F.
    Barreto, Paulo S. L. M.
    Longa, Patrick
    Ricardini, Jefferson E.
    [J]. SELECTED AREAS IN CRYPTOGRAPHY - SAC 2013, 2014, 8282 : 3 - 25
  • [4] Aranha DF, 2011, LECT NOTES COMPUT SC, V6632, P48, DOI 10.1007/978-3-642-20465-4_5
  • [5] Faster computation of the Tate pairing
    Arene, Christophe
    Lange, Tanja
    Naehrig, Michael
    Ritzenthaler, Christophe
    [J]. JOURNAL OF NUMBER THEORY, 2011, 131 (05) : 842 - 857
  • [6] Awano H, 2018, PROC INT CONF ADV, P387, DOI 10.1109/ATC.2018.8587589
  • [7] Fast Software Implementations of Bilinear Pairings
    Azarderakhsh, Reza
    Fishbein, Dieter
    Grewal, Gurleen
    Hu, Shi
    Jao, David
    Longa, Patrick
    Verma, Rajeev
    [J]. IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2017, 14 (06) : 605 - 619
  • [8] Practical Functional Encryption for Quadratic Functions with Applications to Predicate Encryption
    Baltico, Carmen Elisabetta Zaira
    Catalano, Dario
    Fiore, Dario
    Gay, Romain
    [J]. ADVANCES IN CRYPTOLOGY - CRYPTO 2017, PT I, 2017, 10401 : 67 - 98
  • [9] Efficient pairing computation on supersingular Abelian varieties
    Barreto, Paulo S. L. M.
    Galbraith, Steven D.
    O'hEigeartaigh, Colm
    Scott, Michael
    [J]. DESIGNS CODES AND CRYPTOGRAPHY, 2007, 42 (03) : 239 - 271
  • [10] Barreto PSLM, 2006, LECT NOTES COMPUT SC, V3897, P319