Skip to main content
Conference ProceedingsOPEN ACCESS

Modulus search for elliptic curve cryptosystems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1999) 1716 1-7
DOI: 10.1007/978-3-540-48000-6_1
2Citations
Citations of this article
37Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We propose a mathematical problem, and show how to solve it elegantly. This problem is related with elliptic curve cryptosystems (ECC). The solving methods can be applied to a new paradigm of key generations of the ECC.

Cite

CITATION STYLE

APA

Koyama, K., Tsuruoka, Y., & Kunihiro, N. (1999). Modulus search for elliptic curve cryptosystems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1716, pp. 1–7). Springer Verlag. https://doi.org/10.1007/978-3-540-48000-6_1

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