搜索结果: 1-7 共查到“军事学 norm”相关记录7条 . 查询时间(0.093 秒)
More Efficient Algorithms for the NTRU Key Generation using the Field Norm
lattice techniques public-key cryptography quantum cryptography
2019/1/9
NTRU lattices are a class of polynomial rings which allow for compact and efficient representations of the lattice basis, thereby offering very good performance characteristics for the asymmetric algo...
Improved Algorithms for the Approximate k-List Problem in Euclidean Norm
sieving SVP cryptanalysis
2017/2/20
We present an algorithm for the approximate kk-List problem for the Euclidean distance that improves upon the Bai-Laarhoven-Stehle (BLS) algorithm from ANTS'16. The improvement stems from the observat...
FHPKE with Zero Norm Noises based on DLA&CDH
fully homomorphic public-key encryption discrete logarithm assimption computational Diffie–Hellman assumption
2016/7/29
In this paper I propose the fully homomorphic public-key encryption(FHPKE) scheme with zero norm noises that is based on the discrete logarithm assumption(DLA) and computational Diffie–Hellman assumpt...
Fully Homomorphic Encryption with Zero Norm Cipher Text
fully homomorphic encryption octonion factoring
2016/6/29
Gentry抯 bootstrapping technique is the most famous method of obtaining fully homomorphic encryption. In previous work I proposed a fully homomorphic encryption without bootstrapping which has the weak...
Solving Random Subset Sum Problem by $l_{p}$-norm SVP Oracle
SVP random subset sum problems lattice
2016/1/26
Fast Algorithm to solve a family of SIS problem with l1 norm
SIS Lattice bounded multivariate polynomials linerization
2010/11/22
In this paper, we present a new algorithm, such that, for the small integer solution (SIS) problem, if the solution is bounded ( by an integer in l1 norm, which we call a bounded SIS (BSIS) problem,...
Unique Shortest Vector Problem for max norm is NP-hard
unique closest vector problem unique subspace avoiding problem Lattice
2009/6/8
The unique Shortest vector problem (uSVP) in lattice theory plays a crucial role in many
public-key cryptosystems. The security of those cryptosystems bases on the hardness of uSVP. However,
so far ...