Pages that link to "Item:Q4325334"
From MaRDI portal
The following pages link to Block Reduced Lattice Bases and Successive Minima (Q4325334):
Displaying 17 items.
- PotLLL: a polynomial time version of LLL with deep insertions (Q398939) (← links)
- Non-standard approaches to integer programming (Q697562) (← links)
- Sampling methods for shortest vectors, closest vectors and successive minima (Q1014636) (← links)
- Towards faster polynomial-time lattice reduction (Q2128584) (← links)
- Worst case short lattice vector enumeration on block reduced bases of arbitrary blocksizes (Q2306599) (← links)
- A new parallel lattice reduction algorithm for BKZ reduced bases (Q2335926) (← links)
- Bounding basis reduction properties (Q2364641) (← links)
- A lattice-based McEliece scheme for encryption and signature (Q2741436) (← links)
- Slide reduction, successive minima and several~applications (Q2872006) (← links)
- Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes (Q3452347) (← links)
- Explicit Hard Instances of the Shortest Vector Problem (Q3535352) (← links)
- An optimal, stable continued fraction algorithm for arbitrary dimension (Q4645911) (← links)
- (Q5017599) (← links)
- A Tale of Three Signatures: Practical Attack of ECDSA with wNAF (Q5048983) (← links)
- Rankin’s Constant and Blockwise Lattice Reduction (Q5756630) (← links)
- On polynomial modular number systems over \(\mathbb{Z}/p\mathbb{Z}\) (Q6556574) (← links)
- A systematic study of sparse LWE (Q6652897) (← links)
