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