default search action
Florian Göpfert
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j1]Nina Bindel, Johannes Buchmann, Florian Göpfert, Markus Schmidt:
Estimation of the hardness of the learning with errors problem with a restricted number of samples. J. Math. Cryptol. 13(1): 47-67 (2019) - 2017
- [c14]Martin R. Albrecht, Florian Göpfert, Fernando Virdia, Thomas Wunderer:
Revisiting the Expected Cost of Solving uSVP and Applications to LWE. ASIACRYPT (1) 2017: 297-322 - [c13]Stefan Krüger, Sarah Nadi, Michael Reif, Karim Ali, Mira Mezini, Eric Bodden, Florian Göpfert, Felix Günther, Christian Weinert, Daniel Demmler, Ram Kamath:
CogniCrypt: supporting developers in using cryptography. ASE 2017: 931-936 - [c12]Florian Göpfert, Christine van Vredendaal, Thomas Wunderer:
A Hybrid Lattice Basis Reduction and Quantum Search Attack on LWE. PQCrypto 2017: 184-202 - [i10]Florian Göpfert, Christine van Vredendaal, Thomas Wunderer:
A Quantum Attack on LWE with Arbitrary Error Distribution. IACR Cryptol. ePrint Arch. 2017: 221 (2017) - [i9]Johannes Buchmann, Niklas Büscher, Florian Göpfert, Stefan Katzenbeisser, Juliane Krämer, Daniele Micciancio, Sander Siim, Christine van Vredendaal, Michael Walter:
Creating Cryptographic Challenges Using Multi-Party Computation: The LWE Challenge. IACR Cryptol. ePrint Arch. 2017: 606 (2017) - [i8]Martin R. Albrecht, Florian Göpfert, Fernando Virdia, Thomas Wunderer:
Revisiting the Expected Cost of Solving uSVP and Applications to LWE. IACR Cryptol. ePrint Arch. 2017: 815 (2017) - 2016
- [b1]Florian Göpfert:
Securely Instantiating Cryptographic Schemes Based on the Learning with Errors Assumption. Darmstadt University of Technology, Germany, 2016, pp. 1-129 - [c11]Johannes Buchmann, Florian Göpfert, Rachel Player, Thomas Wunderer:
On the Hardness of LWE with Binary Error: Revisiting the Hybrid Lattice-Reduction and Meet-in-the-Middle Attack. AFRICACRYPT 2016: 24-43 - [c10]Johannes Buchmann, Denis Butin, Florian Göpfert, Albrecht Petzoldt:
Post-Quantum Cryptography: State of the Art. The New Codebreakers 2016: 88-108 - [c9]Johannes Buchmann, Florian Göpfert, Tim Güneysu, Tobias Oder, Thomas Pöppelmann:
High-Performance and Lightweight Lattice-Based Public-Key Encryption. IoTPTS@AsiaCCS 2016: 2-9 - [c8]Johannes Buchmann, Niklas Büscher, Florian Göpfert, Stefan Katzenbeisser, Juliane Krämer, Daniele Micciancio, Sander Siim, Christine van Vredendaal, Michael Walter:
Creating Cryptographic Challenges Using Multi-Party Computation: The LWE Challenge. AsiaPKC@AsiaCCS 2016: 11-20 - [i7]Johannes Buchmann, Florian Göpfert, Rachel Player, Thomas Wunderer:
On the Hardness of LWE with Binary Error: Revisiting the Hybrid Lattice-Reduction and Meet-in-the-Middle Attack. IACR Cryptol. ePrint Arch. 2016: 89 (2016) - 2015
- [c7]Özgür Dagdelen, Sebastian Gajek, Florian Göpfert:
Learning with Errors in the Exponent. ICISC 2015: 69-84 - [i6]Daniel Cabarcas, Denise Demirel, Florian Göpfert, Jean Lancrenon, Thomas Wunderer:
An Unconditionally Hiding and Long-Term Binding Post-Quantum Commitment Scheme. IACR Cryptol. ePrint Arch. 2015: 628 (2015) - 2014
- [c6]Christian H. Bischof, Johannes Buchmann, Özgür Dagdelen, Robert Fitzpatrick, Florian Göpfert, Artur Mariano:
Nearest Planes in Practice. BalkanCryptSec 2014: 203-215 - [c5]Daniel Cabarcas, Florian Göpfert, Patrick Weiden:
Provably secure LWE encryption with smallish uniform noise and secret. AsiaPKC@AsiaCCS 2014: 33-42 - [c4]Özgür Dagdelen, Rachid El Bansarkhani, Florian Göpfert, Tim Güneysu, Tobias Oder, Thomas Pöppelmann, Ana Helena Sánchez, Peter Schwabe:
High-Speed Signatures from Standard Lattices. LATINCRYPT 2014: 84-103 - [c3]Robert Fitzpatrick, Christian H. Bischof, Johannes Buchmann, Özgür Dagdelen, Florian Göpfert, Artur Mariano, Bo-Yin Yang:
Tuning GaussSieve for Speed. LATINCRYPT 2014: 288-305 - [i5]Robert Fitzpatrick, Christian H. Bischof, Johannes Buchmann, Özgür Dagdelen, Florian Göpfert, Artur Mariano, Bo-Yin Yang:
Tuning GaussSieve for Speed. IACR Cryptol. ePrint Arch. 2014: 788 (2014) - [i4]Özgür Dagdelen, Sebastian Gajek, Florian Göpfert:
Learning with Errors in the Exponent. IACR Cryptol. ePrint Arch. 2014: 826 (2014) - 2013
- [c2]Martin R. Albrecht, Robert Fitzpatrick, Florian Göpfert:
On the Efficacy of Solving LWE by Reduction to Unique-SVP. ICISC 2013: 293-310 - [c1]Johannes Buchmann, Daniel Cabarcas, Florian Göpfert, Andreas Hülsing, Patrick Weiden:
Discrete Ziggurat: A Time-Memory Trade-Off for Sampling from a Gaussian Distribution over the Integers. Selected Areas in Cryptography 2013: 402-417 - [i3]Daniel Cabarcas, Florian Göpfert, Patrick Weiden:
Provably Secure LWE-Encryption with Uniform Secret. IACR Cryptol. ePrint Arch. 2013: 164 (2013) - [i2]Johannes Buchmann, Daniel Cabarcas, Florian Göpfert, Andreas Hülsing, Patrick Weiden:
Discrete Ziggurat: A Time-Memory Trade-off for Sampling from a Gaussian Distribution over the Integers. IACR Cryptol. ePrint Arch. 2013: 510 (2013) - [i1]Martin R. Albrecht, Robert Fitzpatrick, Florian Göpfert:
On the Efficacy of Solving LWE by Reduction to Unique-SVP. IACR Cryptol. ePrint Arch. 2013: 602 (2013)
Coauthor Index
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 20:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint