Pages that link to "Item:Q2430985"

The following pages link to Faster computation of the Tate pairing (Q2430985):

Displaying 21 items.

• Compression for trace zero points on twisted Edwards curves (Q269104) (← links)
• Further refinements of Miller's algorithm on Edwards curves (Q300877) (← links)
• The pairing computation on Edwards curves (Q460158) (← links)
• A generalisation of Miller's algorithm and applications to pairing computations on abelian varieties (Q741253) (← links)
• Identity-based undetachable digital signature for mobile agents in electronic commerce (Q1626229) (← links)
• Parallelizing pairings on Hessian elliptic curves (Q1713870) (← links)
• An optimal Tate pairing computation using Jacobi quartic elliptic curves (Q1752615) (← links)
• A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level (Q2055706) (← links)
• A complete set of addition laws for incomplete Edwards curves (Q2430986) (← links)
• On the near prime-order MNT curves (Q2631924) (← links)
• Deterministic Encoding into Twisted Edwards Curves (Q2817819) (← links)
• Twisted Hessian Curves (Q2946454) (← links)
• Improved Sieving on Algebraic Curves (Q2946455) (← links)
• On Near Prime-Order Elliptic Curves with Small Embedding Degrees (Q2947154) (← links)
• An Analysis of Affine Coordinates for Pairing Computation (Q3059636) (← links)
• Efficient Pairing Computation on Ordinary Elliptic Curves of Embedding Degree 1 and 2 (Q3104703) (← links)
• Pairing Computation on Edwards Curves with High-Degree Twists (Q3454153) (← links)
• Efficient Self-pairing on Ordinary Elliptic Curves (Q4922135) (← links)
• Elliptic curves in Huff’s model (Q4926885) (← links)
• Huff’s Model for Elliptic Curves (Q4931652) (← links)
• Formal Proof of the Group Law for Edwards Elliptic Curves (Q5049006) (← links)