Craig Costello

Orcid: 0000-0001-5423-7714

According to our database1, Craig Costello authored at least 44 papers between 2009 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Efficient (3,3)-isogenies on fast Kummer surfaces.
IACR Cryptol. ePrint Arch., 2024

Efficient (3, 3)-isogenies on fast Kummer surfaces.
CoRR, 2024

2022
An algorithm for efficient detection of (N, N)-splittings and its application to the isogeny problem in dimension 2.
IACR Cryptol. ePrint Arch., 2022

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

Accelerating the Delfs-Galbraith Algorithm with Fast Subfield Root Detection.
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

2021
SuperSolver: accelerating the Delfs-Galbraith algorithm with fast subfield root detection.
IACR Cryptol. ePrint Arch., 2021

The Case for SIKE: A Decade of the Supersingular Isogeny Problem.
IACR Cryptol. ePrint Arch., 2021

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
Improved Classical Cryptanalysis of the Computational Supersingular Isogeny Problem.
IACR Cryptol. ePrint Arch., 2019

Supersingular isogeny key exchange for beginners.
IACR Cryptol. ePrint Arch., 2019

B-SIDH: supersingular isogeny Diffie-Hellman using twisted torsion.
IACR Cryptol. ePrint Arch., 2019

The supersingular isogeny problem in genus 2 and beyond.
IACR Cryptol. ePrint Arch., 2019

2018
Montgomery curves and their arithmetic - The case of large characteristic fields.
J. Cryptogr. Eng., 2018

Computing supersingular isogenies on Kummer surfaces.
IACR Cryptol. ePrint Arch., 2018

2017
Jacobian Coordinates on Genus 2 Curves.
J. Cryptol., 2017

A simple and compact algorithm for SIDH with arbitrary degree isogenies.
IACR Cryptol. ePrint Arch., 2017

Montgomery curves and their arithmetic.
CoRR, 2017

2016
Fast Cryptography in Genus 2.
J. Cryptol., 2016

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

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

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

Fast, uniform scalar multiplication for genus 2 Jacobians with fast Kummers.
IACR Cryptol. ePrint Arch., 2016

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

2015
Complete addition formulas for prime order elliptic curves.
IACR Cryptol. ePrint Arch., 2015

FourQ: four-dimensional decompositions on a Q-curve over the Mersenne prime.
IACR Cryptol. ePrint Arch., 2015

Fast, uniform, and compact scalar multiplication for elliptic curves and genus 2 Jacobians with applications to signature schemes.
IACR Cryptol. ePrint Arch., 2015

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

2014
Constructing abelian surfaces for cryptography via Rosenhain invariants.
LMS J. Comput. Math., 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

2013
Faster Compact Diffie-Hellman: Endomorphisms on the x-line.
IACR Cryptol. ePrint Arch., 2013

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

Elliptic and Hyperelliptic Curves: a Practical Security Analysis.
IACR Cryptol. ePrint Arch., 2013

High-Performance Scalar Multiplication using 8-Dimensional GLV/GLS Decomposition.
IACR Cryptol. ePrint Arch., 2013

2012
Particularly Friendly Members of Family Trees.
IACR Cryptol. ePrint Arch., 2012

Two is Greater than One.
IACR Cryptol. ePrint Arch., 2012

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

Group Law Computations on Jacobians of Hyperelliptic Curves.
IACR Cryptol. ePrint Arch., 2011

2010
Fixed Argument Pairings.
IACR Cryptol. ePrint Arch., 2010

Delaying Mismatched Field Multiplications in Pairing Computations.
IACR Cryptol. ePrint Arch., 2010

Avoiding Full Extension Field Arithmetic in Pairing Computations.
IACR Cryptol. ePrint Arch., 2010

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

Faster Pairings on Special Weierstrass Curves.
IACR Cryptol. ePrint Arch., 2009


  Loading...