Some computational problems of cryptographic significance concerning elliptic curves over rings

DOI10.1006/inco.1998.2766zbMath1006.11075OpenAlexW1970971760MaRDI QIDQ1854282

Ming-Deh A. Huang, Xing, Chaoping

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1998.2766

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Finite ground fields in algebraic geometry (14G15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factoring integers with elliptic curves
• Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
• Speeding the Pollard and Elliptic Curve Methods of Factorization

This page was built for publication: Some computational problems of cryptographic significance concerning elliptic curves over rings