Solving a 676-Bit Discrete Logarithm Problem in GF(3^<6n>)
スポンサーリンク
概要
- 論文の詳細を見る
- 2012-01-01
著者
-
Takagi Tsuyoshi
Institute For Molecular And Cellular Biology Osaka University
-
SHIRASE Masaaki
School of Systems Information Science, Future University-Hakodate
-
Wang Lihua
Network Security Res. Inst. National Inst. Of Information And Communications Technol.
-
Hayashi Takuya
Graduate School Of Mathematics Kyushu University
-
SHINOHARA Naoyuki
Network Security Research Institute, National Institute of Information and Communications Technology
-
Takagi Tsuyoshi
Institute Of Mathematics For Industry Kyushu University
-
Shinohara Naoyuki
Network Security Research Institute National Institute Of Information And Communications Technology
-
Matsuo Shin'ichiro
Network Security Research Institute National Institute Of Information And Communications Technology
-
Shirase Masaaki
School Of Systems Information Science Future University-hakodate
関連論文
- Suppression of polydactyly of the Gli3 mutant (extra toes) by δEF1 homozygous mutation
- Universal ηT pairing algorithm over arbitrary extension degree (ワイドバンドシステム)
- Universal ηT pairing algorithm over arbitrary extension degree (情報セキュリティ)
- Universal ηT pairing algorithm over arbitrary extension degree (情報理論)
- Solving a 676-Bit Discrete Logarithm Problem in GF(3^)
- Identity-Based Proxy Cryptosystems with Revocability and Hierarchical Confidentialities
- Cryptanalysis of Strong Designated Verifier Signature Scheme with Non-delegatability and Non-transferability
- Analysis and Improvement of a Secret Broadcast with Binding Encryption in Broadcasting Networks
- General Fault Attacks on Multivariate Public Key Cryptosystems
- Efficient Privacy-Preserving Reputation Evaluation in Decentralized Environments
- Security of Multivariate Signature Scheme Using Non-commutative Rings