The following pages link to (Q4699284):
Displaying 6 items.
- Magnifying computing gaps. Establishing encrypted communication over unidirectional channels (Q290516) (← links)
- Segment LLL reduction of lattice bases using modular arithmetic (Q1662551) (← links)
- Circuit complexity of linear functions: gate elimination and feeble security (Q1946842) (← 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)
- On the properties of reduced basis related to lattice-reduced algorithm (Q6585461) (← links)
