Some computational problems of cryptographic significance concerning elliptic curves over rings
type: Item
instance of: scholarly article
title: Some computational problems of cryptographic significance concerning elliptic curves over rings
zbMATH Open document ID: 1006.11075
author: Ming-Deh A. Huang
author: Chaoping Xing
published in: Information and Computation
publication date: 2003-01-14T00:00:00Z
review text: Two computational problems related to an elliptic curve \(E\) over a finite ring \(Z_n\) with \(n\) square-free are studied, namely computing the number of rational points of \(E\) and finding \(Q\) such that, for a given rational point \(P\), \(2Q= P\). Concerning the computational complexity, the two problems are equivalent to integer factoring.
Mathematics Subject Classification ID: 11T71
Mathematics Subject Classification ID: 14G15
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 1853046
MaRDI profile type: Publication
full work available at URL: inco.1998.2766
OpenAlex ID: W1970971760
cites work: Q4934742
cites work: Q4035724
cites work: Factoring integers with elliptic curves
cites work: Q4204265
cites work: Q3141896
cites work: Speeding the Pollard and Elliptic Curve Methods of Factorization
cites work: Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
cites work: Q3710637
DOI: 10.1006/INCO.1998.2766
description: scientific article; zbMATH DE number 1853046