Presentation	2008-11-14 Elliptic curves with a pre-determined embedding degree Shoujirou HIRASAWA, Atsuko MIYAJI,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	Embedding degree k is one indicator to the difference between on the elliptic curve discrete logarithm problem (ECDLP) and the discrete logarithm problem (DLP). Depending on embedding degree k, ECDLP on E(F_q) is reduced to DLP on F_. In recent year, paring-based cryptography has drawn attention of many researchers. Use of paring in cryptography has made ECDLP and DLP secure. Freeman set the requirements for paring where there exists an integer r such that r|#E(F_q) and k<(log q)/8.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	elliptic curve / embedding degree / DLP / ECDLP
Paper #	ISEC2008-82,OIS2008-58
Date of Issue

Conference Information
Committee	ISEC
Conference Date	2008/11/6(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	JPN
Title (in Japanese)	(See Japanese page)
Sub Title (in Japanese)	(See Japanese page)
Title (in English)	Elliptic curves with a pre-determined embedding degree
Sub Title (in English)
Keyword(1)	elliptic curve
Keyword(2)	embedding degree
Keyword(3)	DLP
Keyword(4)	ECDLP
1st Author's Name	Shoujirou HIRASAWA
1st Author's Affiliation	Japan Advanced Institute of Science and Technology()
2nd Author's Name	Atsuko MIYAJI
2nd Author's Affiliation	Japan Advanced Institute of Science and Technology
Date	2008-11-14
Paper #	ISEC2008-82,OIS2008-58
Volume (vol)	vol.108
Number (no)	284
Page	pp.pp.-
#Pages	4
Date of Issue