Presentation 1997/9/12
Design of Cryptosystems Based on Abelian Varieties over Extension Fields
Kazuto MATSUO, Jinhui CHAO, Shigeo TSUJII,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In recent years, cryptosystems have been proposed based on discrete logarithm prolems over Jacobian varieties of Abelian varieties including hyperelliptic curves. However, there is no efficient method known to construct such varieties over finite extension fields. In this paper, we present a, construction method of secure discrete logarithm problems on Jacobian varieties of Abelian varieties over finite field by using Abelian varieties with CM.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Discrete Logarithm Problems / Hyperelliptic Curves / Abelian Varieties / Jacobian Varieties / Complex Multiplication / Finite Fields.
Paper # ISEC97-30
Date of Issue

Conference Information
Committee ISEC
Conference Date 1997/9/12(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Security (ISEC)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Design of Cryptosystems Based on Abelian Varieties over Extension Fields
Sub Title (in English)
Keyword(1) Discrete Logarithm Problems
Keyword(2) Hyperelliptic Curves
Keyword(3) Abelian Varieties
Keyword(4) Jacobian Varieties
Keyword(5) Complex Multiplication
Keyword(6) Finite Fields.
1st Author's Name Kazuto MATSUO
1st Author's Affiliation Toyo Communication Equipment Co., Ltd.()
2nd Author's Name Jinhui CHAO
2nd Author's Affiliation Dept. of Electrical and Electronics Eng. Chuo Univ.
3rd Author's Name Shigeo TSUJII
3rd Author's Affiliation Dept. of Information Systems Eng. Chuo Univ.
Date 1997/9/12
Paper # ISEC97-30
Volume (vol) vol.97
Number (no) 252
Page pp.pp.-
#Pages 10
Date of Issue