Art
J-GLOBAL ID：200902157123906533
Reference number：96A0805159
Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes.
Diffie-Hellmanとそれに関連した方式の秘密鍵の最上位ビットを求めることの困難さ
-
Publisher site
Copy service
{{ this.onShowCLink("http://jdream3.com/copy/?sid=JGLOBAL&noSystem=1&documentNoArray=96A0805159©=1") }}
-
Access JDreamⅢ for advanced search and analysis.
{{ this.onShowJLink("http://jdream3.com/lp/jglobal/index.html?docNo=96A0805159&from=J-GLOBAL&jstjournalNo=H0078D") }}
Author (2)：
,
Material：
Volume：
1109
Page：
129-142
Publication year：
1996
JST Material Number：
H0078D
ISSN：
0302-9743
Document type：
Proceedings
Article type：
原著論文
Country of issue：
Germany, Federal Republic of (DEU)
Language：
ENGLISH (EN)
Thesaurus term：
Thesaurus term/Semi thesaurus term
Keywords indexed to the article.
All keywords is available on JDreamIII(charged).
On J-GLOBAL, this item will be available after more than half a year after the record posted. In addtion, medical articles require to login to MyJ-GLOBAL.
,...
JST classification (2)：
JST classification
Category name(code) classified by JST.
Theory of computation
, Code theory
Terms in the title (3)：
Terms in the title
Keywords automatically extracted from the title.
,
,
Return to Previous Page
