Presentation 2011-11-15
SLP Separates the Strong RSA Assumption from the DDH Assumption
Masayuki FUKUMITSU, Shingo HASEGAWA, Shuji ISOBE, Eisuke KOIZUMI, Hiroki SHIZUYA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Although we have many computational reductions among the cryptographic primitives, little is known about the relationship between the integer factoring problem and the discrete logarithm problem, except that the former does not reduce to the latter under some condition. In other words, those two problems could be computationally separated. In this paper, we show that a straight-line program (SLP, for short) separates the strong RSA assumption from the DDH assumption.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) DDH Assumption / Strong RSA Assumption / Straight-Line Program
Paper # ISEC2011-55,LOIS2011-49
Date of Issue

Conference Information
Committee ISEC
Conference Date 2011/11/7(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) SLP Separates the Strong RSA Assumption from the DDH Assumption
Sub Title (in English)
Keyword(1) DDH Assumption
Keyword(2) Strong RSA Assumption
Keyword(3) Straight-Line Program
1st Author's Name Masayuki FUKUMITSU
1st Author's Affiliation Graduate School of Information Sciences, Tohoku University()
2nd Author's Name Shingo HASEGAWA
2nd Author's Affiliation Graduate School of Information Sciences, Tohoku University
3rd Author's Name Shuji ISOBE
3rd Author's Affiliation Graduate School of Information Sciences, Tohoku University
4th Author's Name Eisuke KOIZUMI
4th Author's Affiliation Graduate School of Information Sciences, Tohoku University
5th Author's Name Hiroki SHIZUYA
5th Author's Affiliation Graduate School of Information Sciences, Tohoku University
Date 2011-11-15
Paper # ISEC2011-55,LOIS2011-49
Volume (vol) vol.111
Number (no) 285
Page pp.pp.-
#Pages 8
Date of Issue