On codes and learning with errors over function fields
From MaRDI portal
Publication:6104346
DOI10.1007/978-3-031-15979-4_18arXiv2202.13990MaRDI QIDQ6104346
Maxime Bombar, Alain Couvreur, Thomas Debris-Alazard
Publication date: 28 June 2023
Published in: Advances in Cryptology – CRYPTO 2022 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2202.13990
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the ring-LWE and polynomial-LWE problems
- Efficient pseudorandom correlation generators from ring-LPN
- Wave: a new family of trapdoor one-way preimage sampleable functions based on codes
- Worst-case to average-case reductions for module lattices
- An Efficient Pseudo-Random Generator Provably as Secure as Syndrome Decoding
- Decoding One Out of Many
- Algebraic Function Fields and Codes
- On Ideal Lattices and Learning with Errors over Rings
- Efficient Public Key Encryption Based on Ideal Lattices
- Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
- Explicit Class Field Theory for Rational Function Fields
- A new identification scheme based on syndrome decoding
- Normalbasis bei Körpern ohne höhere Verzweigung.
- A simple proof of Noether's theorem
- On the decoding of algebraic-geometric codes
- Lapin: An Efficient Authentication Protocol Based on Ring-LPN
- Pseudorandomness of ring-LWE for any ring and modulus
- Algebraic geometry codes and some applications
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- On lattices, learning with errors, random linear codes, and cryptography
- On the hardness of the NTRU problem
This page was built for publication: On codes and learning with errors over function fields
