BibTeX record journals/iacr/NewtonR22

download as .bib file

@article{DBLP:journals/iacr/NewtonR22,
  author       = {Parker Newton and
                  Silas Richelson},
  title        = {A Lower Bound for Proving Hardness of Learning with Rounding with
                  Polynomial Modulus},
  journal      = {{IACR} Cryptol. ePrint Arch.},
  pages        = {727},
  year         = {2022},
  url          = {https://eprint.iacr.org/2022/727},
  timestamp    = {Sat, 30 Sep 2023 10:14:03 +0200},
  biburl       = {https://dblp.org/rec/journals/iacr/NewtonR22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.