CRYPTOGRAPHIC FOUNDATIONS FOR BLOCKCHAIN SECURITY IN DECENTRALIZED NETWORKS

Milan Feltovic

Abstract


In the rapidly evolving digital technology landscape, blockchain emerges as a pivotal innovation with the potential to revolutionize industries far beyond its original application in cryptocurrencies like Bitcoin. This article explores the critical role of cryptography in decentralized information networks, emphasizing its importance in ensuring the integrity, confidentiality, and authenticity of digital transactions. It examines the mathematical foundations underlying cryptographic techniques, including elliptic curve cryptography and hash functions, and discusses their application in consensus protocols such as Proof-of-Work. Furthermore, the paper addresses the challenges and potential vulnerabilities posed by quantum computing to current cryptographic standards. By providing a comprehensive overview of both theoretical and practical aspects of cryptography in blockchain technology, this study aims to enlighten readers on the robust security measures essential for maintaining trust and security in decentralized systems. Moreover, the discussion extends to the implications of cryptographic advancements for various sectors such as healthcare, finance, and public administration, highlighting how blockchain enhances transparency and security in these fields. This article underscores the urgency of advancing cryptographic research to address emerging threats and ensure the resilience of blockchain systems against future technological developments. The findings emphasize the need for ongoing innovation in cryptographic methods to safeguard the integrity of decentralized networks in an era of increasing digital interconnectivity.


Keywords


blockchain, cryptography, elliptic curve, hash functions, transaction integrity, Proof-of-Work, quantum computing, public key, digital signatures, encryption protocols.

Full Text:

PDF

References


Aamir, B. (2019). P Vs NP Problem In A Nutshell. Retrieved from https://medium.com/@bilalaamir/p-vs-np-problem-in-a-nutshell-dbf08133bec5

Abelson, H., Ledeen, K., & Lewis, H. (2008, Jun 3). Secret Bits: How Codes Became Unbreakable. Retrieved from informIT: https://www.informit.com/articles/article.aspx?p=1218422

Anon. (2019, Apr 24). Secp256k1. Retrieved from Bitcoin.it: https://en.bitcoin.it/wiki/Secp256k1

Anon. (2023). The cryptographic hash function SHA-256. Retrieved from https://helix.stormhub.org/papers/SHA-256.pdf

Anon. (n.d.). TURING MACHINES. Retrieved from andrew.cmu.edu: https://www.andrew.cmu.edu/user/ko/pdfs/lecture-13.pdf

Briggs, M. E. (1998, Apr 17). An Introduction to the General Number Field Sieve. Retrieved from Virginia Tech.: https://vtechworks.lib.vt.edu/items/3b866f8e-d533-48ae-a671-b88e4cb0a7bc

Buterin, V. (2014). Ethereum Whitepaper. Retrieved from https://ethereum.org/en/whitepaper/

Contributors. (2013, Jul). Trapdoor function. Retrieved from Wikipedia: https://en.wikipedia.org/wiki/Trapdoor_function

Contributors. (2024, Jan). Public-key cryptography. Retrieved from Wikipedia: https://en.wikipedia.org/wiki/Public-key_cryptography

Gallian. (2021). Contemporary abstract algebra. CRC Taylor & Francis Group.

Koblitz, N., Menezes, A., & Vanstone, S. (2000, Mar). The State of Elliptic Curve Cryptography. Designs, Codes and Cryptography, 19, 173-193. doi:10.1023/A:1008354106356

Macedo, C. (2018). www.Dev4Devs.com. Retrieved from What is the Big-O?: https://dev4devs.com/2018/01/19/understanding-the-big-o-how-to-think-to-develop-good-and-fast-and-performatic-solutions/

Nakamoto, S. (2009). Bitcoin: A Peer-to-Peer Electronic Cash System. Retrieved from https://bitcoin.org/bitcoin.pdf

Shor, P. W. (1999). Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. Retrieved from https://epubs.siam.org/doi/10.1137/S0036144598347011

Sipser. (2021). Introduction to the theory of computation. Cengage Learning.


Refbacks

  • There are currently no refbacks.