Cryptography and Coding
From MaRDI portal
Publication:5428165
DOI10.1007/b93924zbMath1123.94338OpenAlexW2478032277MaRDI QIDQ5428165
Katharina Geissler, Nigel P. Smart
Publication date: 28 November 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b93924
Related Items (2)
Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice ⋮ Generating cryptographically-strong random lattice bases and recognizing rotations of \(\mathbb{Z}^n\)
This page was built for publication: Cryptography and Coding