Pages that link to "Item:Q6637566"
From MaRDI portal
The following pages link to The hardness of LPN over any integer ring and field for PCG applications (Q6637566):
Displaying 3 items.
- Group encryption: full dynamicity, message filtering and code-based instantiation (Q6564029) (← links)
- Not just regular decoding: asymptotics and improvements of regular syndrome decoding attacks (Q6652985) (← links)
- More efficient zero-knowledge protocols over \(\mathbb{Z}_{2^k}\) via Galois rings (Q6653054) (← links)