Back to Results
First PageMeta Content
Mathematics / Cryptography / Group theory / Finite fields / Weil pairing / Elliptic curve / Pairing / Supersingular elliptic curve / Tate pairing / Abstract algebra / Elliptic curves / Algebra


Comparing Implementation Efficiency of Ordinary and Squared Pairings Christine Abegail Antonio1 , Satoru 2 and Ken Nakamula3 Department of Mathematics, Tokyo Metropolitan University Minami-Osawa, Hachioji-shi Tokyo, Japa
Add to Reading List

Document Date: 2007-12-07 19:51:10

Open Document

File Size: 166,45 KB

Share Result on Facebook

Company

AMD / Fqk / D0 / /

/

Event

Reorganization / /

IndustryTerm

deterministic algorithms / deterministic algorithm / polynomial time algorithm / basic algorithm / finite multiplicative / /

Organization

Ken Nakamula3 Department of Mathematics / /

Person

Christine Abegail / /

Position

mP / author / /

Product

tnt / /

Technology

deterministic algorithm / 7 Algorithm / cryptography / deterministic algorithms / DLP / polynomial time algorithm / six algorithms / 5 Algorithm / basic Miller algorithm / deterministic 6 algorithms / basic algorithm / 1 algorithm / /

SocialTag