搜索结果: 1-4 共查到“军事学 k-gcd”相关记录4条 . 查询时间(0.125 秒)
Probability that the k-gcd of products of positive integers is B-smooth
gcd of products of positive integers B-smooth k-gcd
2016/4/7
In 1849, Dirichlet[5] proved that the probability that two positive integers are relatively prime is 1/zeta(2). Later, it was generalized into the case that positive integers has no nontrivial kth pow...
Fully Homomorphic Encryption Based on Approximate Matrix GCD
Fully Homomorphic Encryption Approximate Matrix GCD
2012/6/14
We first introduce approximate matrix GCD problem (AMGCD), and construct public key encryption schemes based on AMGCD. Then, we define a variant of AMGCD and design a new fully homomorphic encryption ...
Fully Homomorphic Encryption Based on Approximate Matrix GCD
Fully Homomorphic Encryption Approximate Matrix GCD Learning with Error Approximate GCD
2012/3/21
We first introduce approximate matrix GCD problem (AMGCD), and construct public key encryption schemes based on AMGCD. Then, we define a variant of AMGCD and design a new fully homomorphic encryption ...
Fully Homomorphic Encryption Based on Approximate Matrix GCD
Fully Homomorphic Encryption Approximate Matrix GCD Learning with Error Approximate GCD
2012/3/22
We first introduce approximate matrix GCD problem (AMGCD), and construct public key encryption schemes based on AMGCD. Then, we define a variant of AMGCD and design a new fully homomorphic encryption ...