Presentation 2001/12/10
On the Square Root Exponentiation
Chisato Konoma, Masahiro Mambo, Hiroki Shizuya,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) It is not known that the integer factoring reduces to the discrete logarithm problem modulo a prime, or the converse holds. We introduce a problem called Computational Square Root Exponentiation, CSRE, and give a characterization for the reduction above in terms of the complexity of CSRE. We also show that under some practical assumption, CSRE lies between CDH and DDH, and that DDH lies between CSRE and DSRE, where CDH, DDH and DSRE stand for Computational Diffie-Hellman problem, Decisional DH problem, and Decisional SRE problem, respectively.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) integer factoring / discrete logarithm problem / square root exponentiation / Diffie-Hellman problem
Paper # ISEC2001-88
Date of Issue

Conference Information
Committee ISEC
Conference Date 2001/12/10(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) On the Square Root Exponentiation
Sub Title (in English)
Keyword(1) integer factoring
Keyword(2) discrete logarithm problem
Keyword(3) square root exponentiation
Keyword(4) Diffie-Hellman problem
1st Author's Name Chisato Konoma
1st Author's Affiliation Dept.of Computer and Mathematical Sciences, Graduate School of Information Sciences, Tohoku University()
2nd Author's Name Masahiro Mambo
2nd Author's Affiliation Dept.of Computer and Mathematical Sciences, Graduate School of Information Sciences, Tohoku University
3rd Author's Name Hiroki Shizuya
3rd Author's Affiliation Dept.of Computer and Mathematical Sciences, Graduate School of Information Sciences, Tohoku University
Date 2001/12/10
Paper # ISEC2001-88
Volume (vol) vol.101
Number (no) 507
Page pp.pp.-
#Pages 8
Date of Issue