An ECSDA-based Security Approach on Blockchain for Cryptocurrency-based Online Transactions
Creators
- 1. Department of Computer Science and Engineering, Daffodil International University, Dhaka, Bangladesh.
Description
Blockchain is an inventive application model that coordinates agreement instruments, appropriated information stockpiling, highlight point transmission, computerized encryption innovation and numerous other PC advances. This paper investigates the issues that the blockchain still has in the part of security insurance, and acquaints the current arrangements with these issues. One of the methods of advanced money is ring mark which can be achieved by Elliptic Curve Digital Signature Algorithm (ECSDA). In this paper, we present a novel strategy for acquiring quick programming execution of the Elliptic Curve Digital Signature Algorithm in the limited Galois field GF(p) with a discretionary prime modulus p of self-assertive. The most significant component of the technique is that it stays away from bit-level activities which are delayed on chip and performs word-level tasks which are altogether quicker. The calculations utilized in the execution perform word-level activities, exchanging them off for bit-level tasks and in this way bringing about a lot of higher paces. We give the planning consequences of our usage on a 2.8 GHz Pentium 4 processor, supporting our case that ECDSA is suitable for compelled situations.
Files
An ECSDA-based Security 2-Formatted Paper.pdf
Files
(464.4 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:ff9c06a7542524bd542c4ed366c891b0
|
464.4 kB | Preview Download |
Additional details
References
- Vanstone, S. (1992). Responses to NIST"s proposal. Communications of the ACM, 35(7), 50-52.
- Vanstone, S. A. (2003). Next generation security for wireless: elliptic curve cryptography. Computers & Security, 22(5), 412-415.
- Koblitz, N., & Cryptosystems, E. C. (1987). Mathematics of Computation, vol. 48.
- Miller, V. S. (1985, August). Use of elliptic curves in cryptography. In Conference on the theory and application of cryptographic techniques (pp. 417-426). Springer, Berlin, Heidelberg.
- Hankerson, D., Menezes, A. J., & Vanstone, S. (2005). Guide to elliptic curve cryptography. Computing Reviews, 46(1), 13.
- Bos, J. W., Halderman, J. A., Heninger, N., Moore, J., Naehrig, M., & Wustrow, E. (2014, March). Elliptic curve cryptography in practice. In International Conference on Financial Cryptography and Data Security (pp. 157-175). Springer, Berlin, Heidelberg.
- Evans, J. (2014). Bitcoin 2.0: Sidechains and ethereum and zerocash. In Oh my!.
- Gentry, C. (2009, May). Fully homomorphic encryption using ideal lattices. In Proceedings of the fortyfirst annual ACM symposium on Theory of computing (pp. 169-178).
- Barlow, J. P. (2019). A Declaration of the Independence of Cyberspace. Duke Law & Technology Review, 18(1), 5-7.
- Foil Arms and Hog, "WTF is Brexit? - Foil Arms and Hog - YouTube," YouTube, pp. 1–9, 2016.