now reading…

  1. Efficient Methods for Composite Field Arithmetic, E. Savas and C. K. Koc, Technical Report, December 1999.
  2. Fast Arithmetic for Public-Key Algorithms in Galois Fields with Composite Exponents, Christof Paar, Peter Fleischmann, IEEE Transactions on Computers, October 1999, vol. 48, no. 10, pp. 1025-1034.
  3. Fast Arithmetic Architectures for Public-Key Algorithms over Galois Fields GF((2^n)^m), Christof Paar, EUROCRYPT ’97, LNCS 1233, Springer-Verlag, pp. 363-378,1997.
  4. A Fast Software Implementation fo Arithmetic Operations in GF(2^n) (preprint), Erik De Win, Antoon Bosselars, Servaas Vandenberghe, Peter De Gersem, Joos Vandewalle
  5. Efficient Algorithms for Elliptic Curve Cryptosystems, Jorge Guajardo, Master Thesis, Worcester Polytechnic Institute, 1997.
  6. Efficient Algorithms for Elliptic Curve Cryptosystems, Jorge Guajardo, Christof Paar, Advances in Cryptology – CRYPTO ’97, LNCS 1294, pp. 342-356, 1997.
Advertisements