A comparison of MNT curves and supersingular curves
From MaRDI portal
Publication:862563
DOI10.1007/s00200-006-0017-6zbMath1134.94377OpenAlexW2112842125MaRDI QIDQ862563
Frederik Vercauteren, Nigel P. Smart, 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
Data encryption (aspects in computer science) (68P25) Applications to coding theory and cryptography of arithmetic geometry (14G50) Authentication, digital signatures and secret sharing (94A62)
Related Items
On the near prime-order MNT curves ⋮ Multi-use and unidirectional identity-based proxy re-encryption schemes ⋮ Subgroup Security in Pairing-Based Cryptography ⋮ On Near Prime-Order Elliptic Curves with Small Embedding Degrees ⋮ KCI-resilient anonymous wireless link-layer authentication protocols ⋮ On Prime-Order Elliptic Curves with Embedding Degrees k = 3, 4, and 6 ⋮ A CDH-Based Strongly Unforgeable Signature Without Collision Resistant Hash Function ⋮ A survey on functional encryption ⋮ A taxonomy of pairing-friendly elliptic curves ⋮ Efficient hybrid encryption from ID-based encryption ⋮ Faster Implementation of η T Pairing over GF(3 m ) Using Minimum Number of Logical Instructions for GF(3)-Addition ⋮ Ramanujan's class invariants and their use in elliptic curve cryptography ⋮ Practical Short Signature Batch Verification
Cites Work
- Generating more MNT elliptic curves
- Software Implementation of Finite Fields of Characteristic Three, for Use in Pairing-based Cryptosystems
- Using number fields to compute logarithms in finite fields
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Pairing-Friendly Elliptic Curves of Prime Order
- Algorithmic Number Theory
- Escrow-free encryption supporting cryptographic workflow
- Selected Areas in Cryptography
- Advances in Cryptology - ASIACRYPT 2003
- Oblivious signature-based envelope
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item