Pages that link to "Item:Q2412877"
From MaRDI portal
The following pages link to Revisiting the expected cost of solving uSVP and applications to LWE (Q2412877):
Displayed 30 items.
- HILA5: on reliability, reconciliation, and error correction for Ring LWE encryption (Q1746967) (← links)
- (One) failure is not an option: bootstrapping the search for failures in lattice-based encryption schemes (Q2055644) (← links)
- On bounded distance decoding with predicate: breaking the ``lattice barrier'' for the hidden number problem (Q2056699) (← links)
- On the success probability of solving unique SVP via BKZ (Q2061913) (← links)
- Shorter lattice-based zero-knowledge proofs via one-time commitments (Q2061919) (← 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)
- Revisiting orthogonal lattice attacks on approximate common divisor problems (Q2118873) (← links)
- Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance (Q2128583) (← 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)
- An extension of Kannan's embedding for solving ring-based LWE problems (Q2149793) (← links)
- Attacking ECDSA leaking discrete bits with a more efficient lattice (Q2151304) (← links)
- \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption (Q2170018) (← links)
- Comparison analysis of Ding's RLWE-based key exchange protocol and NewHope variants (Q2415387) (← links)
- Predicting the concrete security of LWE against the dual attack using binary search (Q2673056) (← links)
- Revisiting lower dimension lattice attacks on NTRU (Q2681396) (← links)
- (Q5034914) (← links)
- Homomorphic Encryption Standard (Q5044564) (← links)
- Learning strikes again: the case of the DRS signature scheme (Q5918281) (← links)
- NTRU Fatigue: How Stretched is Overstretched? (Q6045070) (← links)
- Generalized attack on ECDSA: known bits in arbitrary positions (Q6063142) (← links)
- Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice (Q6083665) (← links)
- A key-recovery attack against Mitaka in the \(t\)-probing model (Q6091134) (← links)
- EHNP strikes back: analyzing SM2 implementations (Q6103105) (← links)
- Revisiting the Sparsification Technique in Kannan’s Embedding Attack on LWE (Q6108625) (← links)
- Handle the traces: revisiting the attack on ECDSA with EHNP (Q6108775) (← links)
- Fast blind rotation for bootstrapping FHEs (Q6190094) (← links)
- Revisiting security estimation for LWE with hints from a geometric perspective (Q6190156) (← links)