Solving BDD by enumeration: an update
From MaRDI portal
Recommendations
Cited in
(48)- On the asymptotic complexity of solving LWE
- A public-key encryption scheme based on non-linear indeterminate equations
- Lower bounds on lattice enumeration with extreme pruning
- Polynomial time bounded distance decoding near Minkowski's bound in discrete logarithm lattices
- Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices
- 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
- 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
- Lattice-based fault attacks on deterministic signature schemes of ECDSA and EdDSA
- On the complexity of the BKW algorithm on LWE
- TFHE: fast fully homomorphic encryption over the torus
- On the hardness of module learning with errors with short distributions
- ASCA, SASCA and DPA with Enumeration: Which One Beats the Other and When?
- Post-quantum cryptography: state of the art
- Safe-errors on SPA protected implementations with the atomicity technique
- Parallel implementation of \textsf{BDD} enumeration for \textsf{LWE}
- High-performance ideal lattice-based cryptography on 8-bit ATxmega microcontrollers
- A low data complexity attack on the GMR-2 cipher used in the satellite phones
- Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
- BDD-Based Incremental Heuristic Search
- On the efficacy of solving LWE by reduction to unique-SVP
- An experimental study of Kannan's embedding technique for the search LWE problem
- Partially Known Nonces and Fault Injection Attacks on SM2 Signature Algorithm
- Coded-BKW: solving LWE using lattice codes
- An improved BKW algorithm for LWE with applications to cryptography and lattices
- Lattice enumeration using extreme pruning
- scientific article; zbMATH DE number 834569 (Why is no real title available?)
- Evaluating the cache side channel attacks against ECDSA
- Homomorphic Encryption Standard
- Random sampling revisited: lattice enumeration with discrete pruning
- On dual lattice attacks against small-secret LWE and parameter choices in HElib and SEAL
- Faster Dual Lattice Attacks for Solving LWE with Applications to CRYSTALS
- Revisiting group oriented secret sharing schemes
- Revisiting security estimation for LWE with hints from a geometric perspective
- New NTRU Records with Improved Lattice Bases
- Attacking (EC)DSA scheme with ephemeral keys sharing specific bits
- Extended attacks on ECDSA with noisy multiple bit nonce leakages
- A refined hardness estimation of LWE in two-step mode
- Attacking (EC)DSA with partially known multiples of nonces
- On counterexamples to the Mertens conjecture
- Memory-efficient BKW algorithm for solving the LWE problem
- Bias from uniform nonce: revised Fourier analysis-based attack on ECDSA
- The cool and the cruel: separating hard parts of LWE secrets
- Guidance for efficient selection of secure parameters for fully homomorphic encryption
- Fast slicer for Batch-CVP: making lattice hybrid attacks practical
- A hybrid of lattice-reduction and Meet-LWE via near-collision on Babai's plane
- SoK: on the security of cryptographic problems from linear algebra
- Exploring trade-offs in batch bounded distance decoding
This page was built for publication: Solving BDD by enumeration: an update
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4910246)
