MISC

2007年1月

Toward separating integer factoring from discrete logarithm mod p

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
  • Shuji Isobe
  • ,
  • Wataru Kumagai
  • ,
  • Masahiro Mambo
  • ,
  • Hiroki Shizuya

E90A
1
開始ページ
48
終了ページ
53
記述言語
英語
掲載種別
DOI
10.1093/ietfec/e90-a.1.48
出版者・発行元
IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG

This paper studies the reduction among cyptographic functions. Our main result is that the prime factoring function IF does not reduce to the certified discrete logarithm function modulo a prime nor its variant with respect to some special reducibility, i.e. the range injection reducibility, under the assumption that the Heath-Brown conjecture is true and IF is not an element of PF. Since there is no known direct relationship between these functions, this is the first result that could separate these functions. Our approach is based on the notion of the preimage functions.

リンク情報
DOI
https://doi.org/10.1093/ietfec/e90-a.1.48
Web of Science
https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=JSTA_CEL&SrcApp=J_Gate_JST&DestLinkType=FullRecord&KeyUT=WOS:000243703300007&DestApp=WOS_CPL
ID情報
  • DOI : 10.1093/ietfec/e90-a.1.48
  • ISSN : 0916-8508
  • eISSN : 1745-1337
  • Web of Science ID : WOS:000243703300007

エクスポート
BibTeX RIS