Pages that link to "Item:Q2345928"

The following pages link to Worst-case to average-case reductions for module lattices (Q2345928):

Displaying 50 items.

• An efficient lattice reduction using reuse technique blockwisely on NTRU (Q317407) (← links)
• SoK: how (not) to design and implement post-quantum cryptography (Q826276) (← links)
• On the hardness of module-LWE with binary secret (Q826282) (← links)
• Efficient lattice-based polynomial evaluation and batch ZK arguments (Q832321) (← links)
• LWE without modular reduction and improved side-channel attacks against BLISS (Q1633471) (← links)
• Memory lower bounds of reductions revisited (Q1648781) (← links)
• On the ring-LWE and polynomial-LWE problems (Q1648786) (← links)
• Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs (Q1648790) (← links)
• Assessing the feasibility of single trace power analysis of Frodo (Q1726676) (← links)
• Provably secure NTRUEncrypt over any cyclotomic field (Q1726689) (← links)
• NTRU prime: reducing attack surface at low cost (Q1746970) (← links)
• A framework for cryptographic problems from linear algebra (Q2023808) (← links)
• Limits on the efficiency of (ring) LWE-based non-interactive key exchange (Q2051406) (← links)
• (One) failure is not an option: bootstrapping the search for failures in lattice-based encryption schemes (Q2055644) (← links)
• MPSign: a signature from small-secret middle-product learning with errors (Q2055685) (← links)
• On the integer polynomial learning with errors problem (Q2061918) (← links)
• Shorter lattice-based zero-knowledge proofs via one-time commitments (Q2061919) (← links)
• LWE from non-commutative group rings (Q2068391) (← links)
• Fast reduction of algebraic lattices over cyclotomic fields (Q2096520) (← links)
• Lattice reduction for modules, or how to reduce ModuleSVP to ModuleSVP (Q2096523) (← links)
• Practical product proofs for lattice commitments (Q2096537) (← links)
• Lattice-based blind signatures, revisited (Q2096538) (← links)
• Covert authentication from lattices (Q2096622) (← links)
• Efficient and tight oblivious transfer from PKE with tight multi-user security (Q2096634) (← links)
• Efficient homomorphic conversion between (ring) LWE ciphertexts (Q2117044) (← links)
• Implementation of lattice trapdoors on modules and applications (Q2118540) (← links)
• A compressed \(\varSigma \)-protocol theory for lattices (Q2128575) (← links)
• A trace map attack against special ring-LWE samples (Q2128748) (← links)
• A monolithic hardware implementation of Kyber: comparing apples to apples in PQC candidates (Q2146081) (← links)
• Practical post-quantum few-time verifiable random function with applications to Algorand (Q2147263) (← links)
• An extension of Kannan's embedding for solving ring-based LWE problems (Q2149793) (← links)
• The matrix reloaded: multiplication strategies in FrodoKEM (Q2149815) (← links)
• Application of automorphic forms to lattice problems (Q2154470) (← links)
• Non-commutative ring learning with errors from cyclic algebras (Q2154559) (← links)
• \textsc{Mitaka}: a simpler, parallelizable, maskable variant of \textsc{Falcon} (Q2170090) (← links)
• Algebraically structured LWE. Revisited (Q2175901) (← links)
• Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597) (← links)
• TFHE: fast fully homomorphic encryption over the torus (Q2303454) (← links)
• Practical \(\mathsf{MP} \text{- }\mathsf{LWE}\)-based encryption balancing security-risk versus efficiency (Q2334442) (← links)
• When NTT meets Karatsuba: preprocess-then-NTT technique revisited (Q2672460) (← links)
• Small leaks sink a great ship: an evaluation of key reuse resilience of PQC third round finalist NTRU-HRSS (Q2673059) (← links)
• On the hardness of module learning with errors with short distributions (Q2677644) (← links)
• Practical exact proofs from lattices: new techniques to exploit fully-splitting rings (Q2692384) (← links)
• Towards classical hardness of module-LWE: the linear rank case (Q2692385) (← links)
• Twisted-PHS: using the product formula to solve approx-SVP in ideal lattices (Q2692387) (← links)
• Calamari and Falafl: logarithmic (linkable) ring signatures from isogenies and lattices (Q2692392) (← links)
• On the (M)iNTRU assumption in the integer case (Q2697921) (← links)
• Homomorphic Evaluation of Lattice-Based Symmetric Encryption Schemes (Q2817869) (← links)
• Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps (Q2953793) (← links)
• Attacks on the Search RLWE Problem with Small Errors (Q4603026) (← links)