搜索结果: 1-5 共查到“军事学 Average-Case”相关记录5条 . 查询时间(0.093 秒)
Non-Malleable Codes from Average-Case Hardness: AC0, Decision Trees, and Streaming Space-Bounded Tampering
non-malleable codes streaming
2017/11/3
We show a general framework for constructing non-malleable codes against tampering families with average-case hardness bounds. Our framework adapts ideas from the Naor-Yung double encryption paradigm ...
We present functions that can be computed in some fixed polynomial time but are hard on average for any algorithm that runs in slightly smaller time, assuming widely-conjectured worst-case hardness fo...
Structural Lattice Reduction: Generalized Worst-Case to Average-Case Reductions and Homomorphic Cryptosystems
Lattices Worst-case to Average-case Reductions Homomorphic Encryption
2016/1/23
In lattice cryptography, worst-case to average-case reductions rely on two problems: Ajtai’s SIS and Regev’s LWE, which both refer to a very small class of random lattices related to the group G = Z...
An Extended Quadratic Frobenius Primality Test with Average Case Error Estimates
Quadratic Frobenius Primality Test Average Case Error Estimates
2009/4/16
We present an Extended Quadratic Frobenius Primality Test (EQFT),
which is related to the Miller-Rabin test and the Quadratic Frobenius test
(QFT) by Grantham. EQFT is well-suited for generating lar...
Lattices that Admit Logarithmic Worst-Case to Average-Case Connection Factors
Lattices Admit Logarithmic Worst-Case Average-Case Connection Factors
2009/1/5
We demonstrate an average-case problem which is as hard as finding
(n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where
(n) = O(plog n).The previously best k...