Florian Göpfert

According to our database1, Florian Göpfert authored at least 19 papers between 2013 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Estimation of the hardness of the learning with errors problem with a restricted number of samples.
J. Math. Cryptol., 2019

2017
A Quantum Attack on LWE with Arbitrary Error Distribution.
IACR Cryptol. ePrint Arch., 2017

Creating Cryptographic Challenges Using Multi-Party Computation: The LWE Challenge.
IACR Cryptol. ePrint Arch., 2017

Revisiting the Expected Cost of Solving uSVP and Applications to LWE.
IACR Cryptol. ePrint Arch., 2017

A Hybrid Lattice Basis Reduction and Quantum Search Attack on LWE.
Proceedings of the Post-Quantum Cryptography - 8th International Workshop, 2017

CogniCrypt: supporting developers in using cryptography.
Proceedings of the 32nd IEEE/ACM International Conference on Automated Software Engineering, 2017

2016
Securely Instantiating Cryptographic Schemes Based on the Learning with Errors Assumption.
PhD thesis, 2016

On the Hardness of LWE with Binary Error: Revisiting the Hybrid Lattice-Reduction and Meet-in-the-Middle Attack.
IACR Cryptol. ePrint Arch., 2016

High-Performance and Lightweight Lattice-Based Public-Key Encryption.
Proceedings of the 2nd ACM International Workshop on IoT Privacy, Trust, and Security, 2016

Post-Quantum Cryptography: State of the Art.
Proceedings of the New Codebreakers, 2016

2015
An Unconditionally Hiding and Long-Term Binding Post-Quantum Commitment Scheme.
IACR Cryptol. ePrint Arch., 2015

2014
Tuning GaussSieve for Speed.
IACR Cryptol. ePrint Arch., 2014

Learning with Errors in the Exponent.
IACR Cryptol. ePrint Arch., 2014

High-Speed Signatures from Standard Lattices.
Proceedings of the Progress in Cryptology - LATINCRYPT 2014, 2014

Provably secure LWE encryption with smallish uniform noise and secret.
Proceedings of the ASIAPKC'14, 2014

Nearest Planes in Practice.
Proceedings of the Cryptography and Information Security in the Balkans, 2014

2013
Provably Secure LWE-Encryption with Uniform Secret.
IACR Cryptol. ePrint Arch., 2013

Discrete Ziggurat: A Time-Memory Trade-off for Sampling from a Gaussian Distribution over the Integers.
IACR Cryptol. ePrint Arch., 2013

On the Efficacy of Solving LWE by Reduction to Unique-SVP.
IACR Cryptol. ePrint Arch., 2013


  Loading...