Results 61 to 70 of about 4,957 (182)
Lattice Gaussian Sampling by Markov Chain Monte Carlo: Bounded Distance Decoding and Trapdoor Sampling [PDF]
Sampling from the lattice Gaussian distribution plays an important role in various research fields. In this paper, the Markov chain Monte Carlo (MCMC)-based sampling technique is advanced in several fronts.
Ling, Cong, Wang, Zheng
core +1 more source
NTRU is a new public key cryptosystem proposed at Crypto 96 by Hoffstein, Pipher and Silverman from the Mathematics department of Brown University. It attracted considerable attention, and is being advertised over the Internet by NTRU Cryptosystems.
Don Coppersmith, Adi Shamir
openaire +1 more source
A Secure Access Framework for IoT–Cloud Integration With Blockchain and Bi‐GCN
Digital advancements have made cloud computing and IoT essential for innovative environments such as healthcare and industry. Cloud platforms offer scalable compute and storage capabilities, whereas IoT devices generate real‐time data. However, there are significant challenges faced while integrating the IoT with cloud to achieve robust, scalable, and ...
Kavitha M. S. +2 more
wiley +1 more source
Design of Linkable Ring Signature Scheme Based on the MP‐LWE Problem and Its Application in IoV
Ensuring the information security and privacy of users in the Internet of Vehicles (IoV) is crucial for gaining user trust and promoting the application of vehicular networks. This article designs an efficient linkable ring signature (LRS) scheme on the basis of the middle‐product learning with errors (MP‐LWE) problem and applies it to vehicular ...
Lansheng Han +3 more
wiley +1 more source
Algebraic attack on NTRU using Witt vectors and Gröbner bases
We present an algebraic attack on NTRU (restricted to the case where the parameter q is a power of two) using the method of the Witt vectors proposed by Silverman, Smart and Vercauteren [Springer: 278–298, 2005]; the latter considered only the first two ...
Bourgeois Gérald, Faugère Jean-Charles
doaj +1 more source
New practical algorithms for the approximate shortest lattice vector [PDF]
We present a practical algorithm that given an LLL-reduced lattice basis of dimension n, runs in time O(n3(k=6)k=4+n4) and approximates the length of the shortest, non-zero lattice vector to within a factor (k=6)n=(2k). This result is based on reasonable
Schnorr, Claus Peter
core
Revisiting LWR: A Novel Reduction Through Quantum Approximations
Pseudorandom functions (PRFs) are a very important tool in cryptography, and the learning with rounding (LWR) problem is one of the main issues in their construction. LWR problem, is to find s∈Zqn from ⌊As⌋p, where A∈Zqm×n and ⋅p:Zq→Zp is the rounding function.
Zhuang Shan +3 more
wiley +1 more source
Improved FHE Bootstrapping and Its Applications in Discretized Neural Networks
The inefficiency of bootstrapping is the primary bottleneck preventing fully homomorphic encryption (FHE) from practical applications. One of the main obstacles to improving the bootstrapping performance using hardware acceleration is the large storage overhead of the bootstrapping keys.
Kaixing Wang +5 more
wiley +1 more source
Proposal for Two Enhanced NTRU [PDF]
Sound is very widely used in communication. In order to ensure secure communication a cryptographic data scheme is used. Secure sound is needed in many fields such as military, business, banking and electronic commerce. There is also an increasing demand for secured sound in network communication.
Ahmed Tariq, Najlaa Mohammad, Suha Abdul
openaire +1 more source
The current multikey fully homomorphic encryption (MKFHE) needs to add exponential noise in the distributed decryption phase to ensure the simulatability of partial decryption. Such a large noise causes the ciphertext modulus of the scheme to increase exponentially compared to the single‐key fully homomorphic encryption (FHE), further reducing the ...
Xiaokang Dai +3 more
wiley +1 more source

