搜索结果: 1-15 共查到“军事学 modulus”相关记录18条 . 查询时间(0.062 秒)
LAC: Practical Ring-LWE Based Public-Key Encryption with Byte-Level Modulus
lattice based cryptography learning with errors error correction
2018/11/2
Lattice based cryptography is one of the leading candidates of the post quantum cryptography. A major obstacle of deployment, though, is that its payload is relatively larger than the classical soluti...
Hide The Modulus: A Secure Non-Interactive Fully Verifiable Delegation Scheme for Modular Exponentiations via CRT
Verifiable and secure delegation modular exponentiations cloud security
2018/7/9
Security protocols using public-key cryptography often requires large number of costly modular exponentiations (MEs). With the proliferation of resource-constrained (mobile) devices and advancements i...
Efficient Bit-Decomposition and Modulus-Conversion Protocols with an Honest Majority
secret sharing bit-decomposition modulus conversion
2018/5/2
Secure computation enables parties with inputs to compute a function on the inputs while keeping
them secret. There are security notions that secure computation should satisfy, e.g., privacy, meaning...
A Nonstandard Variant of Learning with Rounding with Polynomial Modulus and Unbounded Samples
Lattices LWE Learning with Rounding
2018/1/30
The learning with rounding problem (LWR) has become a popular cryptographic assumption to study recently due to its determinism and resistance to known quantum attacks. Unfortunately, LWR is only know...
Large Modulus Ring-LWE ≥ Module-LWE
security reduction learning with errors lattice-based cryptography
2017/6/27
We present a reduction from the module learning with errors problem (MLWE) in dimension dd and with modulus qq to the ring learning with errors problem (RLWE) with modulus qdqd. Our reduction increase...
Cryptanalysis of the Overstretched NTRU Problem for General Modulus Polynomial
NTRU Ideal Lattice sub eld attack
2017/6/1
The overstretched NTRU problem, which is the NTRU problem with super-polynomial size q in n, is one of the important security foundation of cryptosystems which are recently suggested. Albrecht et al. ...
Faster Gaussian Sampling for Trapdoor Lattices with Arbitrary Modulus
Lattice-Based Cryptography Discrete Gaussian Sampling Lattice Trapdoors
2017/4/11
We present improved algorithms for gaussian preimage sampling using the lattice trapdoors of (Micciancio and Peikert, CRYPTO 2012). The MP12 work only offered a highly optimized algorithm for the on-l...
Pseudorandomness of Ring-LWE for Any Ring and Modulus
Learning with Errors lattice-based cryptography worst-case to average-case reduction
2017/3/27
We give a polynomial-time quantum reduction from worst-case (ideal) lattice problems directly to the decision version of (Ring-)LWE. This extends to decision all the worst-case hardness results that w...
Improved Fully Homomorphic Encryption with Composite Number Modulus
fully homomorphic encryption multivariate algebraic equation Gr鯾ner basis
2016/1/27
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
w...
Some recent constructions based on LWE do not sample the secret uniformly at random but rather from some distribution which produces small entries. The most prominent of these is the binary-LWE proble...
We show the following reductions from the learning with errors problem (LWE) to the learning with rounding problem (LWR): (1) Learning the secret and (2) distinguishing samples from random strings is ...
Fully Homomorphic Encryption with Composite Number Modulus
fully homomorphic encryption multivariate algebraic equation Gr鯾ner basis
2015/12/22
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 we...
Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
public-key cryptography / Fully Homomorphic Encryption
2012/1/18
We describe a compression technique that reduces the public key size of van Dijk, Gentry, Halevi and Vaikuntanathan's (DGHV) fully homomorphic scheme over the integers from \lambda^7 to \lambda^5. Our...
Modulus Fault Attacks Against RSA-CRT Signatures
implementation / Fault Attacks Digital Signatures RSA CRT Lattices
2011/7/28
RSA-CRT fault attacks have been an active research area since their discovery by Boneh, DeMillo and Lipton in 1997. We present alternative key-recovery attacks on RSA-CRT signatures: instead of target...
Modulus Fault Attacks Against RSA-CRT Signatures
Fault Attacks Digital Signatures RSA CRT Lattices
2011/7/25
RSA-CRT fault attacks have been an active research area since their discovery by Boneh, DeMillo and Lipton in 1997.