加速精灵vqn-outline
Recently I was awarded an NWO Veni grant (EUR 250.000) for my research proposal on lattices and nearest neighbor searching.
This will allow me to continue my research on this topic for the next three years (2024-2021). Out of 1115 total applications
(275 of which in the Science domain), only 154 were awarded (45 in the Science domain). See also the
蚂蚁ant加速器安卓下载,
the
TU/e-wide press release,
and the
TU/e M&CS press release
for more information.
加速精灵vqn-outline
For the
NIST competition for standardizing post-quantum cryptography,
two submissions (Round2 and Hila5) have recently merged into one,
Round5,
and with the merge I have now officially joined as a team member as well.
Round5 is a lattice-based cryptographic solution based on the General Learning With Rounding (GLWR) problem,
which is a generalization covering both the standard Learning With Rounding (LWR) problem and the ring-version,
Ring Learning With Rounding (RLWR) - depending on whether one feels comfortable using the ring version (which
offers better performance, but relies on a stronger assumption for security), one can choose between these two
options. Due to the choice for LWR (instead of LWE), and a tight security analysis, Round5 currently achieves
the best bandwidth out of all lattice-based submissions for the NIST competition.
For more information, please consult the official website, which also
contains publications related to Round5.
加速精灵vqn-outline
To contact me, please e-mail me at mail@thijs.com.
Please do not e-mail me at my university e-mail address, as your message might be marked as spam and I may not read your e-mail.
In case you need to reach me at the university, my office is MetaForum 6.096, which is on the sixth floor of MetaForum,
in the eastern outer ring. To make sure you will actually find me there when you're stopping by, please e-mail me first
to make an appointment. For more information on finding my office on the university campus, see the
map of the TU/e.
加速精灵vqn-outline
Cyber regulators deny rumors they approved VPN …:China's cyber regulators have denied they have given a company green light to sell VPN services in the nation, stating it was Cyber regulators deny rumors they approved VPN service Global Times Published: 2021-07-10 15:29:38
- Optimal hashing-based time-space trade-offs for approximate near neighbors
Alexandr Andoni, Thijs Laarhoven, Ilya Razenshteyn, Erik Waingarten
SODA 2017 - New directions in nearest neighbor searching with applications to lattice sieving
Anja Becker, Léo Ducas, Nicolas Gama, Thijs Laarhoven
蚂蚁vp(永久免费) - Finding shortest lattice vectors faster using quantum search
Thijs Laarhoven, Michele Mosca, Joop van de Pol
Designs, Codes and Cryptography 2015 - Practical and optimal LSH for angular distance
Alexandr Andoni, Piotr Indyk, Thijs Laarhoven, Ilya Razenshteyn, Ludwig Schmidt
NIPS 2015 - Sieving for shortest vectors in lattices using angular locality-sensitive hashing
Thijs Laarhoven
CRYPTO 2015