Scalar Multiplication Algorithms of Elliptic Curve Cryptography over GF (2 m )
Explore this paper's citation graph
Summary
This paper gives an introduction to Elliptic Curve Cryptography and deals with evaluation of fast scalar multiplication with parallelization of field operation and point addition/multiplication.
- Type
- article
- Published
- 2014-09-15
- Cited by
- 1
- References
- 14
- OpenAlex
- https://openalex.org/W2170258245
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:15502632
Keywords
Elliptic curve cryptography, Elliptic Curve Digital Signature Algorithm, Scalar multiplication, Computer science, Cryptography
References
- Elliptic Curves Cryptography
- Speeding the Pollard and elliptic curve methods of factorization
- Sequences of numbers generated by addition in formal groups and new primality and factorization tests
- Elliptic curve cryptosystems
- Elliptic curve public key cryptosystems
- A High Performance ASIC Based Elliptic Curve Cryptographic Processor over GF(p)
- Improved Algorithms for Elliptic Curve Arithmetic in GF(2n)
- Fast Multiplication on Elliptic Curves over GF(2m) without Precomputation
- Use of Elliptic Curves in Cryptography
Cited by
Related papers
- Combining point operations for efficient elliptic curve cryptography scalar multiplication
- Elliptic Curve Cryptography and its applications
- Galois field operational unit for Elliptic Curve Cryptography Digital Signature
- TMVP-Friendly Primes for Efficient Elliptic Curve Cryptography
- An FPGA implementation of elliptic curve cryptography for future secure web transaction
- Research on the Underlying Method of Elliptic Curve Cryptography
- A performance comparison of elliptic curve scalar multiplication algorithms on smartphones
- A Review on Elliptic Curve Cryptography
- Novel approach design of elliptic curve cryptography implementation in VLSI
- Reconfigurable real number field elliptic curve cryptography to improve the security