Efficient Self-pairing on Ordinary Elliptic Curves
From MaRDI portal
Publication:4922135
DOI10.1007/978-3-642-38236-9_26zbMath1382.94169OpenAlexW1959162959MaRDI QIDQ4922135
Publication date: 28 May 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-38236-9_26
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Cites Work
- Unnamed Item
- Computing bilinear pairings on elliptic curves with automorphisms
- Pairings for cryptographers
- The Weil pairing, and its efficient calculation
- Faster computation of the Tate pairing
- A New Signature Scheme Without Random Oracles from Bilinear Pairings
- Faster Explicit Formulas for Computing Pairings over Ordinary Curves
- A Generalization of Verheul’s Theorem for Some Ordinary Curves
- Random Euclidean Addition Chain Generation and Its Application to Point Multiplication
- A Variant of Miller’s Formula and Algorithm
- The Eta Pairing Revisited
- Faster Pairing Computations on Curves with High-Degree Twists
- Pairing Lattices
- A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
- Efficient and Generalized Pairing Computation on Abelian Varieties
- Optimal Pairings
- Faster Computation of Self-Pairings
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- Progress in Cryptology - INDOCRYPT 2003
- Optimised Versions of the Ate and Twisted Ate Pairings
- Advances in Elliptic Curve Cryptography
- Cryptography and Coding
- Information Security and Cryptology
- Public Key Cryptography – PKC 2004
- Advances in Cryptology - ASIACRYPT 2003