Results 1 to 10 of about 35 (35)
On Types of Elliptic Pseudoprimes [PDF]
Groups, Complexity, Cryptology, 2021 We generalize the notions of elliptic pseudoprimes and elliptic Carmichael numbers introduced by Silverman to analogues of Euler-Jacobi and strong pseudoprimes.
L. Babinkostova +2 more
doaj +1 more source
TRANSPORT PARALLÈLE ET CORRESPONDANCE DE SIMPSON $p$ -ADIQUE
Forum of Mathematics, Sigma, 2017 Deninger et Werner ont développé un analogue pour les courbes $p$ -adiques de la correspondance classique de Narasimhan et Seshadri entre les fibrés ...
DAXIN XU
doaj +1 more source
Prime Divisors of the Number of Rational Points on Elliptic Curves with Complex Multiplication [PDF]
, 2005 This is the peer reviewed version of the following article: Liu, Y.-R. (2005). Prime divisors of the number of rational points on elliptic curves with complex multiplication.
Liu, Yu-Ru
core +1 more source
COMPUTING IMAGES OF GALOIS REPRESENTATIONS ATTACHED TO ELLIPTIC CURVES
Forum of Mathematics, Sigma, 2016 Let $E$ be an elliptic curve without complex multiplication (CM) over a number field $K$
ANDREW V. SUTHERLAND
doaj +1 more source
Efficient halving for genus 3 curves over binary fields [PDF]
, 2009 In this article, we deal with fast arithmetic in the Picard group of hyperelliptic curves of genus 3 over binary fields. We investigate both the optimal performance curves, where [h(x)=1] , and the more general curves where the degree of [h(x)] is 1, 2 ...
Birkner, P. +5 more
core +1 more source
Journal of Mathematical Cryptology, 2015 In this paper we present a new method of choosing primitive elements for Brezing–Weng families of pairing-friendly elliptic curves with small rho-values, and we improve on previously known best rho-values of families [J.
Yoon Kisoon
doaj +1 more source
Isolated elliptic curves and the MOV attack
Journal of Mathematical Cryptology, 2017 We present a variation on the CM method that produces elliptic curves over prime fields with nearly prime order that do not admit many efficiently computable isogenies. Assuming the Bateman–Horn conjecture, we prove that elliptic curves produced this way
Scholl Travis
doaj +1 more source
Generating pairing-friendly elliptic curve parameters using sparse families
Journal of Mathematical Cryptology, 2018 The majority of methods for constructing pairing-friendly elliptic curves are based on representing the curve parameters as polynomial families. There are three such types, namely complete, complete with variable discriminant and sparse families. In this
Fotiadis Georgios, Konstantinou Elisavet
doaj +1 more source
The genus of curves over finite fields with many rational points, [PDF]
, 1996 . We prove the following result which was conjectured by Stichtenoth and Xing: let g be the genus of a projective, non-singular, geometrically irreducible, algebraic curve defined over the finite field with q 2 elements whose number of rational points ...
Rainer Fuhrmann, Fernando Torres
core
On group orders of retional points of elliptic curves
, 2004 We consider elliptic curves without complex multiplication defined over the rationals or with complex multiplication defined over the Hilbert class field of the endomorphism ring.
Weng, Annegret
core