Revisiting the expected cost of solving uSVP and applications to LWE
From MaRDI portal
Publication:2412877
DOI10.1007/978-3-319-70694-8_11zbMath1420.94034OpenAlexW2768572961MaRDI QIDQ2412877
Martin R. Albrecht, Florian Göpfert, Thomas Wunderer, Fernando Virdia
Publication date: 6 April 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-70694-8_11
Related Items
Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance, A trace map attack against special ring-LWE samples, Shortest vectors in lattices of Bai-Galbraith's embedding attack on the LWR problem, Homomorphic Encryption Standard, Solving the search-LWE problem over projected lattices, An extension of Kannan's embedding for solving ring-based LWE problems, Attacking ECDSA leaking discrete bits with a more efficient lattice, \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption, Predicting the concrete security of LWE against the dual attack using binary search, Comparison analysis of Ding's RLWE-based key exchange protocol and NewHope variants, NTRU Fatigue: How Stretched is Overstretched?, Generalized attack on ECDSA: known bits in arbitrary positions, Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice, A key-recovery attack against Mitaka in the \(t\)-probing model, Revisiting lower dimension lattice attacks on NTRU, EHNP strikes back: analyzing SM2 implementations, Revisiting the Sparsification Technique in Kannan’s Embedding Attack on LWE, Handle the traces: revisiting the attack on ECDSA with EHNP, Fast blind rotation for bootstrapping FHEs, Revisiting security estimation for LWE with hints from a geometric perspective, Unnamed Item, HILA5: on reliability, reconciliation, and error correction for Ring LWE encryption, Learning strikes again: the case of the DRS signature scheme, (One) failure is not an option: bootstrapping the search for failures in lattice-based encryption schemes, On bounded distance decoding with predicate: breaking the ``lattice barrier for the hidden number problem, On the success probability of solving unique SVP via BKZ, Shorter lattice-based zero-knowledge proofs via one-time commitments, Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\), LWE with side information: attacks and concrete security estimation, Revisiting orthogonal lattice attacks on approximate common divisor problems
