Reducing elliptic curve logarithms to logarithms in a finite field
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
A fast elliptic curve cryptosystem
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Use of Elliptic Curves in Cryptography
CRYPTO '85 Advances in Cryptology
A Survey of Hardware Implementation of RSA (Abstract)
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
An implementation of elliptic curve cryptosystems over F2155
IEEE Journal on Selected Areas in Communications
Parallel collision search with application to hash functions and discrete logarithms
CCS '94 Proceedings of the 2nd ACM Conference on Computer and communications security
An Improved Implementation of Elliptic Curves over GF(2) when Using Projective Point Arithmetic
SAC '01 Revised Papers from the 8th Annual International Workshop on Selected Areas in Cryptography
| Hi-index | 0.00 |
In this paper, we look at the development of a high speed elliptic curve cryptosystem based on a 40 Mhz. Motorola M68030 processor and a high speed optimal normal basis coprocessor for the ground field GF(2155). The advantage of this system is the relatively small block size required for high security applications such as key management and digital signatures. In addition, the design is very compact and efficient and can be easily fit onto a standard Smart Card wafer (the coprocessor core requires less than 1.sq.mil. or