Pages that link to "Item:Q2256097"

The following pages link to On the complexity of the BKW algorithm on LWE (Q2256097):

Displaying 14 items.

• On solving LPN using BKW and variants, Implementation and analysis (Q276557) (← links)
• On the asymptotic complexity of solving LWE (Q1692148) (← links)
• Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices (Q2009415) (← links)
• MPSign: a signature from small-secret middle-product learning with errors (Q2055685) (← links)
• On bounded distance decoding with predicate: breaking the ``lattice barrier'' for the hidden number problem (Q2056699) (← links)
• Making the BKW algorithm practical for LWE (Q2152043) (← links)
• \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption (Q2170018) (← links)
• TFHE: fast fully homomorphic encryption over the torus (Q2303454) (← links)
• Estimation of the hardness of the learning with errors problem with a restricted number of samples (Q2415419) (← links)
• Parallel Implementation of BDD Enumeration for LWE (Q2822698) (← links)
• Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds (Q2958113) (← links)
• An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices (Q3457104) (← links)
• Algebraic Aspects of Solving Ring-LWE, Including Ring-Based Improvements in the Blum--Kalai--Wasserman Algorithm (Q5001674) (← links)
• Modeling and simulating the sample complexity of solving LWE using BKW-style algorithms (Q6159444) (← links)