Michael Naehrig

From MaRDI portal
Person:898808

Available identifiers

zbMath Open naehrig.michaelMaRDI QIDQ898808

List of research outcomes





PublicationDate of PublicationType
On cycles of pairing-friendly abelian varieties2024-12-13Paper
Cryptographic smooth neighbors2024-08-30Paper
Finding twin smooth integers by solving Pell equations2022-11-08Paper
Improved Quantum Circuits for Elliptic Curve Discrete Logarithms2022-10-13Paper
Implementing Grover oracles for quantum key search on AES and LowMC2022-03-23Paper
Improved classical cryptanalysis of SIKE in practice2021-12-01Paper
Dual isogenies and their application to public-key compression for isogeny-based cryptography2020-05-05Paper
Sieving for shortest vectors in ideal lattices: a practical perspective2018-11-26Paper
Speeding up the number theoretic transform for faster ideal lattice-based cryptography2018-10-26Paper
Quantum resource estimates for computing elliptic curve discrete logarithms2018-03-08Paper
Accelerating homomorphic evaluation on reconfigurable hardware2018-02-14Paper
Efficient compression of SIDH public keys2017-06-13Paper
Efficient Algorithms for Supersingular Isogeny Diffie-Hellman2016-11-30Paper
Hilbert theta series and invariants of genus 2 curves2015-12-21Paper
Exponentiating in pairing groups2015-10-01Paper
Private computation on encrypted genomic data2015-09-17Paper
Subgroup security in pairing-based cryptography2015-09-17Paper
A comparison of the homomorphic encryption schemes FV and YASHE2014-06-24Paper
PandA: pairings and arithmetic2014-02-18Paper
Improved security for a ring-based fully homomorphic encryption scheme2014-01-17Paper
ML confidential: machine learning on encrypted data2013-06-04Paper
Affine pairings on ARM2013-04-04Paper
Attractive subfamilies of BLS curves for implementing high-security pairings2011-12-16Paper
Faster computation of the Tate pairing2011-04-08Paper
A CM construction for curves of genus 2 with \(p\)-rank 12011-04-08Paper
An analysis of affine coordinates for pairing computation2010-11-26Paper
New Software Speed Records for Cryptographic Pairings2010-08-31Paper
Faster pairing computations on curves with high-degree twists2010-05-28Paper
On Compressible Pairings and Their Computation2008-06-13Paper
Pairing-Friendly Elliptic Curves of Prime Order2007-11-15Paper

Research outcomes over time

This page was built for person: Michael Naehrig