A comparison of MNT curves and supersingular curves

Authors:
D. Page;N. P. Smart;F. Vercauteren
Affiliations:
Department of Computer Science, University of Bristol, Merchant Venturers Building, Woodland Road, BS8 1UB, Bristol, UK;Department of Computer Science, University of Bristol, Merchant Venturers Building, Woodland Road, BS8 1UB, Bristol, UK;Department of Electrical Engineering, University of Leuven, Kasteelpark Arenberg 10, 3001, Leuven-Heverlee, Belgium
Venue:
Applicable Algebra in Engineering, Communication and Computing
Year:
2006

Citing 0
Cited 16

Improved certificate-based encryption in the standard model

Journal of Systems and Software
Faster Implementation of ηTPairing over GF(3m) Using Minimum Number of Logical Instructions for GF(3)-Addition

Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
Trust management for secure information flows

Proceedings of the 15th ACM conference on Computer and communications security
Strongly-Resilient and Non-interactive Hierarchical Key-Agreement in MANETs

ESORICS '08 Proceedings of the 13th European Symposium on Research in Computer Security: Computer Security
Efficient Implementation of the Pairing on Mobilephones Using BREW

IEICE - Transactions on Information and Systems
A Strongly Unforgeable Signature under the CDH Assumption without Collision Resistant Hash Functions

IEICE - Transactions on Information and Systems
Practical Short Signature Batch Verification

CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
Ramanujan's class invariants and their use in elliptic curve cryptography

Computers & Mathematics with Applications
A CDH-based strongly unforgeable signature without collision resistant hash function

ProvSec'07 Proceedings of the 1st international conference on Provable security
On prime-order elliptic curves with embedding degrees k = 3, 4, and 6

ANTS-VIII'08 Proceedings of the 8th international conference on Algorithmic number theory
Multi-use and unidirectional identity-based proxy re-encryption schemes

Information Sciences: an International Journal
SPEcTRe: spot-checked private ecash tolling at roadside

Proceedings of the 10th annual ACM workshop on Privacy in the electronic society
Solving a 676-bit discrete logarithm problem in GF(36n)

PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Non-interactive and re-usable universally composable string commitments with adaptive security

ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Key length estimation of pairing-based cryptosystems using ηT pairing

ISPEC'12 Proceedings of the 8th international conference on Information Security Practice and Experience
Using SMT solvers to automate design tasks for encryption and signature schemes

Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security

Quantified Score

Hi-index	0.00

Visualization

Abstract

We compare both the security and performance issues related to the choice of MNT curves against supersingular curves in characteristic three, for pairing based systems. We pay particular attention to equating the relevant security levels and comparing not only computational performance and bandwidth performance. The paper focuses on the BLS signature scheme and the Boneh–Franklin encryption scheme, but a similar analysis can be applied to many other pairing based schemes.