Elliptic curve cryptosystems; too good to be true?
Explore this paper's citation graph
- Type
- article
- Published
- 2001-01-01
- Cited by
- 4
- References
- 10
- OpenAlex
- https://openalex.org/W39276277
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:16091517
Keywords
Art, Humanities, Theology, Art history, Philosophy
References
- Elliptic curves in cryptography
- Discrete Logarithms in GF(P) Using the Number Field Sieve
- A method for obtaining digital signatures and public-key cryptosystems
- Monte Carlo methods for index computation ()
- Reducing elliptic curve logarithms to logarithms in a finite field
- New Directions in Cryptography
- Cryptography: A Primer
- Fundamentals of Cryptology: A Professional Reference and Interactive Tutorial
- Use of Elliptic Curves in Cryptography
- Counting Points on Elliptic Curves over Nite Elds
Cited by
- An Approach for Computing the Number of Points on Elliptic Curve y2 = x3 + a (mod p) via Explicit Formula for That Number Modulo p
- Point-Counting on Elliptic Curves Belonging to One Prominent Family: Revisited
- An Efficient Approach to Point-Counting on Elliptic Curves from a Prominent Family over the Prime Field Fp
- An O(log2 p) Approach to Point-Counting on Elliptic Curves From a Prominent Family Over the Prime Field 픽p
Related papers
- Elliptic curve cryptosystems
- Reasearch and Application of Elliptic Curve Cryptosystem
- Analysis on Security of Elliptic Curve Cryptosystem
- Public-key cryptosystems based on elliptic curves
- Research of elliptic curve cryptosystem
- Security analyse of elliptic curve cryptosystem
- Elliptic Curve Public-key Cryptosystem