Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

DCC
2006
IEEE

favoriteEmaildiscussreport

134views Computer Graphics» more DCC 2006»

Generating More MNT Elliptic Curves

14 years 3 months ago

Generating More MNT Elliptic Curves

Download eprint.iacr.org

In their seminal paper, Miyaji, Nakabayashi and Takano [12] describe a simple method for the creation of elliptic curves of prime order with embedding degree 3, 4, or 6. Such curves are important for the realisation of pairing-based cryptosystems on ordinary (non-supersingular) elliptic curves. We provide an alternative derivation of their results, and extend them to allow for the generation of many more suitable curves.

Michael Scott, Paulo S. L. M. Barreto

Real-time Traffic

Computer Graphics | DCC 2006 | Elliptic Curves | Such Curves | Suitable Curves |

claim paper

Related Content

» On PrimeOrder Elliptic Curves with Embedding Degrees k 3 4 and 6

» An MSS Based on the Elliptic Curve Cryptosystem

» A note on the Ate pairing

» A compact FPGAbased architecture for elliptic curve cryptography over prime fields

» Parallel calculation of volcanoes for cryptographic uses

» On the Performance of Hyperelliptic Cryptosystems

» PrivacyPreserving ECCBased Grouping Proofs for RFID

» Enhancing COPACOBANA for advanced applications in cryptography and cryptanalysis

» Primality Proving via One Round in ECPP and One Iteration in AKS

Post Info
More Details (n/a)

Added	25 Dec 2009
Updated	25 Dec 2009
Type	Conference
Year	2006
Where	DCC
Authors	Michael Scott, Paulo S. L. M. Barreto

Comments (0)