Faster CRT-RSA decryption towards RFID applications

被引：0
|
作者：
Maitra S. [1 ]
Sarkar S. [1 ]
Chowdhury M.U. [2 ]
机构：
[1] Applied Statistics Unit, Indian Statistical Institute, Kolkata 700 108
[2] School of Information Technology, Deakin University, Melbourne Campus, Burwood, VIC 3125
来源：
Cryptology and Information Security Series | 2010年 / 4卷
关键词：
CRT-RSA; Cryptography; Factorization; Fast Decryption; RFID; RSA;
D O I：
10.3233/978-1-60750-485-6-61
中图分类号：
学科分类号：
摘要：
In this paper we present a strategy to design the RSA parameters in such a manner so that the CRT-RSA decryption becomes more efficient than the existing methods. We achieve around 21% improvement in speed over the currently best known implementation strategy for CRT-RSA decryption with our properly chosen parameters that also helps in terms of less memory requirement. Moreover, we argue in detail the cryptographic security regarding our choice of the secret parameters. © 2010 The authors and IOS Press. All rights reserved.
引用
收藏
页码：61 / 72
页数：11
相关论文
共 26 条
  • [11] Wagner's attack on a secure CRT-RSA algorithm reconsidered
    Bloemer, Johannes
    Otto, Martin
    FAULT DIAGNOISIS AND TOLERANCE IN CRYPTOGRAPHY, PROCEEDINGS, 2006, 4236 : 13 - 23
  • [12] Revisiting the Polynomial-Time Equivalence of Computing the CRT-RSA Secret Key and Factoring
    Zheng, Mengce
    MATHEMATICS, 2022, 10 (13)
  • [13] CRT-RSA的连分数算法攻击的分析
    童子圣
    孙强
    微计算机信息, 2009, 25 (09) : 70 - 71
  • [14] A secured modular exponentiation for rsa and crt-rsa with dual blinding to resist power analysis attacks
    Mahanta H.J.
    Khan A.K.
    International Journal of Information and Computer Security, 2020, 12 (2-3) : 112 - 129
  • [15] Combined Attack on CRT-RSA Why Public Verification Must Not Be Public?
    Barbu, Guillaume
    Battistello, Alberto
    Dabosville, Guillaume
    Giraud, Christophe
    Renault, Guenael
    Renner, Soline
    Zeitoun, Rina
    PUBLIC-KEY CRYPTOGRAPHY - PKC 2013, 2013, 7778 : 198 - 215
  • [16] Partial Key Exposure Attack on Short Secret Exponent CRT-RSA
    May, Alexander
    Nowakowski, Julian
    Sarkar, Santanu
    ADVANCES IN CRYPTOLOGY - ASIACRYPT 2021, PT I, 2021, 13090 : 99 - 129
  • [17] On Second-Order Fault Analysis Resistance for CRT-RSA Implementations
    Dottax, Emmanuelle
    Giraud, Christophe
    Rivain, Matthieu
    Sierra, Yannick
    INFORMATION SECURITY THEORY AND PRACTICE: SMART DEVICES, PERVASIVE SYSTEMS, AND UBIQUITOUS NETWORKS, PROCEEDINGS, 2009, 5746 : 68 - +
  • [18] Improved Shamir's CRT-RSA Algorithm: Revisit with the Modulus Chaining Method
    Lee, Seungkwang
    Choi, Dooho
    Choi, Yongje
    ETRI JOURNAL, 2014, 36 (03) : 469 - 478
  • [19] New Partial Key Exposure Attacks on CRT-RSA with Large Public Exponents
    Lu, Yao
    Zhang, Rui
    Lin, Dongdai
    APPLIED CRYPTOGRAPHY AND NETWORK SECURITY, ACNS 2014, 2014, 8479 : 151 - 162
  • [20] CRT RSA Decryption: Modular Exponentiation based solely on Montgomery Multiplication
    Carlos Neto, Joao
    Tenca, Alexandre Ferreira
    Ruggiero, Wilson Vicente
    2015 49TH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS, 2015, : 431 - 436
123