Pages that link to "Item:Q3102173"
From MaRDI portal
The following pages link to BKZ 2.0: Better Lattice Security Estimates (Q3102173):
Displaying 50 items.
- BKZ (Q22207) (← links)
- Homomorphic AES evaluation using the modified LTV scheme (Q310240) (← links)
- An efficient lattice reduction using reuse technique blockwisely on NTRU (Q317407) (← links)
- PotLLL: a polynomial time version of LLL with deep insertions (Q398939) (← links)
- ETRU: NTRU over the Eisenstein integers (Q488263) (← links)
- LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme (Q498985) (← links)
- Finding shortest lattice vectors faster using quantum search (Q887421) (← links)
- Secret computation of purchase history data using somewhat homomorphic encryption (Q890595) (← links)
- Review of cryptographic schemes applied to remote electronic voting systems: remaining challenges and the upcoming post-quantum paradigm (Q1643980) (← links)
- Shortest vector from lattice sieving: a few dimensions for free (Q1648783) (← links)
- A non-commutative cryptosystem based on quaternion algebras (Q1671643) (← links)
- Post-quantum key exchange for the Internet and the open quantum safe project (Q1698609) (← links)
- Sieving for closest lattice vectors (with preprocessing) (Q1698670) (← links)
- Systematics of aligned axions (Q1706848) (← links)
- Second order statistical behavior of LLL and BKZ (Q1746949) (← links)
- A public-key encryption scheme based on non-linear indeterminate equations (Q1746969) (← links)
- NTRU prime: reducing attack surface at low cost (Q1746970) (← links)
- Vulnerable public keys in NTRU cryptosystem (Q1997177) (← links)
- Analysis of DeepBKZ reduction for finding short lattice vectors (Q2004968) (← links)
- Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices (Q2009415) (← links)
- (One) failure is not an option: bootstrapping the search for failures in lattice-based encryption schemes (Q2055644) (← links)
- The convergence of slide-type reductions (Q2061912) (← links)
- On the success probability of solving unique SVP via BKZ (Q2061913) (← links)
- Bootstrapping fully homomorphic encryption over the integers in less than one second (Q2061925) (← links)
- A polynomial-time algorithm for solving the hidden subset sum problem (Q2096513) (← links)
- Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\) (Q2096521) (← links)
- LWE with side information: attacks and concrete security estimation (Q2096528) (← links)
- Lattice-based blind signatures, revisited (Q2096538) (← links)
- Improved lattice enumeration algorithms by primal and dual reordering methods (Q2104429) (← links)
- A physical study of the LLL algorithm (Q2112788) (← links)
- Revisiting orthogonal lattice attacks on approximate common divisor problems (Q2118873) (← links)
- Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance (Q2128583) (← links)
- Towards faster polynomial-time lattice reduction (Q2128584) (← links)
- A trace map attack against special ring-LWE samples (Q2128748) (← links)
- Shortest vectors in lattices of Bai-Galbraith's embedding attack on the LWR problem (Q2128750) (← links)
- Solving the search-LWE problem over projected lattices (Q2146741) (← links)
- Attacking ECDSA leaking discrete bits with a more efficient lattice (Q2151304) (← links)
- On a dual/hybrid approach to small secret LWE. A dual/enumeration technique for learning with errors and application to security estimates of FHE schemes (Q2152045) (← links)
- Lattice-based fault attacks on deterministic signature schemes of ECDSA and EdDSA (Q2152160) (← links)
- A Ring-LWE-based digital signature inspired by Lindner-Peikert scheme (Q2168799) (← links)
- \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption (Q2170018) (← links)
- Predicting truncated multiple recursive generators with unknown parameters (Q2182075) (← links)
- Recovering secrets from prefix-dependent leakage (Q2191199) (← links)
- A signature scheme from the finite field isomorphism problem (Q2191202) (← links)
- Flattening NTRU for evaluation key free homomorphic encryption (Q2191204) (← links)
- Self-dual DeepBKZ for finding short lattice vectors (Q2191205) (← links)
- Improved broadcast attacks against subset sum problems via lattice oracle (Q2195373) (← links)
- The lattice-based digital signature scheme qTESLA (Q2229291) (← links)
- Dynamic self-dual DeepBKZ lattice reduction with free dimensions and its implementation (Q2231762) (← links)
- On the complexity of the BKW algorithm on LWE (Q2256097) (← links)
