Efficient Randomized Regular Modular Exponentiation using Combined Montgomery and Barrett Multiplications

被引：2
|
作者：
Lesavourey, Andrea [1 ,2 ]
Negre, Christophe [1 ,2 ]
Plantard, Thomas [3 ]
机构：
[1] Univ Montpellier, CNRS, DALI UPVD, Perpignan, France
[2] Univ Montpellier, CNRS, LIRMM, Perpignan, France
[3] Univ Wollongong, CCISR, SCIT, Wollongong, NSW, Australia
来源：
SECRYPT: PROCEEDINGS OF THE 13TH INTERNATIONAL JOINT CONFERENCE ON E-BUSINESS AND TELECOMMUNICATIONS - VOL. 4 | 2016年
关键词：
RSA; Modular Exponentiation; Barrett; Montgomery; Differential Power Analysis; Correlation Power Analysis; Randomization;
D O I：
10.5220/0005998503680375
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Cryptographic operations performed on an embedded device are vulnerable to side channel analysis and particularly to differential and correlation power analysis. The basic protection against such attacks is to randomize the data all along the cryptographic computations. In this paper we present a modular multiplication algorithm which can be used for randomization. We show that we can use it to randomize the modular exponentiation of the RSA cryptosystem. The proposed randomization is free of computation and induces a level of randomization from 2(10) to 2(15) for practical RSA modulus size.
引用
收藏
页码：368 / 375
页数：8
相关论文
共 22 条
  • [1] EFFICIENT ARCHITECTURES FOR MODULAR EXPONENTIATION USING MONTGOMERY POWERING LADDER
    He, Yiruo
    Wu, Huapeng
    2011 24TH CANADIAN CONFERENCE ON ELECTRICAL AND COMPUTER ENGINEERING (CCECE), 2011, : 1202 - 1205
  • [2] Fast, compact and symmetric modular exponentiation architecture by common-multiplicand Montgomery modular multiplications
    Wu, Tao
    Li, Shuguo
    Liu, Litian
    INTEGRATION-THE VLSI JOURNAL, 2013, 46 (04) : 323 - 332
  • [3] Efficient Modular Exponentiation Based on Multiple Multiplications by a Common Operand
    Negre, Christophe
    Plantard, Thomas
    Robert, Jean-Marc
    IEEE 22ND SYMPOSIUM ON COMPUTER ARITHMETIC ARITH 22, 2015, : 144 - 151
  • [4] Area-Efficient Design of Modular Exponentiation Using Montgomery Multiplier for RSA Cryptosystem
    Nti, Richard Boateng
    Ryoo, Kwangki
    ADVANCED MULTIMEDIA AND UBIQUITOUS ENGINEERING, MUE/FUTURETECH 2018, 2019, 518 : 431 - 437
  • [5] Efficient regular modular exponentiation using multiplicative half-size splitting
    Negre C.
    Plantard T.
    Journal of Cryptographic Engineering, 2017, 7 (3) : 245 - 253
  • [6] Using Templates to Attack Masked Montgomery Ladder Implementations of Modular Exponentiation
    Herbst, Christoph
    Medwed, Marcel
    INFORMATION SECURITY APPLICATIONS, 2009, 5379 : 1 - 13
  • [7] An Efficient Single Core Flexible Processor Architecture for 4096-bit Montgomery Modular Multiplication and Exponentiation
    Culau, Eduardo C.
    Marchesan, Gregory C.
    Weirich Junior, Nelson R.
    de Oliveira, Leonardo Londero
    2018 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS), 2018,
  • [8] An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques
    Lou, Der-Chyuan
    Lai, Jui-Chang
    Wu, Chia-Long
    Chang, Te-Jen
    APPLIED MATHEMATICS AND COMPUTATION, 2007, 185 (01) : 31 - 44
  • [9] Efficient hardware for modular exponentiation using the sliding-window method
    Nedjah, Nadia
    Mourelle, Luiza de Macedo
    da Silva, Rodrigo Martins
    INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY, PROCEEDINGS, 2007, : 17 - +
  • [10] Efficient hardware for modular exponentiation using the sliding-window method
    Department of Electronics Engineering and Telecommunications, State University of Rio de Janeiro, Rio de Janeiro, Brazil
    不详
    Int. J. High Perform. Syst. Archit., 2008, 3 (199-206):
123