Enhanced Montgomery Multiplication on DSP Architectures for Embedded Public-Key Cryptosystems

被引：6
|
作者：
Gastaldo, P. [1 ]
Parodi, G. [1 ]
Zunino, R. [1 ]
机构：
[1] Univ Genoa, Dept Biophys & Elect Engn DIBE, Via Opera Pia 11a, I-16145 Genoa, Italy
来源：
EURASIP JOURNAL ON EMBEDDED SYSTEMS | 2008年 / 01期
关键词：
D O I：
10.1155/2008/583926
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
Montgomery's algorithm is a popular technique to speed up modular multiplications in public-key cryptosystems. This paper tackles the efficient support of modular exponentiation on inexpensive circuitry for embedded security services and proposes a variant of the finely integrated product scanning (FIPS) algorithm that is targeted to digital signal processors. The general approach improves on the basic FIPS formulation by removing potential inefficiencies and boosts the exploitation of computing resources. The reformulation of the basic FIPS structure results in a general approach that balances computational efficiency and flexibility. Experimental results on commercial DSP platforms confirm both the method's validity and its effectiveness. Copyright (C) 2008 P. Gastaldo et al.
引用
收藏
页数：9
相关论文
共 50 条
  • [1] Embedded public-key cryptosystems via enhanced Montgomery multiplication
    Gastaldo, Paolo
    Parodi, Giovanni
    Picasso, Francesco
    Zunino, Rodolfo
    [J]. 2007 IEEE INTERNATIONAL SYMPOSIUM ON INDUSTRIAL ELECTRONICS, PROCEEDINGS, VOLS 1-8, 2007, : 1820 - 1825
  • [2] An efficient Montgomery exponentiation algorithm for public-key cryptosystems
    Wu, Chia-Long
    Lou, Der-Chyuan
    Chang, Te-Jen
    [J]. ISI 2008: 2008 IEEE INTERNATIONAL CONFERENCE ON INTELLIGENCE AND SECURITY INFORMATICS, 2008, : 284 - +
  • [3] A Scalable and Systolic Architectures of Montgomery Modular Multiplication for Public Key Cryptosystems Based on DSPs
    Amine Mrabet
    Nadia El-Mrabet
    Ronan Lashermes
    Jean-Baptiste Rigaud
    Belgacem Bouallegue
    Sihem Mesnager
    Mohsen Machhout
    [J]. Journal of Hardware and Systems Security, 2017, 1 (3) : 219 - 236
  • [4] Montgomery modular multiplication architecture for public key cryptosystems
    McLoone, M
    McIvor, C
    McCanny, J
    [J]. 2004 IEEE WORKSHOP ON SIGNAL PROCESSING SYSTEMS DESIGN AND IMPLEMENTATION, PROCEEDINGS, 2004, : 349 - 354
  • [5] Novel Methods for Montgomery Modular Multiplication for Public Key Cryptosystems
    Venkatasubramani, V. R.
    Surendar, M.
    Rajaram, S.
    [J]. ADVANCES IN NETWORK SECURITY AND APPLICATIONS, 2011, 196 : 320 - 330
  • [6] Fast modular multiplication and parallel algorithms in public-key cryptosystems
    Luo, P
    Dai, YQ
    [J]. DYNAMICS OF CONTINUOUS DISCRETE AND IMPULSIVE SYSTEMS-SERIES A-MATHEMATICAL ANALYSIS, 2004, 11 (5-6): : 675 - 689
  • [7] Novel Techniques for Montgomery Modular Multiplication Algorithms for Public Key Cryptosystems
    Venkatasubramani, V. R.
    Rajaram, S.
    [J]. 2011 IEEE ELECTRICAL DESIGN OF ADVANCED PACKAGING AND SYSTEMS SYMPOSIUM (EDAPS), 2011,
  • [8] High-speed modular multiplication design for public-key cryptosystems
    Chen, Jun-Hong
    Lin, Wen-Ching
    Wu, Hao-Hsuan
    Shieh, Ming-Der
    [J]. PROCEEDINGS OF 2008 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS 1-10, 2008, : 680 - 683
  • [9] Coalition public-key cryptosystems
    Anisimov A.V.
    [J]. Cybernetics and Systems Analysis, 2001, 37 (1) : 1 - 12
  • [10] A survey of public-key cryptosystems
    Koblitz, N
    Menezes, AJ
    [J]. SIAM REVIEW, 2004, 46 (04) : 599 - 634
12345