BKZ
From MaRDI portal
swMATH10242MaRDI QIDQ22207FDOQ22207
Author name not available (Why is that?)
Official website: http://link.springer.com/chapter/10.1007/978-3-642-25385-0_1
Cited In (only showing first 100 items - show all)
- 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
- TFHE: fast fully homomorphic encryption over the torus
- Improving convergence and practicality of slide-type reductions
- Analysis of DeepBKZ reduction for finding short lattice vectors
- 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
- 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
- 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
- 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
- Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
- Gauss sieve algorithm on GPUs
- 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
- NTL
- BLISS
- HElib
- CFS
- DeepLLL
- PotLLL
- ETRU
- MaTRU
- NTRU
- NTRUSign
- SWIFFT
- fpLLL
- NTRUEncrypt
- McBits
- FHEW
- On the complexity of the BKW algorithm on LWE
- ring-LWE
- fhe
- liboqs
- Saber
- Lattice-based fault attacks on deterministic signature schemes of ECDSA and EdDSA
- Falcon
- fpylll
- OTRU
- TFHE
- FrodoKEM
- 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
- BLAZE
- PALISADE
- 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
- FACCT
- GALATICS
- G6K
- 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
- A polynomial-time algorithm for solving the hidden subset sum problem
- RLizard
- Improved lattice enumeration algorithms by primal and dual reordering methods
- Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance
- Analysis of error terms of signatures based on learning with errors
- A physical study of the LLL algorithm
- Revisiting orthogonal lattice attacks on approximate common divisor problems
- 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
- A trace map attack against special ring-LWE samples
- Shortest vectors in lattices of Bai-Galbraith's embedding attack on the LWR problem
- A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack
- An experimental study of Kannan's embedding technique for the search LWE problem
- A tale of three signatures: practical attack of ECDSA with wNAF
This page was built for software: BKZ