Pages that link to "Item:Q2692398"
From MaRDI portal
The following pages link to Improved classical and quantum algorithms for subset-sum (Q2692398):
Displaying 15 items.
- Quantum key search for ternary LWE (Q2118530) (← links)
- How to meet ternary LWE keys (Q2128581) (← links)
- MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications (Q2139646) (← links)
- (Q3522560) (← links)
- Lattice Sieving via Quantum Random Walks (Q6045073) (← links)
- Quantum speedup for solving the minimum vertex cover problem based on Grover search algorithm (Q6107781) (← links)
- Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection (Q6132417) (← links)
- Low memory attacks on small key CSIDH (Q6535121) (← links)
- Commitments with efficient zero-knowledge arguments from subset sum problems (Q6550619) (← links)
- Revisiting nearest-neighbor-based information set decoding (Q6595933) (← links)
- Memory-efficient attacks on small LWE keys (Q6604868) (← links)
- Memory-efficient attacks on small LWE keys (Q6617636) (← links)
- Improved quantum algorithms for the k-XOR problem (Q6618596) (← links)
- CryptAttackTester: high-assurance attack analysis (Q6652984) (← links)
- Improved alternating-moduli PRFs and post-quantum signatures (Q6653030) (← links)
