安全かつ軽量な楕円曲線LR スカラー倍算

• Item type: SIG Technical Reports(1)
• 公開日: 2020-07-13
• タイトル: 安全かつ軽量な楕円曲線LR スカラー倍算
• タイトル / 言語: en
• タイトル: Secure and Compact Elliptic Curve LR Scalar Multiplication
• 言語: eng
• キーワード / 主題Scheme: Other
• キーワード / 主題: ISEC
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_18gh
• 資源タイプ: technical report
• 著者所属: 大阪大学工学研究科
• 著者所属: 大阪大学工学研究科
• 著者名: キン, ヨウアン; 宮地, 充子
• 著者名(英): Yaoan, Jin; Atsuko, Miyaji
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: Elliptic curve cryptography (ECC) can ensure an equivalent security with much smaller key sizes. Elliptic curve scalar multiplication (ECSM) is a fundamental computation used in ECC. This paper focuses on ECSM resisting simple power attack and safe error attack of side-channel attack specifically. Elliptic curve complete addition (CA) formulae can achieve secure ECSM algorithms but are inefficient from memory and computational cost perspectives. Another secure ECSM, which uses (extended) affine, is more efficient for both memory and computational costs. However, it scans input scalars from right to left. In this paper, our developed scalar multiplication algorithms also use their extended affine, but scan from left to right (LR). We also prove the security of our LR ECSM algorithms and analyze them both theoretically and experimentally. Our new LR ECSM algorithms can reduce the amount of memory by 37.5% and reduce the computational time by more than 40% compared to Joye’s regular 2-ary LR algorithm with CA formulae.
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: Elliptic curve cryptography (ECC) can ensure an equivalent security with much smaller key sizes. Elliptic curve scalar multiplication (ECSM) is a fundamental computation used in ECC. This paper focuses on ECSM resisting simple power attack and safe error attack of side-channel attack specifically. Elliptic curve complete addition (CA) formulae can achieve secure ECSM algorithms but are inefficient from memory and computational cost perspectives. Another secure ECSM, which uses (extended) affine, is more efficient for both memory and computational costs. However, it scans input scalars from right to left. In this paper, our developed scalar multiplication algorithms also use their extended affine, but scan from left to right (LR). We also prove the security of our LR ECSM algorithms and analyze them both theoretically and experimentally. Our new LR ECSM algorithms can reduce the amount of memory by 37.5% and reduce the computational time by more than 40% compared to Joye’s regular 2-ary LR algorithm with CA formulae.
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AA11235941
• 書誌情報: 研究報告コンピュータセキュリティ（CSEC）; 巻 2020-CSEC-90, 号 30, p. 1-8, 発行日 2020-07-13
• ISSN / 収録物識別子タイプ: ISSN
• ISSN / 収録物識別子: 2188-8655
• Notice: SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc.
• 出版者 / 言語: ja
• 出版者: 情報処理学会