Back to Results
First PageMeta Content
Mathematics / Supersingular elliptic curve / Hyperelliptic curve cryptography / Curve / Hessian form of an elliptic curve / Classical modular curve / Abstract algebra / Elliptic curves / Cryptography


Fast hashing to G2 on pairing friendly curves Michael Scott, Naomi Benger, Manuel Charlemagne, Luis J. Dominguez Perez, and Ezekiel J. Kachisa School of Computing Dublin City University Ballymun, Dublin 9, Ireland.
Add to Reading List

Document Date: 2008-12-18 11:36:28

Open Document

File Size: 171,23 KB

Share Result on Facebook

Company

G2 / G1 / /

Currency

pence / /

/

Facility

Claude Shannon Institute / /

IndustryTerm

cofactor multiplication algorithm / simultaneous multiple point multiplication algorithm / isomorphic / mike@computing.dcu.ie / /

Organization

Ezekiel J. Kachisa School of Computing Dublin City University Ballymun / Claude Shannon Institute / /

Person

Naomi Benger / Robert Granger / Michael Scott / Manuel Charlemagne / Galbraith / Luis J. Dominguez Perez / /

Position

Prime Minister / coset representative / /

PublishedMedium

the Freeman / Lecture Notes in Computer Science / /

Technology

identity-based protocols / cofactor multiplication algorithm / Cryptography / pairing algorithm / 5 Applying algorithm / point multiplication algorithm / 4 Algorithm / Olivos algorithm / /

SocialTag