Conference ProceedingsOPEN ACCESS

Specialized integer factorization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1998) 1403 542-545
DOI: 10.1007/BFb0054152
1Citations
Citations of this article
32Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Vanstone and Zuccherato [3] propose a cryptographic system based on an elliptic curve modulo a composite number. We show that the composite numbers so constructed are easily factored, rendering the system insecure.

Cite

CITATION STYLE

APA

Coppersmith, D. (1998). Specialized integer factorization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1403, pp. 542–545). Springer Verlag. https://doi.org/10.1007/BFb0054152

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free