"Just How Hard Are Rotations of $\mathbb {Z}^n$? Algorithms and ..."

Huck Bennett et al. (2023)

> Home

Details and statistics

DOI: 10.1007/978-3-031-30589-4_9

access: closed

type: Conference or Workshop Paper

metadata version: 2023-04-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/eurocrypt/BennettGPS23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/eurocrypt/BennettGPS23
Huck Bennett, Atul Ganju, Pura Peetathawatchai, Noah Stephens-Davidowitz:
Just How Hard Are Rotations of $\mathbb {Z}^n$? Algorithms and Cryptography with the Simplest Lattice. EUROCRYPT (5) 2023: 252-281

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.