BKZ
From MaRDI portal
Software:22207
swMATH10242MaRDI QIDQ22207FDOQ22207
Author name not available (Why is that?)
Cited In (84)
- The Bussard-Bagga and Other Distance-Bounding Protocols under Attacks
- Finding shortest lattice vectors faster using quantum search
- Parallel Implementation of BDD Enumeration for LWE
- A Tale of Three Signatures: Practical Attack of ECDSA with wNAF
- PotLLL: a polynomial time version of LLL with deep insertions
- Improved lattice enumeration algorithms by primal and dual reordering methods
- Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance
- TFHE: fast fully homomorphic encryption over the torus
- A physical study of the LLL algorithm
- Improving convergence and practicality of slide-type reductions
- Coded-BKW: Solving LWE Using Lattice Codes
- Analysis of DeepBKZ reduction for finding short lattice vectors
- Revisiting orthogonal lattice attacks on approximate common divisor problems
- Homomorphic Encryption Standard
- Self-dual DeepBKZ for finding short lattice vectors
- Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices
- A new polynomial-time variant of LLL with deep insertions for decreasing the squared-sum of Gram-Schmidt lengths
- Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
- A trace map attack against special ring-LWE samples
- Shortest vectors in lattices of Bai-Galbraith's embedding attack on the LWR problem
- LWE with side information: attacks and concrete security estimation
- Public-Key Cryptography from New Multivariate Quadratic Assumptions
- A Comparison of the Homomorphic Encryption Schemes FV and YASHE
- The general sieve kernel and new records in lattice reduction
- An Improved Compression Technique for Signatures Based on Learning with Errors
- A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack
- On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL
- Analysis of Error Terms of Signatures Based on Learning with Errors
- Homomorphic AES evaluation using the modified LTV scheme
- Review of cryptographic schemes applied to remote electronic voting systems: remaining challenges and the upcoming post-quantum paradigm
- Lattice Reduction for Modular Knapsack
- An efficient lattice reduction using reuse technique blockwisely on NTRU
- LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme
- Secret computation of purchase history data using somewhat homomorphic encryption
- Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search
- Attacking ECDSA leaking discrete bits with a more efficient lattice
- Predicting the concrete security of LWE against the dual attack using binary search
- Choosing Parameters for NTRUEncrypt
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices
- On the complexity of the BKW algorithm on LWE
- Lattice-based fault attacks on deterministic signature schemes of ECDSA and EdDSA
- \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption
- Hardness of SIS and LWE with Small Parameters
- ETRU: NTRU over the Eisenstein integers
- A non-commutative cryptosystem based on quaternion algebras
- Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\)
- Lattice-based blind signatures, revisited
- Modular lattice signatures, revisited
- An Experimental Study of Kannan’s Embedding Technique for the Search LWE Problem
- Multiparty Computation from Somewhat Homomorphic Encryption
- Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
- Gauss Sieve Algorithm on GPUs
- Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers
- Revisiting Lattice Attacks on Overstretched NTRU Parameters
- Towards faster polynomial-time lattice reduction
- Estimation of the hardness of the learning with errors problem with a restricted number of samples
- Sieve, Enumerate, Slice, and Lift:
- Solving the search-LWE problem over projected lattices
- Systematics of aligned axions
- Post-quantum key exchange for the Internet and the open quantum safe project
- Estimating Key Sizes for High Dimensional Lattice-Based Systems
- Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- One-Shot Verifiable Encryption from Lattices
- Random Sampling Revisited: Lattice Enumeration with Discrete Pruning
- A polynomial-time algorithm for solving the hidden subset sum problem
- Lattice-Based SNARGs and Their Application to More Efficient Obfuscation
- Quantum Hardness of Learning Shallow Classical Circuits
- Secure Statistical Analysis Using RLWE-Based Homomorphic Encryption
- Post-Quantum Cryptography: State of the Art
- Learning strikes again: the case of the DRS signature scheme
- Predicting truncated multiple recursive generators with unknown parameters
- Title not available (Why is that?)
- A signature scheme from the finite field isomorphism problem
- Flattening NTRU for evaluation key free homomorphic encryption
- Recovering secrets from prefix-dependent leakage
- Twisted-PHS: using the product formula to solve approx-SVP in ideal lattices
- Worst case short lattice vector enumeration on block reduced bases of arbitrary blocksizes
- Improved broadcast attacks against subset sum problems via lattice oracle
- A lattice reduction algorithm based on sublattice BKZ
- The irreducible vectors of a lattice: some theory and applications
This page was built for software: BKZ
