( en | de | ru )

 

Disambiguation of "Isobe, Shuji"

Author of the publication

copydeleteadd this publication to your clipboard
Toward Separating the Strong Adaptive Pseudo-freeness from the Strong RSA Assumption.

, , , , and . ACISP, volume 7959 of Lecture Notes in Computer Science, page 72-87. Springer, (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Hiroyuki Isobe

Shuji Kimura

Shuji Sato

 

Other publications of authors with the same name

On a Relation between Knowledge-of-Exponent Assumptions and the DLog vs. CDH Question., , , and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 104-A (1): 20-24 (2021)A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees., , and . Int. J. Found. Comput. Sci., 10 (2): 171-194 (1999)On the Complexity of Computing Discrete Logarithms over Algebraic Tori., , , and . CANS, volume 5888 of Lecture Notes in Computer Science, page 433-442. Springer, (2009)On the Impossibility of Proving Security of Strong-RSA Signatures via the RSA Assumption., , , and . ACISP, volume 8544 of Lecture Notes in Computer Science, page 290-305. Springer, (2014)The RSA Group Is Adaptive Pseudo-Free under the RSA Assumption., , , and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 97-A (1): 200-214 (2014)On the Complexity of Computing Discrete Logarithms over Algebraic Tori., , , and . IEICE Trans. Inf. Syst., 97-D (3): 442-447 (2014)Autoreducibility and Completeness for Partial Multivalued Functions., and . IEICE Trans. Inf. Syst., 100-D (3): 422-427 (2017)Cost Total Colorings of Trees., , and . IEICE Trans. Inf. Syst., 87-D (2): 337-342 (2004)A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees., , and . WG, volume 1517 of Lecture Notes in Computer Science, page 100-113. Springer, (1998)Total Colorings of Degenerated Graphs., , and . ICALP, volume 2076 of Lecture Notes in Computer Science, page 506-517. Springer, (2001)