›› 2013, Vol. 13 ›› Issue (10): 0-0.
• 信息网络安全 •
类背包DH问题的比特安全性研究
李伟;吕克伟
Reseach on Bit Security of Similar Knapsack Difife-Hellman Problem
LI Wei%LV Ke-wei
摘要： As an variant of Knapsack Diffie-Hellman problem, we pose similar Knapsack Diffie-Hellman problem. For its hardness, we prove that the least most significant bit of its plaintext is a hard-core predicate. Furthermore, each bit of its plaintext is also a h