A comparison of MNT curves and supersingular curves

DOI10.1007/S00200-006-0017-6MaRDI QIDQ862563zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 1643939 (Why is no real title available?)
• scientific article; zbMATH DE number 1689862 (Why is no real title available?)
• scientific article; zbMATH DE number 1942431 (Why is no real title available?)
• scientific article; zbMATH DE number 1950619 (Why is no real title available?)
• scientific article; zbMATH DE number 2081061 (Why is no real title available?)
• scientific article; zbMATH DE number 2081084 (Why is no real title available?)
• scientific article; zbMATH DE number 2086895 (Why is no real title available?)
• scientific article; zbMATH DE number 2086903 (Why is no real title available?)
• scientific article; zbMATH DE number 1842494 (Why is no real title available?)
• Advances in Cryptology - ASIACRYPT 2003
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• Algorithmic Number Theory
• Escrow-free encryption supporting cryptographic workflow
• Generating more MNT elliptic curves
• Oblivious signature-based envelope
• Pairing-Friendly Elliptic Curves of Prime Order
• Selected Areas in Cryptography
• Software Implementation of Finite Fields of Characteristic Three, for Use in Pairing-based Cryptosystems
• Using number fields to compute logarithms in finite fields

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 CDH-Based Strongly Unforgeable Signature Without Collision Resistant Hash Function
• A survey on functional encryption
• 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)