Improvements of Addition Algorithm on Genus 3 Hyperellipic Curves and Their Implementation(Public Key Cryptography)(<Special Section>Cryptography and Information Security)
スポンサーリンク
概要
- 論文の詳細を見る
Genus 3 hyperelliptic curve cryptosystems are capable of fast-encryption on a 64-bit CPU, because a 56-bit field is enough for their definition fields. Recently, Kuroki et al. proposed an extension of the Harley algorithm, which had been known as the fastest addition algorithm of divisor classes on genus 2 hyperelliptic curves, on genus 3 hyperelliptic curves and Pelzl et al. improved the algorithm. This paper shows an improvement of the Harley algorithm on genus 3 hyperelliptic curves using Toom's multiplication. The proposed algorithm takes only I+70M for an addition and I+71M for a doubling instead of I+76M and I+74M respectively, which are the best possible of the previous works, where I and M denote the required time for an inversion and a multiplication over the definition field respectively. This paper also shows 2 variations of the proposed algorithm in order to adapt the algorithm to various platforms. Moreover this paper discusses finite field arithmetic suitable for genus 3 hyperelliptic curve cryptosystems and shows implementation results of the proposed algorithms on a 64-bit CPU. The implementation results show a 160-bit scalar multiplication can be done within 172μS on a 64-bit CPU Alpha EV68 1.25 GHz.
- 社団法人電子情報通信学会の論文
- 2005-01-01
著者
-
Tsujii Shigeo
Graduate School Of Information Security Institute Of Information Security:research And Development I
-
AOKI Kazumaro
NTT Information Sharing Platform Laboratories, NTT Corporation
-
Matsuo Kazuto
Graduate School Of Information Security Institute Of Information Security:research And Development I
-
Aoki Kazumaro
Ntt Information Sharing Platform Laboratories Ntt Corporation
-
Tsujii Shigeo
Graduate School Of Information Security Institute Of Information Security
-
Tsujii S
Graduate School Of Information Security Institute Of Information Security:research And Development I
-
GONDA Masaki
Dept. of Information and System Engineering, Chuo University
-
CHAO Jinhui
Dept. of Information and System Engineering, Chuo University
-
Gonda Masaki
Dept. Of Information And System Engineering Chuo University
-
Aoki Kazumaro
Ntt Informating Sharing Platform Laboratories Ntt Corporation
関連論文
- Efficient Algorithms for Tate Pairing(Elliptic Curve Cryptography, Cryptography and Information Security)
- Dually-Perturbed Matsumoto-Imai Signature (DPMS) Scheme
- Security Enhancement of Various MPKCs by 2-Layer Nonlinear Piece in Hand Method
- Proposal for Piece in Hand Matrix : General Concept for Enhancing Security of Multivariate Public Key Cryptosystems(Discrete Mathematics and Its Applications)
- Practical Password Recovery Attacks on MD4 Based Prefix and Hybrid Authentication Protocols
- A Subspace Blind Identification Algorithm with Reduced Computational Complexity : Colored Noise Case(Digital Signal Processing)
- A Practical Subspace Blind Identification Algorithm with Reduced Computational Complexity : Colored Noise Case
- A Practical Subspace Blind Identification Algorithm with Reduced Computational Complexity(Digital Signal Processing)
- Improvements of Addition Algorithm on Genus 3 Hyperellipic Curves and Their Implementation(Public Key Cryptography)(Cryptography and Information Security)
- Baby Step Giant Step Algorithms in Point Counting of Hyperelliptic Curves
- Bucket Sieving
- On Waveform Equalization and its Economical Profit in Optical Fiber PCM Transmission System
- Analysis of Baby-Step Giant-Step Algorithms for Non-uniform Distributions (Fundamental) (Cryptography and Information Security)
- Robust noise suppression algorithm using the only Kalman filter theory for white and colored noises (Speech) -- (国際ワークショップ"Asian workshop on speech science and technology")
- Robust Noise Suppression Algorithm with the Kalman Filter Theory for White and Colored Disturbance
- Robust noise suppression algorithm using the only Kalman filter theory for white and colored noises
- A CGM APPROACH TO SUBSPACE BASED BLIND CHANNEL IDENTIFICATION
- Invariant Extraction and Segmentation of 3D Objects Using Linear Lie Algebra Models(Regular Section)
- A Cyclic Window Algorithm for Elliptic Curves over OEF(Special Section on Cryptography and Information Security)
- Preimage Attacks against PKC98-Hash and HAS-V