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 条
  • [31] A flexible LUT-based carry chain for FPGAS
    Lodi, A
    Chiesa, C
    Campi, F
    Toma, M
    PROCEEDINGS OF THE 2003 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOL V: BIO-MEDICAL CIRCUITS & SYSTEMS, VLSI SYSTEMS & APPLICATIONS, NEURAL NETWORKS & SYSTEMS, 2003, : 133 - 136
  • [32] Encoding of Terms in LUT-based Mealy FSMs
    Barkalov, Alexander
    Titarenko, Larysa
    Mazurkiewicz, Malgorzata
    Mielcarek, Kamil
    PROCEEDINGS OF THE 25TH INTERNATIONAL CONFERENCE MIXED DESIGN OF INTEGRATED CIRCUITS AND SYSTEM (MIXDES 2018), 2018, : 145 - 148
  • [33] LUT-Based FPGA Technology Mapping for Reliability
    Cong, Jason
    Minkovich, Kirill
    FPGA 10, 2010, : 288 - 288
  • [34] Distributed Indication in LUT-Based Asynchronous Logic
    Lemberski, Igor
    Uhanova, Marina
    Suponenkovs, Artjoms
    IFAC PAPERSONLINE, 2019, 52 (27): : 257 - 264
  • [35] Regular routing architecture for a LUT-based MPGA
    Veredas, Francisco-Javier
    Scheppler, Michael
    Zhai, Bumei
    Pfleiderer, Hans-Joerg
    IEEE COMPUTER SOCIETY ANNUAL SYMPOSIUM ON VLSI, PROCEEDINGS: EMERGING VLSI TECHNOLOGIES AND ARCHITECTURES, 2006, : 257 - +
  • [36] Partial-LUT Designs for Low-Complexity Realization of DA-Based BLMS Adaptive Filter
    Khan, Mohd Tasleem
    Kumar, Jitendra
    Ahamed, Shaik Rafi
    Faridi, Juhi
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2021, 68 (04) : 1188 - 1192
  • [37] A Symbolic RTL Synthesis for LUT-based FPGAs
    Deniziak, Stanislaw
    Wisniewski, Mariusz
    PROCEEDINGS OF THE 2009 IEEE SYMPOSIUM ON DESIGN AND DIAGNOSTICS OF ELECTRONIC CIRCUITS AND SYSTEMS, 2009, : 102 - +
  • [38] LUT-Based FPGA and its CAD techniques
    Peng, Yuxing
    Chen, Shuming
    Chen, Fujie
    Dongli Gongcheng/Power Engineering, 18 (06): : 1 - 5
  • [39] IMPROVING CHARACTERISTICS OF LUT-BASED MEALY FSMS
    Barkalov, Alexander
    Titarenko, Larysa
    Mielcarek, Kamil
    INTERNATIONAL JOURNAL OF APPLIED MATHEMATICS AND COMPUTER SCIENCE, 2020, 30 (04) : 745 - 759
  • [40] Encoding of compatible microoperations in LUT-based FSMs
    Mielcarek, Kamil
    Barkalov, Alexander
    Titarenko, Larysa
    PHOTONICS APPLICATIONS IN ASTRONOMY, COMMUNICATIONS, INDUSTRY, AND HIGH ENERGY PHYSICS EXPERIMENTS 2017, 2017, 10445