Just how hard are rotations of $ℤ^n$? Algorithms and cryptography with the simplest lattice. Bennett, H., Ganju, A., Peetathawatchai, P., & Stephens-Davidowitz, N. In Eurocrypt, 2023. ![Just how hard are rotations of $ℤ^n$? Algorithms and cryptography with the simplest lattice [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper bibtex 20 downloads @inproceedings{BGPSJustHowHard2021,
title = {Just how hard are rotations of $\mathbb{Z}^n$? Algorithms and cryptography with the simplest lattice},
author = {Bennett, Huck and Ganju, Atul and Peetathawatchai, Pura and {Stephens-Davidowitz}, Noah},
year = {2023},
url = {https://eprint.iacr.org/2021/1548},
booktitle = {Eurocrypt},
}
Downloads: 20
{"_id":"QY8RvS4WDRDaadFuX","bibbaseid":"bennett-ganju-peetathawatchai-stephensdavidowitz-justhowhardarerotationsofnalgorithmsandcryptographywiththesimplestlattice-2023","author_short":["Bennett, H.","Ganju, A.","Peetathawatchai, P.","Stephens-Davidowitz, N."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","title":"Just how hard are rotations of $ℤ^n$? Algorithms and cryptography with the simplest lattice","author":[{"propositions":[],"lastnames":["Bennett"],"firstnames":["Huck"],"suffixes":[]},{"propositions":[],"lastnames":["Ganju"],"firstnames":["Atul"],"suffixes":[]},{"propositions":[],"lastnames":["Peetathawatchai"],"firstnames":["Pura"],"suffixes":[]},{"propositions":[],"lastnames":["Stephens-Davidowitz"],"firstnames":["Noah"],"suffixes":[]}],"year":"2023","url":"https://eprint.iacr.org/2021/1548","booktitle":"Eurocrypt","bibtex":"@inproceedings{BGPSJustHowHard2021,\n title = {Just how hard are rotations of $\\mathbb{Z}^n$? Algorithms and cryptography with the simplest lattice},\n author = {Bennett, Huck and Ganju, Atul and Peetathawatchai, Pura and {Stephens-Davidowitz}, Noah},\n year = {2023},\n\turl = {https://eprint.iacr.org/2021/1548},\n\tbooktitle = {Eurocrypt},\n}\n\n","author_short":["Bennett, H.","Ganju, A.","Peetathawatchai, P.","Stephens-Davidowitz, N."],"key":"BGPSJustHowHard2021","id":"BGPSJustHowHard2021","bibbaseid":"bennett-ganju-peetathawatchai-stephensdavidowitz-justhowhardarerotationsofnalgorithmsandcryptographywiththesimplestlattice-2023","role":"author","urls":{"Paper":"https://eprint.iacr.org/2021/1548"},"metadata":{"authorlinks":{}},"downloads":20},"bibtype":"inproceedings","biburl":"https://dl.dropbox.com/s/26018h26wgh5c2o/bibbase.bib","dataSources":["j49aoDnSSLjzndmof","bNuEGB6D6ArYKZG7X","rNfpY7KpfzEnPHFDu","mb294T8RPmLcqf4vP","BNGEiq2enqS7mhAQ9","L5symwsFtugce8mTM"],"keywords":[],"search_terms":["hard","rotations","algorithms","cryptography","simplest","lattice","bennett","ganju","peetathawatchai","stephens-davidowitz"],"title":"Just how hard are rotations of $ℤ^n$? Algorithms and cryptography with the simplest lattice","year":2023,"downloads":20}