On the Hardness of Subset Sum Problem from Different Intervals
スポンサーリンク
概要
- 論文の詳細を見る
- 2012-05-01
著者
-
Kunihiro Noboru
The University Of Electro-communications
-
Kogure Jun
Fujitsu Laboratories Ltd.
-
YAMAMOTO Hirosuke
The University of Tokyo
関連論文
- New Conditions for Secure Knapsack Schemes against Lattice Attack
- Practical Password Recovery Attacks on MD4 Based Prefix and Hybrid Authentication Protocols
- A Strict Evaluation on the Number of Conditions for SHA-1 Collision Search
- Small Secret Key Attack on a Takagi's Variant of RSA
- Provably Secure Untraceable Electronic Cash against Insider Attacks(Discrete Mathematics and Its Applications)
- Public Key Encryption Schemes from the (B)CDH Assumption with Better Efficiency
- On the Hardness of Subset Sum Problem from Different Intervals