A low-complexity LUT-based squaring algorithm

被引:3
|
作者
Chang, Te-Jen [1 ]
Wu, Chia-Long [2 ]
Lou, Der-Chyuan [1 ]
Chen, Ching-Yin [1 ]
机构
[1] Natl Def Univ, Chung Cheng Inst Technol, Dept Elect Engn, Tao Yuan 33509, Taiwan
[2] Chinese AF Inst Technol, Dept Aviat & Commun Elect, Kaohsiung 82042, Taiwan
关键词
Information security; Squaring; Fast algorithm design; Modular multiplication; Public-key cryptosystem; SIGNED-DIGIT REPRESENTATIONS; EXPONENTIATION;
D O I
10.1016/j.camwa.2008.11.018
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The computation of large modular multi-exponentiation is a time-consuming arithmetic operation used in cryptography. The standard squaring algorithm is well-known and the Guajardo-Paar algorithm fixes the improper carry handling bug produced by the standard squaring algorithm, but produces error-indexing bug. In this paper, a novel squaring algorithm is proposed, which stores base products in the Look-Up Table before the squaring computation and base size comparison method. The proposed algorithm can not only evaluate squaring efficiently but also avoid bugs produced in other proposed algorithms (the Guajardo-Paar algorithm and the Yang-Heih-Laih algorithm). The performance of the proposed algorithm is 1.615 times faster than the, standard squaring algorithm and much faster than other algorithms. (C) 2009 Elsevier Ltd. All rights reserved.
引用
收藏
页码:1494 / 1501
页数:8
相关论文
共 50 条
  • [1] A Low Complexity LUT-Based Digital Predistortion Block With New Pruning Method
    Sun, Linlin
    Hu, Xin
    Liu, Zhijun
    Han, Kang
    Zhang, Sun
    Wang, Weidong
    Ghannouchi, Fadhel M.
    IEEE MICROWAVE AND WIRELESS COMPONENTS LETTERS, 2022, 32 (09) : 1131 - 1134
  • [2] Low leakage design of LUT-based FPGAs
    Lodi, A
    Ciccarelli, L
    Loparco, D
    ESSCIRC 2005: PROCEEDINGS OF THE 31ST EUROPEAN SOLID-STATE CIRCUITS CONFERENCE, 2005, : 153 - 156
  • [3] Automated conversion from LUT-based FPGAs to LUT-based MPGAs
    Veredas, Francisco -Javier
    Pfleiderer, Hans-Joerg
    2006 INTERNATIONAL CONFERENCE ON FIELD PROGRAMMABLE LOGIC AND APPLICATIONS, PROCEEDINGS, 2006, : 951 - +
  • [4] A Coefficients Extraction Algorithm for LUT-based Hammerstein Predistorter
    Shi, Zhan
    Zhou, Jianmin
    Hayashi, Hiroyuki
    Kubo, Tokuro
    2008 IEEE 19TH INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATIONS, 2008, : 216 - 219
  • [5] On Custom LUT-based Obfuscation
    Kolhe, Gaurav
    Manoj, Sai P. D.
    Rafatirad, Setareh
    Sasan, Avesta
    Homayoun, Houman
    Mahmoodi, Hamid
    GLSVLSI '19 - PROCEEDINGS OF THE 2019 ON GREAT LAKES SYMPOSIUM ON VLSI, 2019, : 477 - 482
  • [6] Security and Complexity Analysis of LUT-based Obfuscation: From Blueprint to Reality
    Kolhe, Gaurav
    Kamali, Hadi Mardani
    Naicker, Miklesh
    Sheaves, Tyler David
    Mahmoodi, Hamid
    Manoj, Sai P. D.
    Homayoun, Houman
    Rafatirad, Setareh
    Sasan, Avesta
    2019 IEEE/ACM INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN (ICCAD), 2019,
  • [7] TDD: A technology dependent decomposition algorithm for LUT-based FPGAs
    Farrahi, AH
    Sarrafzadeh, M
    TENTH ANNUAL IEEE INTERNATIONAL ASIC CONFERENCE AND EXHIBIT, PROCEEDINGS, 1997, : 206 - 209
  • [8] A LUT-Based Approximate Adder
    Becher, Andreas
    Echavarria, Jorge
    Ziener, Daniel
    Wildermann, Stefan
    Teich, Juergen
    2016 IEEE 24TH ANNUAL INTERNATIONAL SYMPOSIUM ON FIELD-PROGRAMMABLE CUSTOM COMPUTING MACHINES (FCCM), 2016, : 27 - 27
  • [9] An Ultra-low Overhead LUT-based PUF for FPGA
    Wang, Jiadong
    Cui, Aijiao
    Li, Mengyang
    Qu, Gang
    Li, Huawei
    PROCEEDINGS OF THE 2016 IEEE ASIAN HARDWARE ORIENTED SECURITY AND TRUST SYMPOSIUM (ASIANHOST 2016), 2016,
  • [10] Automated conversion from a LUT-based FPGA to a LUT-based MPGA with fast turnaround time
    Veredas, Francisco-Javier
    Scheppler, Michael
    Pfleiderer, Hans-Joerg
    2006 DESIGN AUTOMATION AND TEST IN EUROPE, VOLS 1-3, PROCEEDINGS, 2006, : 1371 - +