Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Elliptic curve primality

Known as: ECPP, Elliptic curve primality proving, Elliptic curve primality testing 
In mathematics elliptic curve primality testing techniques are among the quickest and most widely used methods in primality proving. It is an idea… Expand
Wikipedia

Related topics

Related topics

14 relations
AlgorithmBaillie–PSW primality testC++Cornacchia's algorithm
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
EAAP: Efficient Anonymous Authentication With Conditional Privacy-Preserving Scheme for Vehicular Ad Hoc Networks
Providing an efficient anonymous authentication scheme in vehicular ad hoc networks (VANETs) with low computational cost is a… Expand
  • figure 1
  • table I
  • table II
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2010
Highly Cited
2010
ELLIPTIC CURVES AND PRIMALITY PROVING
The aim of this paper is to describe the theory and implementation of the Elliptic Curve Primality Proving algorithm. Problema, n… Expand
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
2009
2009
A Robust Conditional Privacy-Preserving Authentication Protocol in VANET
Recently, Lu et al. proposed an efficient conditional privacy preservation protocol, named ECPP, based on group signature scheme… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • figure 1
Is this relevant?
2008
2008
Elliptic curve primality tests for Fermat and related primes
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
ECPP: Efficient Conditional Privacy Preservation Protocol for Secure Vehicular Communications
In this paper, we introduce an efficient conditional privacy preservation (ECPP) protocol in vehicular ad hoc networks (VANETs… Expand
  • figure 1
  • table I
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2007
2007
Implementing the asymptotically fast version of the elliptic curve primality proving algorithm
The elliptic curve primality proving (ECPP) algorithm is one of the current fastest practical algorithms for proving the… Expand
  • table 1
  • table 2
  • table 3
Is this relevant?
1999
1999
On the infinitude of elliptic Carmichael numbers
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
Primality Proving Using Elliptic Curves: An Update
In 1986, following the work of Schoof on counting points on elliptic curves over finite fields, new algorithms for primality… Expand
  • table 1
  • table 2
  • table 3
  • table 5
  • table 4
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Elliptic curves and primality proving
This report describes the theory and implementation of the Elliptic Curve Primality Proving algorithm - ECPP - algorithm. This… Expand
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Building Elliptic Curves Modulo Large Primes
Elliptic curves play an important role in many areas of modern cryptology such as integer factorization and primality proving… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE