A comparison of MNT curves and supersingular curves

DOI10.1007/S00200-006-0017-6zbMATH Open1134.94377OpenAlexW2112842125MaRDI QIDQ862563FDOQ862563

Authors: N. P. Smart, Frederik Vercauteren, Dan Page 

Publication date: 24 January 2007

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://www.cosic.esat.kuleuven.be/publications/article-522.pdf

Recommendations

• Comparing two pairing-based aggregate signature schemes
• Faster and lower memory scalar multiplication on supersingular curves in characteristic three
• scientific article; zbMATH DE number 2081083
• Faster Pairings Using an Elliptic Curve with an Efficient Endomorphism
• Cryptography and Coding

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Applications to coding theory and cryptography of arithmetic geometry (14G50) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Pairing-Friendly Elliptic Curves of Prime Order
• Title not available (Why is that?)
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• Title not available (Why is that?)
• Advances in Cryptology - ASIACRYPT 2003
• Selected Areas in Cryptography
• Title not available (Why is that?)
• Title not available (Why is that?)
• Generating more MNT elliptic curves
• Title not available (Why is that?)
• Software Implementation of Finite Fields of Characteristic Three, for Use in Pairing-based Cryptosystems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Using number fields to compute logarithms in finite fields
• Algorithmic Number Theory
• Escrow-free encryption supporting cryptographic workflow
• Oblivious signature-based envelope

Cited In (13)

• Efficient hybrid encryption from ID-based encryption
• Multi-use and unidirectional identity-based proxy re-encryption schemes
• On near prime-order elliptic curves with small embedding degrees
• On Prime-Order Elliptic Curves with Embedding Degrees k = 3, 4, and 6
• Practical Short Signature Batch Verification
• Ramanujan's class invariants and their use in elliptic curve cryptography
• Subgroup security in pairing-based cryptography
• On the near prime-order MNT curves
• A survey on functional encryption
• A CDH-Based Strongly Unforgeable Signature Without Collision Resistant Hash Function
• A taxonomy of pairing-friendly elliptic curves
• KCI-resilient anonymous wireless link-layer authentication protocols
• Faster Implementation of η T Pairing over GF(3 m ) Using Minimum Number of Logical Instructions for GF(3)-Addition

This page was built for publication: A comparison of MNT curves and supersingular curves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q862563)