1 |
D. Page and N. Smart "Hardware Implementation of Finite Fields of Characteristic Three," CHES 2002, LNCS 2523, pp.529-539, Springer- Verlag, 2003
|
2 |
P.S.L.M. Barreto, H.Y. Kim, B. Lynn, and M. Scott, "Efficient algorithms for pairing-based cryptosystems," CRYPTO 2002, LNCS 2442, pp.354-368, Springer-Verlag, 2002
|
3 |
T. Kerins, W. Marnane, E. Popovici, P. S. L. M. Barreto "Efficient Hardware for the Tate Pairing Calculation in Characteristic Three," CHES 2005, LNCS 3659, pp.398-411, Springer-Verlag, 2005
|
4 |
S. D. Galbraith, "Supersingular Curves in Cryptography", ASIACRYPT 2001, LNCS 2248, pp. 495-513, Springer-Verlag, 2001
|
5 |
Koblitz. N, "An Elliptic Curve Implementation of the Finite Field Digital Signature Algorithm", CRYPTO 1998, LNCS 3574, pp. 327-337, Springer-Verlag, 1998
|
6 |
G. Bertoni, J. Guajardo, S. Kumar, G. Orlando C. Paar and T. Wollinger. "Efficient GF( ) Arithmetic Architectures for Cryptographic Applications," CT-RSA 2003, LNCS 2612, pp.158-175. Springer-Verlag, 2003
|
7 |
J. Beuchat, M. Shirase, T. Takagi, E. Okamoto, "An Algorithm for the Eta_T Pairing Calculation in Characteristic Three and its Hardware Implementation", 18th IEEE International Symposium on Computer Arithmetic, ARITH-18, pp.97-104, 2007
|
8 |
P. Grabher and D. Page, "Hardware Acceleration of the Tate Pairing in Characteristic Three," CHES 2005, LNCS 3659, pp.398-411, Springer- Verlag, 2005
|
9 |
S. Kwon, "Efficient Tate pairing computation for elliptic curves over binary fields," ACISP 2005, LNCS 3574, pp.134-145, Springer-Verlag, 2005
|