• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to project page

2003 Fiscal Year Final Research Report Summary

Discrete Logarithm Problem Nd Information Security

Research Project

Project/Area Number 13440032
Research Category

Grant-in-Aid for Scientific Research (B)

Allocation TypeSingle-year Grants
Section一般
Research Field General mathematics (including Probability theory/Statistical mathematics)
Research InstitutionOsaka University

Principal Investigator

SUZUKI Joe  Osaka University, Graduate School of Science, Associate Professor, 大学院・理学研究科, 助教授 (50216397)

Co-Investigator(Kenkyū-buntansha) OGAWA Hiroyuki  OGAWA,Hiroyuki, 大学院・理学研究科, 助手 (70243160)
IBUKIYAMA Tomoyoshi  IBUKIYAMA,Tomoyoshi, 大学院・理学研究科, 教授 (60011722)
YAMAMOTO Yoshihiko  YAMAMOTO,Yoshihiko, 大学院・理学研究科, 教授 (90028184)
HARASAWA Ryuichi  Nagasaki Univ., Faculty of engineering, Assistant, 工学部, 助手 (10363467)
FUJIWARA Tohru  FUJIWARA,Tohru, 大学院・情報科学研究科, 教授 (70190098)
Project Period (FY) 2001 – 2003
KeywordsNon Singular Curve / Discrete Logarithm / Information Security / Jacobian group
Research Abstract

K. Kedlaya proposed an method to count the number of IF_q-rational points in a hyper-elliptic curve, using the Leschetz fixed points formula in Monsky-Washinitzer Cohomology. The method has been extended to super-elliptic curves (Gaudry and. Gurel) immediately, to characteristic two hyper-elliptic curves, and to. C_<ab> curves (J. Denef, F. Vercauteren). Based on"Mi.ura theory, which is associated with how a curve is expressed as an affne variety, this paper applies Kedlaya's method to so-called strongly telescopic curves which are no longer plane curves and contain super-elliptic curves as special cages.

  • Research Products

    (10 results)

All Other

All Publications (10 results)

  • [Publications] Joe Suzuki: "Generalizing Kedlaya's Order Counting Based on Miura Theory"京都大学数理解析研究所講究録(講演は2003年11月に実施). 1361. 56-79 (2004)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Joe Suzuki, Boris Ryabko: "Coding Combinatorial Sources with Costs"IEEE Trans.on Information Theory. VOL.50,No.5(2404年3月の時点で採録が決定). 925-928 (2004)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] 鈴木譲: "ユニバーサル予測とユニバーサル符号化"電子情報通信学会論文誌D-II. VOL.J85-D-II, No.5. 735-746 (2002)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Junji Shikata, Goichiro Hanaoka, Yuliang Zheng, Hideki Imai: "Security Notions for Unconditionally Secure Signature Schemes"Eurocrypt 2002. LNCS 2332. 434-449

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Ryuichi Harasawa, Yutaka Sueyoshi, Aichi Kudo: "Isomorphism Classes of Hyperelliptic Curves of Genus Three over Finite Fields"SCIS 2004, Sendai, Japan. (2004)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Joe Suzuki, Boris Ryabko: "Coding Combinatorial Sources with Costs"IEEE Trans. on Information Theory. Vol.50, No.5, May. 925-928 (2004)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Joe Suzuki: "Universal Prediction and. Universal Coding"IEICE Trans. D-II. Vol.J85-D-II, No.5, May. 735-746 (2002)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Junji Shikata, Goichiro Hanaoka, Yuliang Zheng, Hideki Imai: "Security Notions for Unconditionally Secure Signature Schemes"Eurocrypt 2002. LNCS 2332. 434-449

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Ryuichi Harasawa, Yutaka Sueyoshi, Aichi Kudo: "Isomorphism Classes of Hyperelliptic Curves of Genus Three over Finite Fields"SCIS 2004 (Sendai, Japan). Jan.. (2004)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Joe Suzuki: "Generalizing. Kedlaya's Order Counting Based on Miura Theory"Kyoto Univ.. 1361(56-79) (2004)

    • Description
      「研究成果報告書概要(欧文)」より

URL: 

Published: 2005-04-19  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi