Skip to search formSkip to main contentSemantic Scholar

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2017

Highly Cited

2017

Providing an efficient anonymous authentication scheme in vehicular ad hoc networks (VANETs) with low computational cost is a… Expand

Is this relevant?

Highly Cited

2010

Highly Cited

2010

The aim of this paper is to describe the theory and implementation of the Elliptic Curve Primality Proving algorithm. Problema, n… Expand

Is this relevant?

2009

2009

Recently, Lu et al. proposed an efficient conditional privacy preservation protocol, named ECPP, based on group signature scheme… Expand

Is this relevant?

2008

2008

Abstract We use elliptic curves with complex multiplication to develop primality tests for Fermat primes and for primes of the… Expand

Is this relevant?

Highly Cited

2008

Highly Cited

2008

In this paper, we introduce an efficient conditional privacy preservation (ECPP) protocol in vehicular ad hoc networks (VANETs… Expand

Is this relevant?

2007

2007

The elliptic curve primality proving (ECPP) algorithm is one of the current fastest practical algorithms for proving the… Expand

Is this relevant?

1999

1999

For any elliptic curve E with complex multiplication by an order in K = QiV^), a point Q of infinite order on E, and any prime p… Expand

Is this relevant?

1998

1998

In 1986, following the work of Schoof on counting points on elliptic curves over finite fields, new algorithms for primality… Expand

Is this relevant?

Highly Cited

1993

Highly Cited

1993

This report describes the theory and implementation of the Elliptic Curve Primality Proving algorithm - ECPP - algorithm. This… Expand

Is this relevant?

Highly Cited

1991

Highly Cited

1991

Elliptic curves play an important role in many areas of modern cryptology such as integer factorization and primality proving… Expand

Is this relevant?