搜索结果: 1-1 共查到“军事学 Sparse Subset Sum Problem”相关记录1条 . 查询时间(0.078 秒)
On the sparse subset sum problem from Gentry-Halevi's implementation of fully homomorphic encryption
public-key cryptography / sparse subset sum lattice reduction dimension reduction method geometric progression homomorphic encryption
2012/3/23
In Gentry's fully homoomrphic cryptosystem, a sparse subset sum problem is used and a big set is included in the public key. In the implementation of a variant of Gentry's scheme, to reduce the size o...