default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCraig Costello
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c33]Maria Corte-Real Santos, Craig Costello, Michael Naehrig:
On Cycles of Pairing-Friendly Abelian Varieties. CRYPTO (9) 2024: 221-253- [c32]Maria Corte-Real Santos
, Craig Costello, Sam Frengley:
An Algorithm for Efficient Detection of (N, N)-Splittings and Its Application to the Isogeny Problem in Dimension 2. Public Key Cryptography (3) 2024: 157-189 - [i45]Maria Corte-Real Santos, Craig Costello, Benjamin Smith:
Efficient (3, 3)-isogenies on fast Kummer surfaces. CoRR abs/2402.01223 (2024) - [i44]Maria Corte-Real Santos, Craig Costello, Benjamin Smith:
Efficient (3,3)-isogenies on fast Kummer surfaces. IACR Cryptol. ePrint Arch. 2024: 144 (2024) - [i43]Maria Corte-Real Santos, Craig Costello, Michael Naehrig:
On cycles of pairing-friendly abelian varieties. IACR Cryptol. ePrint Arch. 2024: 869 (2024) - [i42]Craig Costello, Gaurish Korpal:
Lollipops of pairing-friendly elliptic curves for composition of proof systems. IACR Cryptol. ePrint Arch. 2024: 1627 (2024) - 2023
- [c31]Giacomo Bruno, Maria Corte-Real Santos, Craig Costello, Jonathan Komada Eriksen, Michael Meyer, Michael Naehrig, Bruno Sterner:
Cryptographic Smooth Neighbors. ASIACRYPT (7) 2023: 190-221 - 2022
- [c30]Maria Corte-Real Santos, Craig Costello, Jia Shi:
Accelerating the Delfs-Galbraith Algorithm with Fast Subfield Root Detection. CRYPTO (3) 2022: 285-314 - [i41]Giacomo Bruno, Maria Corte-Real Santos, Craig Costello, Jonathan Komada Eriksen, Michael Naehrig, Michael Meyer, Bruno Sterner:
Cryptographic Smooth Neighbors. IACR Cryptol. ePrint Arch. 2022: 1439 (2022) - [i40]Maria Corte-Real Santos, Craig Costello, Sam Frengley:
An algorithm for efficient detection of (N, N)-splittings and its application to the isogeny problem in dimension 2. IACR Cryptol. ePrint Arch. 2022: 1736 (2022) - 2021
- [c29]Craig Costello, Michael Meyer, Michael Naehrig:
Sieving for Twin Smooth Integers with Solutions to the Prouhet-Tarry-Escott Problem. EUROCRYPT (1) 2021: 272-301 - [i39]Craig Costello:
The Case for SIKE: A Decade of the Supersingular Isogeny Problem. IACR Cryptol. ePrint Arch. 2021: 543 (2021) - [i38]Maria Corte-Real Santos, Craig Costello, Jia Shi:
SuperSolver: accelerating the Delfs-Galbraith algorithm with fast subfield root detection. IACR Cryptol. ePrint Arch. 2021: 1488 (2021) - 2020
- [c28]Craig Costello:
B-SIDH: Supersingular Isogeny Diffie-Hellman Using Twisted Torsion. ASIACRYPT (2) 2020: 440-463 - [c27]Craig Costello, Patrick Longa, Michael Naehrig, Joost Renes, Fernando Virdia:
Improved Classical Cryptanalysis of SIKE in Practice. Public Key Cryptography (2) 2020: 505-534 - [c26]Craig Costello, Benjamin Smith:
The Supersingular Isogeny Problem in Genus 2 and Beyond. PQCrypto 2020: 151-168 - [i37]Craig Costello, Michael Meyer, Michael Naehrig:
Sieving for twin smooth integers with solutions to the Prouhet-Tarry-Escott problem. IACR Cryptol. ePrint Arch. 2020: 1283 (2020)
2010 – 2019
- 2019
- [c25]Craig Costello:
Supersingular Isogeny Key Exchange for Beginners. SAC 2019: 21-50 - [i36]Craig Costello, Benjamin Smith:
The supersingular isogeny problem in genus 2 and beyond. CoRR abs/1912.00701 (2019) - [i35]Craig Costello, Patrick Longa, Michael Naehrig, Joost Renes, Fernando Virdia:
Improved Classical Cryptanalysis of the Computational Supersingular Isogeny Problem. IACR Cryptol. ePrint Arch. 2019: 298 (2019) - [i34]Craig Costello:
B-SIDH: supersingular isogeny Diffie-Hellman using twisted torsion. IACR Cryptol. ePrint Arch. 2019: 1145 (2019) - [i33]Craig Costello:
Supersingular isogeny key exchange for beginners. IACR Cryptol. ePrint Arch. 2019: 1321 (2019) - [i32]Craig Costello, Benjamin Smith:
The supersingular isogeny problem in genus 2 and beyond. IACR Cryptol. ePrint Arch. 2019: 1387 (2019) - 2018
- [j5]Craig Costello, Benjamin Smith:
Montgomery curves and their arithmetic - The case of large characteristic fields. J. Cryptogr. Eng. 8(3): 227-240 (2018) - [c24]Craig Costello:
Computing Supersingular Isogenies on Kummer Surfaces. ASIACRYPT (3) 2018: 428-456 - [i31]Craig Costello:
Computing supersingular isogenies on Kummer surfaces. IACR Cryptol. ePrint Arch. 2018: 850 (2018) - 2017
- [j4]Hüseyin Hisil, Craig Costello:
Jacobian Coordinates on Genus 2 Curves. J. Cryptol. 30(2): 572-600 (2017) - [c23]Craig Costello, Hüseyin Hisil:
A Simple and Compact Algorithm for SIDH with Arbitrary Degree Isogenies. ASIACRYPT (2) 2017: 303-329 - [c22]Craig Costello, David Jao, Patrick Longa, Michael Naehrig, Joost Renes, David Urbanik:
Efficient Compression of SIDH Public Keys. EUROCRYPT (1) 2017: 679-706 - [i30]Craig Costello, Benjamin Smith:
Montgomery curves and their arithmetic. CoRR abs/1703.01863 (2017) - [i29]Craig Costello, Benjamin Smith:
Montgomery curves and their arithmetic: The case of large characteristic fields. IACR Cryptol. ePrint Arch. 2017: 212 (2017) - [i28]Craig Costello, Hüseyin Hisil:
A simple and compact algorithm for SIDH with arbitrary degree isogenies. IACR Cryptol. ePrint Arch. 2017: 504 (2017) - 2016
- [j3]Joppe W. Bos, Craig Costello, Patrick Longa, Michael Naehrig:
Selecting elliptic curves for cryptography: an efficiency and security analysis. J. Cryptogr. Eng. 6(4): 259-286 (2016) - [j2]Joppe W. Bos, Craig Costello, Hüseyin Hisil, Kristin E. Lauter:
Fast Cryptography in Genus 2. J. Cryptol. 29(1): 28-60 (2016) - [c21]Joppe W. Bos, Craig Costello, Léo Ducas, Ilya Mironov, Michael Naehrig, Valeria Nikolaenko, Ananth Raghunathan, Douglas Stebila:
Frodo: Take off the Ring! Practical, Quantum-Secure Key Exchange from LWE. CCS 2016: 1006-1018 - [c20]Craig Costello, Patrick Longa, Michael Naehrig:
Efficient Algorithms for Supersingular Isogeny Diffie-Hellman. CRYPTO (1) 2016: 572-601 - [c19]Joost Renes, Craig Costello, Lejla Batina:
Complete Addition Formulas for Prime Order Elliptic Curves. EUROCRYPT (1) 2016: 403-428 - [c18]Ping Ngai Chung, Craig Costello, Benjamin Smith:
Fast, Uniform Scalar Multiplication for Genus 2 Jacobians with Fast Kummers. SAC 2016: 465-481 - [i27]Craig Costello, Patrick Longa, Michael Naehrig:
Efficient algorithms for supersingular isogeny Diffie-Hellman. IACR Cryptol. ePrint Arch. 2016: 413 (2016) - [i26]Joppe W. Bos, Craig Costello, Léo Ducas, Ilya Mironov, Michael Naehrig, Valeria Nikolaenko, Ananth Raghunathan, Douglas Stebila:
Frodo: Take off the ring! Practical, Quantum-Secure Key Exchange from LWE. IACR Cryptol. ePrint Arch. 2016: 659 (2016) - [i25]Ping Ngai Chung, Craig Costello, Benjamin Smith:
Fast, uniform scalar multiplication for genus 2 Jacobians with fast Kummers. IACR Cryptol. ePrint Arch. 2016: 777 (2016) - [i24]Craig Costello, David Jao, Patrick Longa, Michael Naehrig, Joost Renes, David Urbanik:
Efficient compression of SIDH public keys. IACR Cryptol. ePrint Arch. 2016: 963 (2016) - 2015
- [c17]Craig Costello, Patrick Longa:
Fourℚ: Four-Dimensional Decompositions on a ℚ-curve over the Mersenne Prime. ASIACRYPT (1) 2015: 214-235 - [c16]Paulo S. L. M. Barreto, Craig Costello, Rafael Misoczki, Michael Naehrig, Geovandro C. C. F. Pereira, Gustavo H. M. Zanon:
Subgroup Security in Pairing-Based Cryptography. LATINCRYPT 2015: 245-265 - [c15]Craig Costello, Cédric Fournet, Jon Howell, Markulf Kohlweiss, Benjamin Kreuter, Michael Naehrig, Bryan Parno, Samee Zahur:
Geppetto: Versatile Verifiable Computation. IEEE Symposium on Security and Privacy 2015: 253-270 - [c14]Joppe W. Bos, Craig Costello, Michael Naehrig, Douglas Stebila:
Post-Quantum Key Exchange for the TLS Protocol from the Ring Learning with Errors Problem. IEEE Symposium on Security and Privacy 2015: 553-570 - [i23]Ping Ngai Chung, Craig Costello, Benjamin Smith:
Fast, uniform, and compact scalar multiplication for elliptic curves and genus 2 Jacobians with applications to signature schemes. CoRR abs/1510.03174 (2015) - [i22]Paulo S. L. M. Barreto, Craig Costello, Rafael Misoczki, Michael Naehrig, C. C. F. Pereira Geovandro, Gustavo H. M. Zanon:
Subgroup security in pairing-based cryptography. IACR Cryptol. ePrint Arch. 2015: 247 (2015) - [i21]Craig Costello, Patrick Longa:
FourQ: four-dimensional decompositions on a Q-curve over the Mersenne prime. IACR Cryptol. ePrint Arch. 2015: 565 (2015) - [i20]Ping Ngai Chung, Craig Costello, Benjamin Smith:
Fast, uniform, and compact scalar multiplication for elliptic curves and genus 2 Jacobians with applications to signature schemes. IACR Cryptol. ePrint Arch. 2015: 983 (2015) - [i19]Joost Renes, Craig Costello, Lejla Batina:
Complete addition formulas for prime order elliptic curves. IACR Cryptol. ePrint Arch. 2015: 1060 (2015) - 2014
- [j1]Craig Costello, Alyson Deines-Schartz, Kristin E. Lauter, Tonghai Yang:
Constructing abelian surfaces for cryptography via Rosenhain invariants. LMS J. Comput. Math. 17(Theory): 157-180 (2014) - [c13]Hüseyin Hisil, Craig Costello:
Jacobian Coordinates on Genus 2 Curves. ASIACRYPT (1) 2014: 338-357 - [c12]Craig Costello, Hüseyin Hisil, Benjamin Smith:
Faster Compact Diffie-Hellman: Endomorphisms on the x-line. EUROCRYPT 2014: 183-200 - [c11]Joppe W. Bos, Craig Costello, Andrea Miele:
Elliptic and Hyperelliptic Curves: A Practical Security Analysis. Public Key Cryptography 2014: 203-220 - [i18]Joppe W. Bos, Craig Costello, Patrick Longa, Michael Naehrig:
Selecting Elliptic Curves for Cryptography: An Efficiency and Security Analysis. IACR Cryptol. ePrint Arch. 2014: 130 (2014) - [i17]Hüseyin Hisil, Craig Costello:
Jacobian Coordinates on Genus 2 Curves. IACR Cryptol. ePrint Arch. 2014: 385 (2014) - [i16]Craig Costello, Alyson Deines-Schartz, Kristin E. Lauter, Tonghai Yang:
Constructing Abelian Surfaces for Cryptography via Rosenhain Invariants. IACR Cryptol. ePrint Arch. 2014: 424 (2014) - [i15]Joppe W. Bos, Craig Costello, Michael Naehrig, Douglas Stebila:
Post-quantum key exchange for the TLS protocol from the ring learning with errors problem. IACR Cryptol. ePrint Arch. 2014: 599 (2014) - [i14]Craig Costello, Cédric Fournet, Jon Howell, Markulf Kohlweiss, Benjamin Kreuter, Michael Naehrig, Bryan Parno, Samee Zahur:
Geppetto: Versatile Verifiable Computation. IACR Cryptol. ePrint Arch. 2014: 976 (2014) - 2013
- [c10]Joppe W. Bos, Craig Costello, Hüseyin Hisil, Kristin E. Lauter:
High-Performance Scalar Multiplication Using 8-Dimensional GLV/GLS Decomposition. CHES 2013: 331-348 - [c9]Joppe W. Bos, Craig Costello, Hüseyin Hisil, Kristin E. Lauter:
Fast Cryptography in Genus 2. EUROCRYPT 2013: 194-210 - [c8]Joppe W. Bos, Craig Costello, Michael Naehrig:
Exponentiating in Pairing Groups. Selected Areas in Cryptography 2013: 438-455 - [i13]Joppe W. Bos, Craig Costello, Hüseyin Hisil, Kristin E. Lauter:
High-Performance Scalar Multiplication using 8-Dimensional GLV/GLS Decomposition. IACR Cryptol. ePrint Arch. 2013: 146 (2013) - [i12]Joppe W. Bos, Craig Costello, Michael Naehrig:
Exponentiating in Pairing Groups. IACR Cryptol. ePrint Arch. 2013: 458 (2013) - [i11]Joppe W. Bos, Craig Costello, Andrea Miele:
Elliptic and Hyperelliptic Curves: a Practical Security Analysis. IACR Cryptol. ePrint Arch. 2013: 644 (2013) - [i10]Craig Costello, Hüseyin Hisil, Benjamin Smith:
Faster Compact Diffie-Hellman: Endomorphisms on the x-line. IACR Cryptol. ePrint Arch. 2013: 692 (2013) - 2012
- [i9]Craig Costello:
Particularly Friendly Members of Family Trees. IACR Cryptol. ePrint Arch. 2012: 72 (2012) - [i8]Joppe W. Bos, Craig Costello, Hüseyin Hisil, Kristin E. Lauter:
Two is Greater than One. IACR Cryptol. ePrint Arch. 2012: 670 (2012) - 2011
- [c7]Craig Costello, Kristin E. Lauter, Michael Naehrig:
Attractive Subfamilies of BLS Curves for Implementing High-Security Pairings. INDOCRYPT 2011: 320-342 - [c6]Craig Costello, Kristin E. Lauter:
Group Law Computations on Jacobians of Hyperelliptic Curves. Selected Areas in Cryptography 2011: 92-117 - [i7]Craig Costello, Kristin E. Lauter:
Group Law Computations on Jacobians of Hyperelliptic Curves. IACR Cryptol. ePrint Arch. 2011: 306 (2011) - [i6]Craig Costello, Kristin E. Lauter, Michael Naehrig:
Attractive Subfamilies of BLS Curves for Implementing High-Security Pairings. IACR Cryptol. ePrint Arch. 2011: 465 (2011) - 2010
- [c5]Craig Costello, Colin Boyd, Juan Manuel González Nieto, Kenneth Koon-Ho Wong:
Avoiding Full Extension Field Arithmetic in Pairing Computations. AFRICACRYPT 2010: 203-224 - [c4]Craig Costello, Douglas Stebila:
Fixed Argument Pairings. LATINCRYPT 2010: 92-108 - [c3]Craig Costello, Tanja Lange, Michael Naehrig:
Faster Pairing Computations on Curves with High-Degree Twists. Public Key Cryptography 2010: 224-242 - [c2]Craig Costello, Colin Boyd, Juan Manuel González Nieto, Kenneth Koon-Ho Wong:
Delaying Mismatched Field Multiplications in Pairing Computations. WAIFI 2010: 196-214 - [i5]Craig Costello, Colin Boyd, Juan Manuel González Nieto, Kenneth Koon-Ho Wong:
Avoiding Full Extension Field Arithmetic in Pairing Computations. IACR Cryptol. ePrint Arch. 2010: 104 (2010) - [i4]Craig Costello, Colin Boyd, Juan Manuel González Nieto, Kenneth Koon-Ho Wong:
Delaying Mismatched Field Multiplications in Pairing Computations. IACR Cryptol. ePrint Arch. 2010: 123 (2010) - [i3]Craig Costello, Douglas Stebila:
Fixed Argument Pairings. IACR Cryptol. ePrint Arch. 2010: 342 (2010)
2000 – 2009
- 2009
- [c1]Craig Costello, Hüseyin Hisil, Colin Boyd, Juan Manuel González Nieto, Kenneth Koon-Ho Wong:
Faster Pairings on Special Weierstrass Curves. Pairing 2009: 89-101 - [i2]Craig Costello, Hüseyin Hisil, Colin Boyd, Juan Manuel González Nieto, Kenneth Koon-Ho Wong:
Faster Pairings on Special Weierstrass Curves. IACR Cryptol. ePrint Arch. 2009: 243 (2009) - [i1]Craig Costello, Tanja Lange, Michael Naehrig:
Faster Pairing Computations on Curves with High-Degree Twists. IACR Cryptol. ePrint Arch. 2009: 615 (2009)
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-11-11 22:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
