Michael Naehrig

According to our database1, Michael Naehrig authored at least 47 papers between 2005 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On cycles of pairing-friendly abelian varieties.
IACR Cryptol. ePrint Arch., 2024

ElectionGuard: a Cryptographic Toolkit to Enable Verifiable Elections.
IACR Cryptol. ePrint Arch., 2024

REACTIVE: Rethinking Effective Approaches Concerning Trustees in Verifiable Elections.
IACR Cryptol. ePrint Arch., 2024

2022
Cryptographic Smooth Neighbors.
IACR Cryptol. ePrint Arch., 2022

Finding twin smooth integers by solving Pell equations.
CoRR, 2022

2020
Improved Quantum Circuits for Elliptic Curve Discrete Logarithms.
IACR Cryptol. ePrint Arch., 2020

Sieving for twin smooth integers with solutions to the Prouhet-Tarry-Escott problem.
IACR Cryptol. ePrint Arch., 2020

Improved Classical Cryptanalysis of SIKE in Practice.
Proceedings of the Public-Key Cryptography - PKC 2020, 2020

2019
Dual Isogenies and Their Application to Public-key Compression for Isogeny-based Cryptography.
IACR Cryptol. ePrint Arch., 2019

Implementing Grover oracles for quantum key search on AES and LowMC.
IACR Cryptol. ePrint Arch., 2019

Improved Classical Cryptanalysis of the Computational Supersingular Isogeny Problem.
IACR Cryptol. ePrint Arch., 2019

2017
Manual for Using Homomorphic Encryption for Bioinformatics.
Proc. IEEE, 2017

Sieving for shortest vectors in ideal lattices: a practical perspective.
Int. J. Appl. Cryptogr., 2017

Quantum Resource Estimates for Computing Elliptic Curve Discrete Logarithms.
IACR Cryptol. ePrint Arch., 2017

Cryptographic Pairings.
IACR Cryptol. ePrint Arch., 2017

2016
Privately Evaluating Decision Trees and Random Forests.
Proc. Priv. Enhancing Technol., 2016

Selecting elliptic curves for cryptography: an efficiency and security analysis.
J. Cryptogr. Eng., 2016

Speeding up the Number Theoretic Transform for Faster Ideal Lattice-Based Cryptography.
IACR Cryptol. ePrint Arch., 2016

Efficient algorithms for supersingular isogeny Diffie-Hellman.
IACR Cryptol. ePrint Arch., 2016

Efficient compression of SIDH public keys.
IACR Cryptol. ePrint Arch., 2016

Frodo: Take off the ring! Practical, Quantum-Secure Key Exchange from LWE.
IACR Cryptol. ePrint Arch., 2016

Sharper Ring-LWE Signatures.
IACR Cryptol. ePrint Arch., 2016

CryptoNets: Applying Neural Networks to Encrypted Data with High Throughput and Accuracy.
Proceedings of the 33nd International Conference on Machine Learning, 2016

2015
Accelerating Homomorphic Evaluation on Reconfigurable Hardware.
IACR Cryptol. ePrint Arch., 2015

Private Computation on Encrypted Genomic Data.
IACR Cryptol. ePrint Arch., 2015

Subgroup security in pairing-based cryptography.
IACR Cryptol. ePrint Arch., 2015

2014
Private predictive analysis on encrypted medical data.
J. Biomed. Informatics, 2014

A Comparison of the Homomorphic Encryption Schemes FV and YASHE.
IACR Cryptol. ePrint Arch., 2014

Geppetto: Versatile Verifiable Computation.
IACR Cryptol. ePrint Arch., 2014

Post-quantum key exchange for the TLS protocol from the ring learning with errors problem.
IACR Cryptol. ePrint Arch., 2014

Crypto-Nets: Neural Networks over Encrypted Data.
CoRR, 2014

2013
Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme.
IACR Cryptol. ePrint Arch., 2013

Elliptic Curve Cryptography in Practice.
IACR Cryptol. ePrint Arch., 2013

Exponentiating in Pairing Groups.
IACR Cryptol. ePrint Arch., 2013

PandA: Pairings and Arithmetic.
Proceedings of the Pairing-Based Cryptography - Pairing 2013, 2013

2012
ML Confidential: Machine Learning on Encrypted Data.
IACR Cryptol. ePrint Arch., 2012

2011
A family of implementation-friendly BN elliptic curves.
J. Syst. Softw., 2011

Can Homomorphic Encryption be Practical?
IACR Cryptol. ePrint Arch., 2011

Attractive Subfamilies of BLS Curves for Implementing High-Security Pairings.
IACR Cryptol. ePrint Arch., 2011

Affine Pairings on ARM.
IACR Cryptol. ePrint Arch., 2011

2010
New software speed records for cryptographic pairings.
IACR Cryptol. ePrint Arch., 2010

An Analysis of Affine Coordinates for Pairing Computation.
IACR Cryptol. ePrint Arch., 2010

2009
Faster Pairing Computations on Curves with High-Degree Twists.
IACR Cryptol. ePrint Arch., 2009

Faster Computation of the Tate Pairing.
IACR Cryptol. ePrint Arch., 2009

2008
A CM construction for curves of genus 2 with p-rank 1.
IACR Cryptol. ePrint Arch., 2008

2007
On compressible pairings and their computation.
IACR Cryptol. ePrint Arch., 2007

2005
Pairing-Friendly Elliptic Curves of Prime Order.
IACR Cryptol. ePrint Arch., 2005


  Loading...