Pages that link to "Item:Q5188551"
From MaRDI portal
The following pages link to On the Complexity of Lattice Problems with Polynomial Approximation Factors (Q5188551):
Displayed 6 items.
- Noisy polynomial interpolation modulo prime powers (Q2034569) (← links)
- Post-quantum cryptography: lattice signatures (Q2390954) (← links)
- (Q2941638) (← links)
- Identity-based blind signature from lattices (Q4641449) (← links)
- Hermite’s Constant and Lattice Algorithms (Q5188538) (← links)
- Cryptographic Functions from Worst-Case Complexity Assumptions (Q5188549) (← links)