-
1
-
-
84968503742
-
Elliptic curve cryptosystems
-
N. Koblitz, Elliptic curve cryptosystems, Math. Comp., 48 (1987), 203-209.
-
(1987)
Math. Comp
, vol.48
, pp. 203-209
-
-
Koblitz, N.1
-
3
-
-
0020207091
-
Bit-serial Reed-Solomon encoder
-
Nov
-
E.R. Berlekamp, Bit-serial Reed-Solomon encoder, IEEE Trans. Information Theory, vol. IT-28, pp.869-874, Nov. 1982.
-
(1982)
IEEE Trans. Information Theory
, vol.28
, pp. 869-874
-
-
Berlekamp, E.R.1
-
4
-
-
0022108239
-
VLSI architecture for computing multiplications and inversions in GF(2m)
-
Aug
-
m), IEEE Trans. Comput., vol. C-34, pp.1230-1234, Aug. 1985.
-
(1985)
IEEE Trans. Comput
, vol.34
, pp. 1230-1234
-
-
Wang, C.C.1
Truong, T.K.2
Shao, H.M.3
Deutsch, L.J.4
Omura, J.K.5
Reed, I.S.6
-
7
-
-
0027614379
-
An implementation of elliptic curve cryptosystems over F2i55
-
June
-
2i55, IEEE Journal on Selected Areas in Communications, Vol.11, no.5(June 1993), pp.804-813.
-
(1993)
IEEE Journal on Selected Areas in Communications
, vol.11
, Issue.5
, pp. 804-813
-
-
Agnew, G.B.1
Mullin, R.C.2
Vanstone, S.A.3
-
8
-
-
0000753472
-
Low complexity normal bases
-
D.W. Ash, I.F. Blake, and S. Vanstone, Low complexity normal bases, Discrete Applied Math. 25(1989), pp.191-210.
-
(1989)
Discrete Applied Math
, vol.25
, pp. 191-210
-
-
Ash, D.W.1
Blake, I.F.2
Vanstone, S.3
-
9
-
-
0000827611
-
A fast algorithm for computing multiplicative inverses in GF (2m) using normal bases
-
m) using normal bases, Information and Computation, 78:171-177, 1988.
-
(1988)
Information and Computation
, vol.78
, pp. 171-177
-
-
Itoh, T.1
Tsujii, S.2
-
11
-
-
0042238560
-
Self complementary normal bases in finite fields
-
A. Lempel and M.J. Weinberger, Self complementary normal bases in finite fields, SIAM J. Disc. Math., 1 (1988), 193-198.
-
(1988)
SIAM J. Disc. Math
, vol.1
, pp. 193-198
-
-
Lempel, A.1
Weinberger, M.J.2
-
14
-
-
84957657892
-
Fast key exchange with elliptic curve systems
-
D. Coppersmith, ED., Springer-Verlag
-
R. Schroepel, H. Orman, S. O’Malley and O. Spatscheck, Fast key exchange with elliptic curve systems, Advances in Cryptology, Proc. Crypto’95, LNCS963, D. Coppersmith, ED., Springer-Verlag, 1995, pp.43-56.
-
(1995)
Advances in Cryptology, Proc. Crypto’95, LNCS963
, pp. 43-56
-
-
Schroepel, R.1
Orman, H.2
O’Malley, S.3
Spatscheck, O.4
-
15
-
-
0021124584
-
Realization and, application of the Massey-Omura lock
-
Mar
-
P.K.S. Wah and M.Z. Wang, Realization and, application of the Massey-Omura lock, in Proc. Int. Zurich Sem., Mar. 1984.
-
(1984)
Proc. Int. Zurich Sem
-
-
Wah, P.K.S.1
Wang, M.Z.2
-
16
-
-
0030104120
-
Taylor, Finite Field Inversion Over the Dual Basis
-
March
-
S.T.J. Fenn and M. Benaissa, and D. Taylor, Finite Field Inversion Over the Dual Basis, IEEE Trans. on VLSI Systems, vol.4, No.1, March 1996.
-
(1996)
IEEE Trans. on VLSI Systems
, vol.4
, Issue.1
-
-
Fenn, S.T.J.1
Benaissa, M.2
-
17
-
-
84958670390
-
Efficient Algorithms for Elliptic Curve Cryptosystems
-
J. Guajardo and C. Paar, Efficient Algorithms for Elliptic Curve Cryptosystems, Advances in Cryptology, CRYPTO’97, pp.342-356, 1997.
-
(1997)
Advances in Cryptology, CRYPTO’97
, pp. 342-356
-
-
Guajardo, J.1
Paar, C.2
|