Ecc: Do we need to count?

1Citations
Citations of this article
34Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A prohibitive barrier faced by elliptic curve users is the difficulty of computing the curves' cardinalities. Despite recent theoretical breakthroughs, point counting still remains very cumbersome and intensively time consuming. In this paper we show that point counting can be avoided at the cost of a protocol slow-down. This slow-down factor is quite important (typically ≅ 500) but proves that the existence of secure elliptic-curve signatures is not necessarily conditioned by point counting.

Cite

CITATION STYLE

APA

Coron, J. S., Handschuh, H., & Naccache, D. (1999). Ecc: Do we need to count? In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1716, pp. 134–149). Springer Verlag. https://doi.org/10.1007/978-3-540-48000-6_11

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