113 results on '"DUCAS, LÉO"'
Search Results
2. Asymptotics and Improvements of Sieving for Codes
3. Smoothing Codes and Lattices: Systematic Study and New Bounds
4. Finding Short Integer Solutions When the Modulus Is Small
5. Does the Dual-Sieve Attack on Learning with Errors Even Work?
6. Hull Attacks on the Lattice Isomorphism Problem
7. Hawk: Module LIP Makes Lattice Signatures Fast, Compact and Simple
8. Estimating the Hidden Overheads in the BDGL Lattice Sieving Algorithm
9. On the Lattice Isomorphism Problem, Quadratic Forms, Remarkable Lattices, and Cryptography
10. Finding Short Integer Solutions When the Modulus Is Small
11. Does the Dual-Sieve Attack on Learning with Errors Even Work?
12. NTRU Fatigue: How Stretched is Overstretched?
13. Advanced Lattice Sieving on GPUs, with Tensor Cores
14. Hawk: Module LIP Makes Lattice Signatures Fast, Compact and Simple
15. Estimating the Hidden Overheads in the BDGL Lattice Sieving Algorithm
16. On the Lattice Isomorphism Problem, Quadratic Forms, Remarkable Lattices, and Cryptography
17. Random Self-reducibility of Ideal-SVP via Arakelov Random Walks
18. LWE with Side Information: Attacks and Concrete Security Estimation
19. Integral Matrix Gram Root and Lattice Gaussian Sampling Without Floats
20. On the Quantum Complexity of the Continuous Hidden Subgroup Problem
21. The Randomized Slicer for CVPP: Sharper, Faster, Smaller, Batchier
22. On the Shortness of Vectors to Be Found by the Ideal-SVP Quantum Algorithm
23. The General Sieve Kernel and New Records in Lattice Reduction
24. Provable lattice reduction of $$\mathbb {Z}^n$$ with blocksize n/2
25. Large FHE Gates from Tensored Homomorphic Accumulator
26. Attacks on the AJPS Mersenne-Based Cryptosystem
27. Shortest Vector from Lattice Sieving: A Few Dimensions for Free
28. Hash Proof Systems over Lattices Revisited
29. Second Order Statistical Behavior of LLL and BKZ
30. Learning Strikes Again: The Case of the DRS Signature Scheme
31. On the Statistical Leak of the GGH13 Multilinear Map and Some Variants
32. Polynomial time bounded distance decoding near Minkowski’s bound in discrete logarithm lattices
33. Short Stickelberger Class Relations and Application to Ideal-SVP
34. Smoothing Codes and Lattices: Systematic Study and New Bounds
35. Learning Strikes Again: The Case of the DRS Signature Scheme
36. Integral Matrix Gram Root and Lattice Gaussian Sampling Without Floats
37. Random Self-reducibility of Ideal-SVP via Arakelov Random Walks
38. LWE with Side Information: Attacks and Concrete Security Estimation
39. On the Quantum Complexity of the Continuous Hidden Subgroup Problem
40. A Subfield Lattice Attack on Overstretched NTRU Assumptions : Cryptanalysis of Some FHE and Graded Encoding Schemes
41. Recovering Short Generators of Principal Ideals in Cyclotomic Rings
42. Sanitization of FHE Ciphertexts
43. FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
44. On the Shortness of Vectors to Be Found by the Ideal-SVP Quantum Algorithm
45. The General Sieve Kernel and New Records in Lattice Reduction
46. Efficient Identity-Based Encryption over NTRU Lattices
47. Enhanced Lattice-Based Signatures on Reconfigurable Hardware
48. Improved Short Lattice Signatures in the Standard Model
49. Lattice Signatures and Bimodal Gaussians
50. Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial Time.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.