Cryptographic Randomness Test of the Modified Hashing Function of SHA256 to Address Length Extension Attack

Cortez, Dan Michael A.; Sison, Ariel M.; Medina, Ruji P.

doi:10.1145/3390525.3390540

Cited by 8 publications

(3 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As an encryption method, hashing functions have been studied and improved over the years to guarantee the highest possible security. Main categories of attacks on hashing functions include Collision attacks [23], Preimage attacks [24], Second-Preimage attacks [25,26], Length extension attack [27], and Brute-force attacks [28].…”

Section: B Sha-256mentioning

confidence: 99%

Approaches to Overpower Proof-of-Work Blockchains Despite Minority

Baniata

Kertész

2023

IEEE Access

View full text Add to dashboard Cite

Blockchain (BC) technology has been established in 2009 by S. Nakamoto, using the Proofof-Work (PoW) to reach consensus in public permissionless networks [1]. Since then, several consensus algorithms were proposed to provide equal (or higher) levels of security, democracy, and scalability, yet with lower levels of energy consumption. However, Nakamoto's model (a.k.a. Bitcoin) still dominates as the most trusted model in the described sittings since alternative solutions might provide lower energy consumption and higher scalability, but they would always require deviating the system towards unrecommended centralization or lower levels of security. That is, Nakamoto's model claims to tolerate (up to) < 50% of the network being controlled by a dishonest party (minority), which cannot be realized in alternative solutions without sacrificing the full decentralization property. In this paper, we investigate this tolerance claim, and we review several approaches that can be used to undermine/overpower PoW-based BCs, even with minority. We discuss those BCs taking Bitcoin as a representative application, where needed. However, the presented approaches can be applied in any PoW-based BC. Specifically, we technically discuss how a dishonest miner in minority, can take over the network using improved Brute-forcing, AI-assisted mining, Quantum Computing, Sharding, Partial Pre-imaging, Selfish mining, among other approaches. Our review serves as a needed collective technical reference (concluding more than 100 references), for practitioners and researchers, who either seek a reliable security implementation of PoW-based BC applications, or seek a comparison of PoW-based, against other BCs, in terms of adversary tolerance.

show abstract

Section: B Sha-256mentioning

confidence: 99%

Approaches to Overpower Proof-of-Work Blockchains Despite Minority

Baniata

Kertész

2023

IEEE Access

View full text Add to dashboard Cite

show abstract

“…The internal state can be reconstructed from the hash digest, which can then be utilized to process fresh data. In this approach, the message can be extended and the hash that is a valid signature for the new message can be computed [36].…”

Section: Length Extension Attackmentioning

confidence: 99%

A comprehensive review of the security flaws of hashing algorithms

Sadeghi-Nasab

Rafe

2022

J Comput Virol Hack Tech

View full text Add to dashboard Cite

Hash functions, which were originally designed for use in a few cryptographic schemes with specific security needs, have since become regular fare for many developers and protocol designers, who regard them as black boxes with magical characteristics. Message digesting, password verification, data structures, compiler operation and linking file name and path together are contemporary examples of hash functions applications. Since 2004, we've observed an exponential increase in the number and power of attacks against standard hash algorithms. In this paper, we investigated well known broken hashing algorithms. A hash function is said to be broken when an attack is found, which, by exploiting special details of how the hash function operates, finds a preimage, a second preimage or a collision faster than the corresponding generic attack. We collected information on all broken hashing algorithms, including their features, applications and attacks. To increase background knowledge, we also provide a summary of the types of attacks in this area.

show abstract

“…Each block contains the previously confirmed block hash within the body of data. Therefore it is impossible to modify a previously confirmed block without changing its hash [10]. Therefore for any modification of a previous block, the hashes for all blocks since this block would also be required to be recalculated.…”

Section: The Byzantine Generals Problemmentioning

confidence: 99%

The Temtum Consensus Algorithm – A Low Energy Replacement to Proof of Work

Dennis¹,

Owenson²

2020

Computer Science &Amp; Information Technology (CS &Amp; IT)

View full text Add to dashboard Cite

This paper presents a novel consensus algorithm deployed within the Temtum cryptocurrency network. An overview of the proof of work consensus algorithm is presented, and gaps in the research are outlined. The Temtum consensus algorithm's unique components, including the Node Participation Document (NPD) and the use of the NIST randomness beacon, are outlined and explained. Comparisons on the cost to attack the consensus algorithm and energy consumption between the Temtum consensus algorithm and Bitcoin's proof of work is presented and evaluated. We conclude this paper summarising the findings of the research and presenting future work to be conducted.

show abstract

Cryptographic Randomness Test of the Modified Hashing Function of SHA256 to Address Length Extension Attack

Cited by 8 publications

References 6 publications

Approaches to Overpower Proof-of-Work Blockchains Despite Minority

Approaches to Overpower Proof-of-Work Blockchains Despite Minority

A comprehensive review of the security flaws of hashing algorithms

The Temtum Consensus Algorithm – A Low Energy Replacement to Proof of Work

Contact Info

Product

Resources

About