BKZ

swMATH10242MaRDI QIDQ22207FDOQ22207

Author name not available (Why is that?)

Described by source

• BKZ 2.0: Better lattice security estimates

Cited In (84)

• The Bussard-Bagga and Other Distance-Bounding Protocols under Attacks
• Finding shortest lattice vectors faster using quantum search
• Public-key cryptography from new multivariate quadratic assumptions
• 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
• Analysis of error terms of signatures based on learning with errors
• A physical study of the LLL algorithm
• Improving convergence and practicality of slide-type reductions
• 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
• An improved BKW algorithm for LWE with applications to cryptography and lattices
• One-shot verifiable encryption from lattices
• Random sampling revisited: lattice enumeration with discrete pruning
• Choosing parameters for NTRUEncrypt
• 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
• Lattice-based SNARGs and their application to more efficient obfuscation
• The general sieve kernel and new records in lattice reduction
• A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack
• Hardness of SIS and LWE with small parameters
• 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
• An experimental study of Kannan's embedding technique for the search LWE problem
• Lattice Reduction for Modular Knapsack
• An efficient lattice reduction using reuse technique blockwisely on NTRU
• A tale of three signatures: practical attack of ECDSA with wNAF
• 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
• Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
• Gauss sieve algorithm on GPUs
• Attacking ECDSA leaking discrete bits with a more efficient lattice
• Predicting the concrete security of LWE against the dual attack using binary search
• A Subfield Lattice Attack on Overstretched NTRU Assumptions
• Faster algorithms for approximate common divisors: breaking fully-homomorphic-encryption challenges over the integers
• 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
• ETRU: NTRU over the Eisenstein integers
• On dual lattice attacks against small-secret LWE and parameter choices in HElib and SEAL
• 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
• An improved compression technique for signatures based on learning with errors
• Modular lattice signatures, revisited
• Trapdoors for lattices: simpler, tighter, faster, smaller
• Improved security for a ring-based fully homomorphic encryption scheme
• Estimating key sizes for high dimensional lattice-based systems
• A comparison of the homomorphic encryption schemes FV and YASHE
• Multiparty Computation from Somewhat Homomorphic Encryption
• Coded-BKW: solving LWE using lattice codes
• Parallel implementation of \textsf{BDD} enumeration for \textsf{LWE}
• 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
• Solving the shortest vector problem in lattices faster using quantum search
• Post-quantum key exchange for the Internet and the open quantum safe project
• Quantum-walk speedup of backtracking algorithms
• Practical FHE parameters against lattice attacks
• A polynomial-time algorithm for solving the hidden subset sum problem
• Secure statistical analysis using RLWE-based homomorphic encryption
• On pairwise Gaussian bases and LLL algorithm for three dimensional lattices
• Post-quantum cryptography: state of the art
• Quantum hardness of learning shallow classical circuits
• Learning strikes again: the case of the DRS signature scheme
• Predicting truncated multiple recursive generators with unknown parameters
• 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