The following pages link to Lattice-Based Cryptography (Q5756637):
Displayed 7 items.
- Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures (Q1015359) (← links)
- Circuit complexity of linear functions: gate elimination and feeble security (Q1946842) (← links)
- Towards factoring in \(\mathrm{SL}(2,\mathbb F_{2^n})\) (Q2448084) (← links)
- Cryptographic hardness for learning intersections of halfspaces (Q2517820) (← links)
- Gate Elimination for Linear Functions and New Feebly Secure Constructions (Q3007624) (← links)
- Algebraic cryptography: new constructions and their security against provable break (Q3079281) (← links)
- A Digital Signature Scheme Based on CVP ∞ (Q5445459) (← links)