Further refinement of pairing computation based on Miller's algorithm
From MaRDI portal
Publication:2381335
DOI10.1016/j.amc.2006.11.135zbMath1145.94011OpenAlexW2010195730MaRDI QIDQ2381335
Gwoboa Horng, Te-Yu Chen, Chao-Liang Liu
Publication date: 17 September 2007
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2006.11.135
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Cites Work
- Elliptic curve cryptosystems and their implementation
- Identity-based authenticated key agreement protocol based on Weil pairing
- Reducing elliptic curve logarithms to logarithms in a finite field
- Advances in Cryptology – CRYPTO 2004
- Refinements of Miller's algorithm for computing the Weil/Tate pairing
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item