default search action
Hüseyin Hisil
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j6]Elif Ozbay Gurler
, Hüseyin Hisil:
Complete group law for genus 2 Jacobians on Jacobian coordinates. J. Cryptogr. Eng. 14(1): 87-101 (2024) - [i13]Elif Ozbay Gurler, Hüseyin Hisil:
Complete group law for genus 2 Jacobians on Jacobian coordinates. IACR Cryptol. ePrint Arch. 2024: 623 (2024) - 2020
- [i12]Hüseyin Hisil, Berkan Egrice, Mert Yassi:
Fast 4 way vectorized ladder for the complete set of Montgomery curves. IACR Cryptol. ePrint Arch. 2020: 388 (2020)
2010 – 2019
- 2019
- [j5]Hüseyin Hisil, Joost Renes:
On Kummer Lines with Full Rational 2-torsion and Their Usage in Cryptography. ACM Trans. Math. Softw. 45(4): 39:1-39:17 (2019) - 2018
- [j4]Neriman Gamze Orhon, Hüseyin Hisil:
Speeding up Huff form of elliptic curves. Des. Codes Cryptogr. 86(12): 2807-2823 (2018) - [c13]Hüseyin Hisil, Aaron Hutchinson, Koray Karabina:
d-MUL: Optimizing and Implementing a Multidimensional Scalar Multiplication Algorithm over Elliptic Curves. SPACE 2018: 198-217 - [i11]Hüseyin Hisil, Joost Renes:
On Kummer Lines With Full Rational 2-torsion and Their Usage in Cryptography. IACR Cryptol. ePrint Arch. 2018: 839 (2018) - 2017
- [j3]Hüseyin Hisil
Jacobian Coordinates on Genus 2 Curves. J. Cryptol. 30(2): 572-600 (2017) - [c12]Craig Costello
A Simple and Compact Algorithm for SIDH with Arbitrary Degree Isogenies. ASIACRYPT (2) 2017: 303-329 - [c11]Thomaz Oliveira, Julio López, Hüseyin Hisil, Armando Faz-Hernández
How to (Pre-)Compute a Ladder - Improving the Performance of X25519 and X448. SAC 2017: 172-191 - [i10]Neriman Gamze Orhon, Hüseyin Hisil:
Speeding up Huff Form of Elliptic Curves. IACR Cryptol. ePrint Arch. 2017: 320 (2017) - [i9]Craig Costello, Hüseyin Hisil:
A simple and compact algorithm for SIDH with arbitrary degree isogenies. IACR Cryptol. ePrint Arch. 2017: 504 (2017) - 2016
- [j2]Joppe W. Bos, Craig Costello
Fast Cryptography in Genus 2. J. Cryptol. 29(1): 28-60 (2016) - 2015
- [e1]Ali A. Ghorbani, Vicenç Torra, Hüseyin Hisil, Ali Miri, Ahmet Koltuksuz, Jie Zhang, Murat Sensoy, Joaquín García-Alfaro, Ibrahim Zincir:
13th Annual Conference on Privacy, Security and Trust, PST 2015, Izmir, Turkey, July 21-23, 2015. IEEE Computer Society 2015, ISBN 978-1-4673-7828-4 [contents] - 2014
- [c10]Hüseyin Hisil, Craig Costello
Jacobian Coordinates on Genus 2 Curves. ASIACRYPT (1) 2014: 338-357 - [c9]Craig Costello
Faster Compact Diffie-Hellman: Endomorphisms on the x-line. EUROCRYPT 2014: 183-200 - [i8]Hüseyin Hisil, Craig Costello:
Jacobian Coordinates on Genus 2 Curves. IACR Cryptol. ePrint Arch. 2014: 385 (2014) - 2013
- [c8]Joppe W. Bos, Craig Costello
High-Performance Scalar Multiplication Using 8-Dimensional GLV/GLS Decomposition. CHES 2013: 331-348 - [c7]Joppe W. Bos, Craig Costello
Fast Cryptography in Genus 2. EUROCRYPT 2013: 194-210 - [i7]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) - [i6]Craig Costello, Hüseyin Hisil, Benjamin Smith:
Faster Compact Diffie-Hellman: Endomorphisms on the x-line. IACR Cryptol. ePrint Arch. 2013: 692 (2013) - 2012
- [i5]Joppe W. Bos, Craig Costello, Hüseyin Hisil, Kristin E. Lauter:
Two is Greater than One. IACR Cryptol. ePrint Arch. 2012: 670 (2012) - 2011
- [j1]Hüseyin Hisil, Kenneth Koon-Ho Wong
An exploration of affine group laws for elliptic curves. J. Math. Cryptol. 5(1): 1-50 (2011) - 2010
- [b1]Hüseyin Hisil:
Elliptic curves, group law, and efficient computation (Eliptik eğriler, grup kural ve verimli hesaplama). Queensland Teknoloji University (QUT Gardens Point Campus), Turkey, 2010
2000 – 2009
- 2009
- [c6]Hüseyin Hisil, Kenneth Koon-Ho Wong
Jacobi Quartic Curves Revisited. ACISP 2009: 452-468 - [c5]Hüseyin Hisil, Kenneth Koon-Ho Wong, Gary Carter, Ed Dawson:
Faster Group Operations on Elliptic Curves. AISC 2009: 7-19 - [c4]Craig Costello
Faster Pairings on Special Weierstrass Curves. Pairing 2009: 89-101 - [i4]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) - [i3]Hüseyin Hisil, Kenneth Koon-Ho Wong, Gary Carter, Ed Dawson:
Jacobi Quartic Curves Revisited. IACR Cryptol. ePrint Arch. 2009: 312 (2009) - 2008
- [c3]Hüseyin Hisil, Kenneth Koon-Ho Wong
Twisted Edwards Curves Revisited. ASIACRYPT 2008: 326-343 - [i2]Hüseyin Hisil, Kenneth Koon-Ho Wong, Gary Carter, Ed Dawson:
Twisted Edwards Curves Revisited. IACR Cryptol. ePrint Arch. 2008: 522 (2008) - 2007
- [c2]Hüseyin Hisil, Gary Carter, Ed Dawson:
New Formulae for Efficient Elliptic Curve Arithmetic. INDOCRYPT 2007: 138-151 - [i1]Hüseyin Hisil, Kenneth Koon-Ho Wong, Gary Carter, Ed Dawson:
Faster Group Operations on Elliptic Curves. IACR Cryptol. ePrint Arch. 2007: 441 (2007) - 2005
- [c1]Ahmet Koltuksuz, Hüseyin Hisil:
Crympix: Cryptographic Multiprecision Library. ISCIS 2005: 884-893
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-10-07 22:18 CEST 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: