Results 1 
5 of
5
Speeding Up the Discrete Log Computation on Curves With Automorphisms
, 1999
"... We show how to speed up the discrete log computations on curves having automorphisms of large order, thus generalizing the attacks on ABC elliptic curves. This includes the first known attack on CM (hyper)elliptic curves, as well as most of the hyperelliptic curves described in the literature. ..."
Abstract

Cited by 34 (2 self)
 Add to MetaCart
We show how to speed up the discrete log computations on curves having automorphisms of large order, thus generalizing the attacks on ABC elliptic curves. This includes the first known attack on CM (hyper)elliptic curves, as well as most of the hyperelliptic curves described in the literature.
On the performance of hyperelliptic cryptosystems
, 1999
"... In this paper we discuss various aspects of cryptosystems based on hyperelliptic curves. In particular we cover the implementation of the group law on such curves and how to generate suitable curves for use in cryptography. This paper presents a practical comparison between the performance of ellip ..."
Abstract

Cited by 31 (5 self)
 Add to MetaCart
(Show Context)
In this paper we discuss various aspects of cryptosystems based on hyperelliptic curves. In particular we cover the implementation of the group law on such curves and how to generate suitable curves for use in cryptography. This paper presents a practical comparison between the performance of elliptic curve based digital signature schemes and schemes based on hyperelliptic curves. We conclude that, at present, hyperelliptic curves offer no performance advantage over elliptic curves.
A RAPID GENERATION SCHEME OF LARGE PRIMES
"... RSA is by far the most widely adopted standard in public key cryptography algorithm. Its security depends on the Integer Factorization Problem, that it is very easy to calculate the product of two large prime numbers, but the decomposition the product and get the prime factors are very difficult. Th ..."
Abstract
 Add to MetaCart
RSA is by far the most widely adopted standard in public key cryptography algorithm. Its security depends on the Integer Factorization Problem, that it is very easy to calculate the product of two large prime numbers, but the decomposition the product and get the prime factors are very difficult. Therefore, the generations of large primes are important research field. This paper presented a rapid generation scheme of it, and the techniques for the related software implementation were presented. To speed up the modular multiplication and squaring, Montgomery's algorithms were used with sliding window method. Three pretreatments were also described in details. In view of prime generation of RSA, a series of design methods for software implementation was proposed and give the optimization programs.