An Efficient Representation of Scalars for Simultaneous Elliptic Scalar Multiplication
スポンサーリンク
概要
- 論文の詳細を見る
The computational performance of cryptographic protocols using an elliptic curve strongly depends on the efficiency of the scalar multiplication. Some elliptic curve based cryptographic protocols, such as signature verification, require computation of multi scalar multiplications of kP + lQ, where P and Q are points on an elliptic curve. An efficient way to compute kP + lQ is to compute two scalar multiplications simultaneously, rather than computing each scalar multiplication separately. We introduce new efficient algorithms for simultaneous scalar multiplication on an elliptic curve. We also give a detailed analysis of the computational efficiency of our proposed algorithms.
- 一般社団法人電子情報通信学会の論文
- 2003-05-01
著者
-
Sakurai Kouichi
Faculty Of Computer Science And Communication Engineering Kyushu University
-
Sakurai Kouichi
Faculty Of Engineering Kyushu University
-
SAKAl Yasuyuki
Information Technology R&D Center, Mitsubishi Electric Corporation
-
Sakal Yasuyuki
Information Technology R&d Center Mitsubishi Electric Corporation
-
SAKURAI Kouichi
Faculty of Engineering, Kyushu University
関連論文
- A Collaborative Role-Based Access Control for Trusted Operating Systems in Distributed Environment(Application)(Cryptography and Information Security)
- Usage Control Model and Architecture for Data Confidentiality in a Database Service Provider(Network Security)
- 1-out-of-L E-voting System with Efficient Computational Complexity Based on r-th Residue Encryption
- A-7-21 Security Policy Pre-evaluation towards Risk Analysis
- Securing provenance by distributing the provenance storage (マルチメディア通信と分散処理・コンピュータセキュリティ)
- Use of Montgomery Trick in Precomputation of Multi-Scalar Multiplication in Elliptic Curve Cryptosystems(Special Section on Cryptography and Information Security)
- PGV-Style Block-Cipher-Based Hash Families and Black-Box Analysis(Symmetric Key Cryptography)(Cryptography and Information Security)
- 1-out-of-L E-voting System with Efficient Computational Complexity Based on r-th Residue Encryption
- A Simple Power Attack on a Randomized Addition-Subtraction Chains Method for Elliptic Curve Cryptosystems
- Analysis and Design of SHA-V and RIPEMD-V with Variable Output-Length
- Simple Power Analysis on Fast Modular Reduction with Generalized Mersenne Prime for Elliptic Curve Cryptosystems(Side Channel Analysis, Cryptography and Information Security)
- Enhancing Airport Access Control Security with Multiple Biometrics Contactless Smart Card (特集:新たな脅威に立ち向かうコンピュータセキュリティ技術)
- An Efficient Representation of Scalars for Simultaneous Elliptic Scalar Multiplication
- Usage Control Model and Architecture for Data Confidentiality in a Database Service Provider
- Usage Control Model and Architecture for Data Confidentiality in a Database Service Provider