Patrick Longa
Artificial Intelligence · 2011–2016
A researcher in the Science corpus: 2 papers; trusts 23 researchers and is trusted by 5 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 21 citations into it; #16,927 of 35,345 by trust here, #25,809 by citations
- Information Systems — 14 citations into it; #3,389 of 8,771 by trust here, #5,942 by citations
- Computational Theory and Mathematics — 9 citations into it
Whom Patrick Longa trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Vadim Lyubashevsky
- Chris Peikert
- Daniele Micciancio
- David Harvey
- Léo Ducas
- Oded Regev
- Tim Erhan Güneysu
- Frederik Vercauteren
- E. Alkım
- Guido Marco Bertoni
Who trusts Patrick Longa overall
Papers from Patrick Longa's perspective
Ordered by how strongly the researchers Patrick Longa trusts endorse each paper. Same corpus, a different order for every researcher.
- On Ideal Lattices and Learning with Errors over Rings
- Lattice Signatures Without Trapdoors (IACR Cryptology ePrint Archive)
- Lattice Signatures and Bimodal Gaussians (IACR Cryptology ePrint Archive)
- Post-quantum Key Exchange - A New Hope (USENIX Security Symposium)
- Lattice Cryptography for the Internet (Post-Quantum Cryptography)
- On lattices, learning with errors, random linear codes, and cryptography
- SWIFFT: A Modest Proposal for FFT Hashing (Fast Software Encryption Workshop)
- Trapdoors for hard lattices and new cryptographic constructions
- Better Key Sizes (and Attacks) for LWE-Based Encryption
- Making NTRU as Secure as Worst-Case Problems over Ideal Lattices (International Conference on the Theory and Application of Cryptographic Techniques)
Their papers
- Speeding up the Number Theoretic Transform for Faster Ideal Lattice-Based Cryptography (2016) — 295 citations
- Faster Explicit Formulas for Computing Pairings over Ordinary Curves (2011) — 218 citations