Generating Secure Genus Two Hyperelliptic Curves Using Elkies' Point Counting Algorithm
スポンサーリンク
概要
- 論文の詳細を見る
This paper proposes an improvement of Elkies' point counting algorithm for the Jacobian of a genus 2 hyperelliptic curve defined over a finite field in a practical sense and introduces experimental results. Our experimental results show that we can generate a cryptographic secure genus 2 hyperelliptic curve, where the order of its Jacobian is a 160-bit prime number in about 8.1 minutes on average, on a 700 MHz PentiumIII level PC. We improve Elkies' algorithm by proposing some complementary techniques for speeding up the baby-step giant-step.
- 社団法人電子情報通信学会の論文
- 2003-04-01
著者
-
Kanayama Naoki
Department of Bioscience and Biotechnology, Graduate School of Natural Science and Technology, Okaya
-
Kanayama Naoki
Department Of Bioscience And Biotechnology Graduate School Of Natural Science And Technology Okayama
-
Kanayama Naoki
Department Of Information And Communication Engineering The University Of Electro-comrnunications
-
Kanayama N
Waseda Univ. Tokyo Jpn
-
UCHIYAMA Shigenori
NTT Information Sharing Platform Laboratories, NTT Corporation
-
Uchiyama S
Ntt Information Sharing Platform Laboratories
-
Uchiyama Shigenori
Ntt Information Sharing Platform Laboratories
-
NAGAO Koh-ichi
Faculty of Engineering, Kanto Gakuin University
-
Nagao Koh-ichi
Faculty Of Engineering Kanto Gakuin University
関連論文
- Conditional transformation of immunoglobulin mutation pattern from gene conversion into point mutation by controlling XRCC3 expression in the DT40 B cell line(CELL AND TISSUE ENGINEERING)
- Efficient affinity maturation of antibodies in an engineered chicken B cell line DT40-SW by increasing point mutation
- The Vanstone-Zuccherato Schemes Revisited(Information Security)
- Efficient affinity maturation of antibodies in an engineered chicken B cell line DT40-SW by increasing point mutation(CELL AND TISSUE ENGINEERING)
- Optimised Versions of the Ate and Twisted Ate Pairings
- Conditional transformation of immunoglobulin mutation pattern from gene conversion into point mutation by controlling XRCC3 expression in the DT40 B cell line
- Enhancement of antibody production from a chicken B cell line DT40 by reducing Pax5 expression(MEDICAL BIOTECHNOLOGY)
- Novel In Vitro Screening System for Monoclonal Antibodies Using Hypermutating Chicken B Cell Library(METHOD)
- Optimised Versions of the Ate and Twisted Ate Pairings
- Non-optimistic Secure Circuit Evaluation Based on ElGamal Encryption and Its Applications(Protocols,Cryptography and Information Security)
- Candidate One-Way Functions on Non-Supersingular Elliptic Curves(Elliptic Curve Cryptography, Cryptography and Information Security)
- Non-Supersingular Elliptic Curves for Pairing-Based Cryptosystems(Discrete Mathematics and Its Applications)
- Remarks on Elliptic Curve Discrete Logarithm Problems(Special Section on Cryptography and Information Security)
- The co-Diffie-Hellman Problem over Elliptic Curves
- Analysis of Baby-Step Giant-Step Algorithms for Non-uniform Distributions (Fundamental) (Cryptography and Information Security)
- Generating Secure Genus Two Hyperelliptic Curves Using Elkies' Point Counting Algorithm
- On the Euclidean Algorithm of Polynomials (Special Section on Discrete Mathematics and Its Applications)
- Scalar Multiplication on Pairing Friendly Elliptic Curves
- A Note on the Pairing Computation Using Normalized Miller Functions
- Implementation of an Elliptic Curve Scalar Multiplication Method Using Division Polynomials